Search for blocks/addresses/...

Proofgold Proof

pf
Let x0 of type ι be given.
Let x1 of type ι be given.
Assume H0: ordinal x0.
Assume H1: ordinal x1.
Let x2 of type ιο be given.
Let x3 of type ιο be given.
Assume H2: or (PNoLt x0 x2 x1 x3) (and (x0 = x1) (PNoEq_ x0 x2 x3)).
Assume H3: or (PNoLt x1 x3 x0 x2) (and (x1 = x0) (PNoEq_ x1 x3 x2)).
Apply H2 with and (x0 = x1) (PNoEq_ x0 x2 x3) leaving 2 subgoals.
Assume H4: PNoLt x0 x2 x1 x3.
Apply FalseE with and (x0 = x1) (PNoEq_ x0 x2 x3).
Apply H3 with False leaving 2 subgoals.
Assume H5: PNoLt x1 x3 x0 x2.
Apply PNoLt_irref with x0, x2.
Apply PNoLt_tra with x0, x1, x0, x2, x3, x2 leaving 5 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying H1.
The subproof is completed by applying H0.
The subproof is completed by applying H4.
The subproof is completed by applying H5.
Assume H5: and (x1 = x0) (PNoEq_ x1 x3 x2).
Apply H5 with False.
Assume H6: x1 = x0.
Assume H7: PNoEq_ x1 x3 x2.
Apply PNoLtE with x0, x1, x2, x3, False leaving 4 subgoals.
The subproof is completed by applying H4.
Assume H8: PNoLt_ (binintersect x0 x1) x2 x3.
Apply H8 with False.
Let x4 of type ι be given.
Assume H9: (λ x5 . and (x5binintersect x0 x1) (and (and (PNoEq_ x5 x2 x3) (not (x2 x5))) (x3 x5))) x4.
Apply H9 with False.
Assume H10: x4binintersect x0 x1.
Apply binintersectE with x0, x1, x4, and (and (PNoEq_ x4 x2 x3) (not (x2 x4))) (x3 x4)False leaving 2 subgoals.
The subproof is completed by applying H10.
Assume H11: x4x0.
Assume H12: x4x1.
Assume H13: and (and (PNoEq_ x4 x2 x3) (not (x2 x4))) (x3 x4).
Apply H13 with False.
Assume H14: and (PNoEq_ x4 x2 x3) (not (x2 x4)).
Apply H14 with x3 x4False.
Assume H15: PNoEq_ x4 x2 x3.
Assume H16: not (x2 x4).
Assume H17: x3 x4.
Apply H16.
Apply iffEL with x3 x4, x2 x4 leaving 2 subgoals.
Apply H7 with x4.
The subproof is completed by applying H12.
The subproof is completed by applying H17.
Assume H8: x0x1.
Assume H9: PNoEq_ x0 x2 x3.
Assume H10: x3 x0.
Apply In_irref with x0.
Apply H6 with λ x4 x5 . x0x4.
The subproof is completed by applying H8.
Assume H8: x1x0.
Assume H9: PNoEq_ x1 x2 x3.
Assume H10: not (x2 x1).
Apply In_irref with x0.
Apply H6 with λ x4 x5 . x4x0.
The subproof is completed by applying H8.
Assume H4: and (x0 = x1) (PNoEq_ x0 x2 x3).
The subproof is completed by applying H4.