Claim L0: ∀ x0 x1 x2 x3 . struct_r x0 ⟶ struct_r x1 ⟶ BinRelnHom x0 x1 x2 ⟶ BinRelnHom x0 x1 x3 ⟶ struct_r (05907.. x0 x1 x2 x3)

Let x0 of type ι be given.

Let x1 of type ι be given.

Let x2 of type ι be given.

Let x3 of type ι be given.

Assume H0: struct_r x0.

Assume H1: struct_r x1.

Assume H2: BinRelnHom x0 x1 x2.

Assume H3: BinRelnHom x0 x1 x3.

Apply H0 with λ x4 . struct_r (05907.. x4 x1 x2 x3).

Let x4 of type ι be given.

Let x5 of type ι → ι → ο be given.

Apply unknownprop_f1f0d0235cc3f72918ba3b7bc6e671feb556f667a17378616f96007dc95611ad with x4, x5, x1, x2, x3, λ x6 x7 . struct_r x7.

The subproof is completed by applying pack_struct_r_I with {x6 ∈ x4|ap x2 x6 = ap x3 x6}, x5.

Apply unknownprop_2aabccf4699c9f902dcc37be8ad1f3aaa001e5f2bb081556c38a4bbd69d3e5c6 with struct_r leaving 2 subgoals.

Let x0 of type ι be given.

Assume H1: struct_r x0.

The subproof is completed by applying H1.

The subproof is completed by applying L0.

■

Proofgold Proof