Let x0 of type ι be given.
Apply H0 with
λ x1 . x1 = pack_b_b_r_e (ap x1 0) (decode_b (ap x1 1)) (decode_b (ap x1 2)) (decode_r (ap x1 3)) (ap x1 4).
Let x1 of type ι be given.
Let x2 of type ι → ι → ι be given.
Assume H1: ∀ x3 . x3 ∈ x1 ⟶ ∀ x4 . x4 ∈ x1 ⟶ x2 x3 x4 ∈ x1.
Let x3 of type ι → ι → ι be given.
Assume H2: ∀ x4 . x4 ∈ x1 ⟶ ∀ x5 . x5 ∈ x1 ⟶ x3 x4 x5 ∈ x1.
Let x4 of type ι → ι → ο be given.
Let x5 of type ι be given.
Assume H3: x5 ∈ x1.
Apply pack_b_b_r_e_0_eq2 with
x1,
x2,
x3,
x4,
x5,
λ x6 x7 . pack_b_b_r_e x1 x2 x3 x4 x5 = pack_b_b_r_e x6 (decode_b (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 1)) (decode_b (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 2)) (decode_r (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 3)) (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 4).
Apply pack_b_b_r_e_4_eq2 with
x1,
x2,
x3,
x4,
x5,
λ x6 x7 . pack_b_b_r_e x1 x2 x3 x4 x5 = pack_b_b_r_e x1 (decode_b (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 1)) (decode_b (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 2)) (decode_r (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 3)) x6.
Apply pack_b_b_r_e_ext with
x1,
x2,
decode_b (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 1),
x3,
decode_b (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 2),
x4,
decode_r (ap (pack_b_b_r_e x1 x2 x3 x4 x5) 3),
x5 leaving 3 subgoals.
The subproof is completed by applying pack_b_b_r_e_1_eq2 with x1, x2, x3, x4, x5.
The subproof is completed by applying pack_b_b_r_e_2_eq2 with x1, x2, x3, x4, x5.
Let x6 of type ι be given.
Assume H4: x6 ∈ x1.
Let x7 of type ι be given.
Assume H5: x7 ∈ x1.
Apply pack_b_b_r_e_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 H4.
The subproof is completed by applying H5.
The subproof is completed by applying iff_refl with x4 x6 x7.