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.
Apply unpack_b_b_e_e_o_eq with
λ x5 . λ x6 x7 : ι → ι → ι . λ x8 x9 . explicit_Field x5 x8 x9 x6 x7,
x0,
x1,
x2,
x3,
x4.
Let x5 of type ι → ι → ι be given.
Assume H0: ∀ x6 . x6 ∈ x0 ⟶ ∀ x7 . x7 ∈ x0 ⟶ x1 x6 x7 = x5 x6 x7.
Let x6 of type ι → ι → ι be given.
Assume H1: ∀ x7 . x7 ∈ x0 ⟶ ∀ x8 . x8 ∈ x0 ⟶ x2 x7 x8 = x6 x7 x8.
Let x7 of type ο → ο → ο be given.
Apply prop_ext with
explicit_Field x0 x3 x4 x1 x2,
explicit_Field x0 x3 x4 x5 x6,
λ x8 x9 : ο . x7 x9 x8.
Apply explicit_Field_repindep with
x0,
x3,
x4,
x1,
x2,
x5,
x6 leaving 2 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying H1.