Let x0 of type ι → ο be given.
Apply unknownprop_1db1571afe8c01990252b7801041a0001ba1fedff9d78947d027d61a0ff0ae7f with
x0,
λ x1 . ap x1 0,
PtdSetHom leaving 3 subgoals.
Let x1 of type ι be given.
Let x2 of type ι be given.
Let x3 of type ι be given.
Assume H1: x0 x1.
Assume H2: x0 x2.
Apply H0 with
x1,
λ x4 . PtdSetHom x4 x2 x3 ⟶ x3 ∈ setexp (ap x2 0) (ap x4 0) leaving 2 subgoals.
The subproof is completed by applying H1.
Let x4 of type ι be given.
Let x5 of type ι be given.
Assume H3: x5 ∈ x4.
Apply H0 with
x2,
λ x6 . PtdSetHom (pack_e x4 x5) x6 x3 ⟶ x3 ∈ setexp (ap x6 0) (ap (pack_e x4 x5) 0) leaving 2 subgoals.
The subproof is completed by applying H2.
Let x6 of type ι be given.
Let x7 of type ι be given.
Assume H4: x7 ∈ x6.
Apply unknownprop_266cf3934e79ff708b43f6101066886a004a8b2cb57b38750ae943dbc174c7c9 with
x4,
x6,
x5,
x7,
x3,
λ x8 x9 : ο . x9 ⟶ x3 ∈ setexp (ap (pack_e x6 x7) 0) (ap (pack_e x4 x5) 0).
Apply H5 with
x3 ∈ setexp (ap (pack_e x6 x7) 0) (ap (pack_e x4 x5) 0).
Assume H7:
ap x3 x5 = x7.
Apply pack_e_0_eq2 with
x6,
x7,
λ x8 x9 . x3 ∈ setexp x8 (ap (pack_e x4 x5) 0).
Apply pack_e_0_eq2 with
x4,
x5,
λ x8 x9 . x3 ∈ setexp x6 x8.
The subproof is completed by applying H6.
Let x1 of type ι be given.
Assume H1: x0 x1.
Apply H0 with
x1,
λ x2 . PtdSetHom x2 x2 (lam_id (ap x2 0)) leaving 2 subgoals.
The subproof is completed by applying H1.
Let x2 of type ι be given.
Let x3 of type ι be given.
Assume H2: x3 ∈ x2.
Apply pack_e_0_eq2 with
x2,
x3,
λ x4 x5 . PtdSetHom (pack_e x2 x3) (pack_e x2 x3) (lam_id x4).
Apply unknownprop_266cf3934e79ff708b43f6101066886a004a8b2cb57b38750ae943dbc174c7c9 with
x2,
x2,
x3,
x3,
lam_id x2,
λ x4 x5 : ο . x5.
Apply andI with
lam_id x2 ∈ setexp x2 x2,
ap (lam_id x2) x3 = x3 leaving 2 subgoals.
The subproof is completed by applying lam_id_exp_In with x2.
Apply beta with
x2,
λ x4 . x4,
x3.
The subproof is completed by applying H2.
Let x1 of type ι be given.
Let x2 of type ι be given.
Let x3 of type ι be given.
Let x4 of type ι be given.
Let x5 of type ι be given.
Assume H1: x0 x1.
Assume H2: x0 x2.
Assume H3: x0 x3.
Apply H0 with
x1,
λ x6 . PtdSetHom x6 x2 x4 ⟶ PtdSetHom x2 x3 x5 ⟶ PtdSetHom x6 x3 (lam_comp (ap x6 0) x5 x4) leaving 2 subgoals.
The subproof is completed by applying H1.
Let x6 of type ι be given.
Let x7 of type ι be given.
Assume H4: x7 ∈ x6.