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.
Assume H0:
∀ x6 : (ι → ο) → ο . (∀ x7 : ι → ο . (∀ x8 . x7 x8 ⟶ x8 ∈ x1) ⟶ iff (x2 x7) (x6 x7)) ⟶ ∀ x7 : ι → ι . (∀ x8 . x8 ∈ x1 ⟶ x3 x8 = x7 x8) ⟶ x0 x1 x6 x7 x4 x5 = x0 x1 x2 x3 x4 x5.
Apply pack_c_u_e_e_0_eq2 with
x1,
x2,
x3,
x4,
x5,
λ x6 x7 . x0 x6 (decode_c (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 1)) (ap (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 2)) (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 3) (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 4) = x0 x1 x2 x3 x4 x5.
Apply pack_c_u_e_e_3_eq2 with
x1,
x2,
x3,
x4,
x5,
λ x6 x7 . x0 x1 (decode_c (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 1)) (ap (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 2)) x6 (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 4) = x0 x1 x2 x3 x4 x5.
Apply pack_c_u_e_e_4_eq2 with
x1,
x2,
x3,
x4,
x5,
λ x6 x7 . x0 x1 (decode_c (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 1)) (ap (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 2)) x4 x6 = x0 x1 x2 x3 x4 x5.
Apply H0 with
decode_c (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 1),
ap (ap (pack_c_u_e_e x1 x2 x3 x4 x5) 2) leaving 2 subgoals.
Let x6 of type ι → ο be given.
Assume H1: ∀ x7 . x6 x7 ⟶ x7 ∈ x1.
Apply pack_c_u_e_e_1_eq2 with
x1,
x2,
x3,
x4,
x5,
x6,
λ x7 x8 : ο . iff (x2 x6) x7 leaving 2 subgoals.
The subproof is completed by applying H1.
The subproof is completed by applying iff_refl with x2 x6.
The subproof is completed by applying pack_c_u_e_e_2_eq2 with x1, x2, x3, x4, x5.