Let x0 of type ι be given.
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.
Apply pack_b_e_0_eq with
pack_b_e x0 x2 x4,
x1,
x3,
x5.
The subproof is completed by applying H0.
Claim L2: x0 = x1
Apply L1 with
λ x6 x7 . x0 = x7.
The subproof is completed by applying pack_b_e_0_eq2 with x0, x2, x4.
Apply and3I with
x0 = x1,
∀ x6 . x6 ∈ x0 ⟶ ∀ x7 . x7 ∈ x0 ⟶ x2 x6 x7 = x3 x6 x7,
x4 = x5 leaving 3 subgoals.
The subproof is completed by applying L2.
Let x6 of type ι be given.
Assume H3: x6 ∈ x0.
Let x7 of type ι be given.
Assume H4: x7 ∈ x0.
Apply pack_b_e_1_eq2 with
x0,
x2,
x4,
x6,
x7,
λ x8 x9 . x9 = x3 x6 x7 leaving 3 subgoals.
The subproof is completed by applying H3.
The subproof is completed by applying H4.
Claim L5: x6 ∈ x1
Apply L2 with
λ x8 x9 . x6 ∈ x8.
The subproof is completed by applying H3.
Claim L6: x7 ∈ x1
Apply L2 with
λ x8 x9 . x7 ∈ x8.
The subproof is completed by applying H4.
Apply H0 with
λ x8 x9 . decode_b (ap x9 1) x6 x7 = x3 x6 x7.
Let x8 of type ι → ι → ο be given.
Apply pack_b_e_1_eq2 with
x1,
x3,
x5,
x6,
x7,
λ x9 x10 . x8 x10 x9 leaving 2 subgoals.
The subproof is completed by applying L5.
The subproof is completed by applying L6.
Apply pack_b_e_2_eq2 with
x0,
x2,
x4,
λ x6 x7 . x7 = x5.
Apply H0 with
λ x6 x7 . ap x7 2 = x5.
Let x6 of type ι → ι → ο be given.
The subproof is completed by applying pack_b_e_2_eq2 with x1, x3, x5, λ x7 x8 . x6 x8 x7.