Let x0 of type ο be given.

Assume H0: ∀ x1 : ι → ι → ι . (∃ x2 x3 : ι → ι → ι . ∃ x4 : ι → ι → ι → ι → ι → ι . MetaCat_product_constr_p EquivReln BinRelnHom struct_id struct_comp x1 x2 x3 x4) ⟶ x0.

Apply H0 with BinReln_product.

Let x1 of type ο be given.

Assume H1: ∀ x2 : ι → ι → ι . (∃ x3 : ι → ι → ι . ∃ x4 : ι → ι → ι → ι → ι → ι . MetaCat_product_constr_p EquivReln BinRelnHom struct_id struct_comp BinReln_product x2 x3 x4) ⟶ x1.

Apply H1 with λ x2 x3 . lam (setprod (ap x2 0) (ap x3 0)) (λ x4 . ap x4 0).

Let x2 of type ο be given.

Assume H2: ∀ x3 : ι → ι → ι . (∃ x4 : ι → ι → ι → ι → ι → ι . MetaCat_product_constr_p EquivReln BinRelnHom struct_id struct_comp BinReln_product (λ x5 x6 . lam (setprod (ap x5 0) (ap x6 0)) (λ x7 . ap x7 0)) x3 x4) ⟶ x2.

Apply H2 with λ x3 x4 . lam (setprod (ap x3 0) (ap x4 0)) (λ x5 . ap x5 1).

Let x3 of type ο be given.

Assume H3: ∀ x4 : ι → ι → ι → ι → ι → ι . MetaCat_product_constr_p EquivReln BinRelnHom struct_id struct_comp BinReln_product (λ x5 x6 . lam (setprod (ap x5 0) (ap x6 0)) (λ x7 . ap x7 0)) (λ x5 x6 . lam (setprod (ap x5 0) (ap x6 0)) (λ x7 . ap x7 1)) x4 ⟶ x3.

Apply H3 with λ x4 x5 x6 x7 x8 . lam (ap x6 0) (λ x9 . lam 2 (λ x10 . If_i (x10 = 0) (ap x7 x9) (ap x8 x9))).

Apply unknownprop_5f5149dc445b1bf6ca4a7f60e27b87771b4704fa8e9610ac4ab806ac27b93c0b with EquivReln leaving 2 subgoals.

The subproof is completed by applying unknownprop_999856ae9112da4d6c02cc0a35b6747ba899604e10f058603fe54a3d0e6dd84e.

The subproof is completed by applying unknownprop_14dbc7e1c7a78e629c0514eea43ba5e75b81d08d29e9a14a8cd9aa31fb1ce134.

■

Proofgold Proof