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 . x7 ∈ x1 ⟶ ∀ x8 . x8 ∈ x1 ⟶ x2 x7 x8 = x6 x7 x8) ⟶ ∀ x7 : ι → ι . (∀ x8 . x8 ∈ x1 ⟶ x3 x8 = x7 x8) ⟶ ∀ x8 : ι → ι → ο . (∀ x9 . x9 ∈ x1 ⟶ ∀ x10 . x10 ∈ x1 ⟶ iff (x4 x9 x10) (x8 x9 x10)) ⟶ ∀ x9 : ι → ι → ο . (∀ x10 . x10 ∈ x1 ⟶ ∀ x11 . x11 ∈ x1 ⟶ iff (x5 x10 x11) (x9 x10 x11)) ⟶ x0 x1 x6 x7 x8 x9 = x0 x1 x2 x3 x4 x5.
Apply pack_b_u_r_r_0_eq2 with
x1,
x2,
x3,
x4,
x5,
λ x6 x7 . x0 x6 (decode_b (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 1)) (ap (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 2)) (decode_r (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 3)) (decode_r (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 4)) = x0 x1 x2 x3 x4 x5.
Apply H0 with
decode_b (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 1),
ap (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 2),
decode_r (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 3),
decode_r (ap (pack_b_u_r_r x1 x2 x3 x4 x5) 4) leaving 4 subgoals.
The subproof is completed by applying pack_b_u_r_r_1_eq2 with x1, x2, x3, x4, x5.
The subproof is completed by applying pack_b_u_r_r_2_eq2 with x1, x2, x3, x4, x5.
Let x6 of type ι be given.
Assume H1: x6 ∈ x1.
Let x7 of type ι be given.
Assume H2: x7 ∈ x1.
Apply pack_b_u_r_r_3_eq2 with
x1,
x2,
x3,
x4,
x5,
x6,
x7,
λ x8 x9 : ο . iff (x4 x6 x7) x8 leaving 3 subgoals.
The subproof is completed by applying H1.
The subproof is completed by applying H2.
The subproof is completed by applying iff_refl with x4 x6 x7.
Let x6 of type ι be given.
Assume H1: x6 ∈ x1.
Let x7 of type ι be given.
Assume H2: x7 ∈ x1.
Apply pack_b_u_r_r_4_eq2 with
x1,
x2,
x3,
x4,
x5,
x6,
x7,
λ x8 x9 : ο . iff (x5 x6 x7) x8 leaving 3 subgoals.
The subproof is completed by applying H1.
The subproof is completed by applying H2.
The subproof is completed by applying iff_refl with x5 x6 x7.