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:
explicit_Field x0 x1 x2 x3 x4 ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ prim1 (x3 x6 x7) x0) ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ ∀ x8 . prim1 x8 x0 ⟶ x3 x6 (x3 x7 x8) = x3 (x3 x6 x7) x8) ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ x3 x6 x7 = x3 x7 x6) ⟶ prim1 x1 x0 ⟶ (∀ x6 . prim1 x6 x0 ⟶ x3 x1 x6 = x6) ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∃ x7 . and (prim1 x7 x0) (x3 x6 x7 = x1)) ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ prim1 (x4 x6 x7) x0) ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ ∀ x8 . prim1 x8 x0 ⟶ x4 x6 (x4 x7 x8) = x4 (x4 x6 x7) x8) ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ x4 x6 x7 = x4 x7 x6) ⟶ prim1 x2 x0 ⟶ (x2 = x1 ⟶ ∀ x6 : ο . x6) ⟶ (∀ x6 . prim1 x6 x0 ⟶ x4 x2 x6 = x6) ⟶ (∀ x6 . prim1 x6 x0 ⟶ (x6 = x1 ⟶ ∀ x7 : ο . x7) ⟶ ∃ x7 . and (prim1 x7 x0) (x4 x6 x7 = x2)) ⟶ (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ ∀ x8 . prim1 x8 x0 ⟶ x4 x6 (x3 x7 x8) = x3 (x4 x6 x7) (x4 x6 x8)) ⟶ x5.
Apply and7E with
and (and (and (and (and (and (and (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ prim1 (x3 x6 x7) x0) (∀ x6 . prim1 x6 x0 ⟶ ∀ x7 . prim1 x7 x0 ⟶ ∀ x8 . prim1 x8 x0 ⟶ x3 x6 (x3 x7 x8) = x3 (x3 x6 x7) x8)) (∀ x6 . ... ⟶ ∀ x7 . ... ⟶ x3 x6 x7 = x3 x7 ...)) ...) ...) ...) ...) ...,
...,
...,
...,
...,
...,
...,
... leaving 2 subgoals.