Search for blocks/addresses/...

Proofgold Proof

pf
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: nat_p x2.
Assume H1: nat_p x3.
Assume H2: TwoRamseyProp_atleastp (ordsucc x0) x1 x2.
Assume H3: TwoRamseyProp_atleastp x0 (ordsucc x1) x3.
Let x4 of type ιιο be given.
Assume H4: ∀ x5 x6 . x4 x5 x6x4 x6 x5.
Claim L5: ...
...
Claim L6: ...
...
Apply unknownprop_b2fe1166cc90aada9c2da7a2f96ec027f60d52a2799891b4e0a891d3402a8b5f with x2, x3, {x5 ∈ add_nat x2 x3|not (x4 x5 (add_nat x2 x3))}, {x5 ∈ add_nat x2 x3|x4 x5 (add_nat x2 x3)}, or (∃ x5 . and (x5ordsucc (add_nat x2 x3)) (and (atleastp (ordsucc x0) x5) (∀ x6 . x6x5∀ x7 . x7x5(x6 = x7∀ x8 : ο . x8)x4 x6 x7))) (∃ x5 . and (x5ordsucc (add_nat x2 x3)) (and (atleastp (ordsucc x1) x5) (∀ x6 . x6x5∀ x7 . x7x5(x6 = x7∀ x8 : ο . x8)not (x4 x6 x7)))) leaving 5 subgoals.
The subproof is completed by applying H0.
The subproof is completed by applying H1.
The subproof is completed by applying L6.
Assume H7: atleastp x2 {x5 ∈ add_nat x2 x3|not (x4 x5 (add_nat x2 x3))}.
Apply H7 with or (∃ x5 . and (x5ordsucc (add_nat x2 x3)) (and (atleastp (ordsucc x0) x5) (∀ x6 . x6x5∀ x7 . x7x5(x6 = x7∀ x8 : ο . x8)x4 x6 x7))) (∃ x5 . and (x5ordsucc (add_nat x2 x3)) (and (atleastp (ordsucc x1) x5) (∀ x6 . x6x5∀ x7 . x7x5(x6 = x7∀ x8 : ο . x8)not (x4 x6 x7)))).
Let x5 of type ιι be given.
Assume H8: inj x2 {x6 ∈ add_nat x2 x3|not (x4 x6 (add_nat x2 x3))} x5.
Apply H8 with or (∃ x6 . and (x6ordsucc (add_nat x2 x3)) (and (atleastp (ordsucc x0) x6) (∀ x7 . x7x6∀ x8 . x8x6(x7 = x8∀ x9 : ο . x9)x4 x7 x8))) (∃ x6 . and (x6ordsucc (add_nat x2 x3)) (and (atleastp (ordsucc x1) x6) (∀ x7 . x7x6∀ x8 . x8x6(x7 = x8∀ x9 : ο . x9)not (x4 x7 x8)))).
Assume H9: ∀ x6 . ...x5 x6{x7 ∈ add_nat x2 x3|not (x4 x7 (add_nat ... ...))}.
...
...