Search for blocks/addresses/...

Proofgold Proof

pf
Let x0 of type ι be given.
Assume H0: x0omega.
Claim L1: ...
...
Apply andI with eps_ x0SNoElts_ (ordsucc x0), ∀ x1 . x1ordsucc x0exactly1of2 ((λ x2 . SetAdjoin x2 (Sing 1)) x1eps_ x0) (x1eps_ x0) leaving 2 subgoals.
Let x1 of type ι be given.
Assume H2: x1binunion (Sing 0) {(λ x3 . SetAdjoin x3 (Sing 1)) (ordsucc x2)|x2 ∈ x0}.
Apply binunionE with Sing 0, {(λ x3 . SetAdjoin x3 (Sing 1)) (ordsucc x2)|x2 ∈ x0}, x1, x1SNoElts_ (ordsucc x0) leaving 3 subgoals.
The subproof is completed by applying H2.
Assume H3: x1Sing 0.
Apply SingE with 0, x1, λ x2 x3 . x3SNoElts_ (ordsucc x0) leaving 2 subgoals.
The subproof is completed by applying H3.
Apply binunionI1 with ordsucc x0, {(λ x3 . SetAdjoin x3 (Sing 1)) x2|x2 ∈ ordsucc x0}, 0.
Apply nat_0_in_ordsucc with x0.
The subproof is completed by applying L1.
Assume H3: x1{(λ x3 . SetAdjoin x3 (Sing 1)) (ordsucc x2)|x2 ∈ x0}.
Apply ReplE_impred with x0, λ x2 . (λ x3 . SetAdjoin x3 (Sing 1)) (ordsucc x2), x1, x1SNoElts_ (ordsucc x0) leaving 2 subgoals.
The subproof is completed by applying H3.
Let x2 of type ι be given.
Assume H4: x2x0.
Assume H5: x1 = (λ x3 . SetAdjoin x3 (Sing 1)) (ordsucc x2).
Apply binunionI2 with ordsucc x0, {(λ x4 . SetAdjoin x4 (Sing 1)) x3|x3 ∈ ordsucc x0}, x1.
Apply H5 with λ x3 x4 . x4{(λ x6 . SetAdjoin x6 (Sing 1)) x5|x5 ∈ ordsucc x0}.
Apply ReplI with ordsucc x0, λ x3 . (λ x4 . SetAdjoin x4 (Sing 1)) x3, ordsucc x2.
Apply nat_ordsucc_in_ordsucc with x0, x2 leaving 2 subgoals.
The subproof is completed by applying L1.
The subproof is completed by applying H4.
Let x1 of type ι be given.
Assume H2: x1ordsucc x0.
Claim L3: ...
...
Apply nat_inv with x1, exactly1of2 ((λ x2 . SetAdjoin x2 (Sing 1)) x1eps_ x0) (x1eps_ x0) leaving 3 subgoals.
The subproof is completed by applying L3.
Assume H4: x1 = 0.
Apply H4 with λ x2 x3 . exactly1of2 ((λ x4 . SetAdjoin x4 (Sing 1)) x3eps_ x0) (x3eps_ x0).
Apply exactly1of2_I2 with (λ x2 . SetAdjoin x2 (Sing 1)) 0eps_ x0, 0eps_ x0 leaving 2 subgoals.
Assume H5: (λ x2 . SetAdjoin x2 (Sing 1)) 0binunion (Sing 0) {(λ x3 . SetAdjoin x3 (Sing 1)) (ordsucc x2)|x2 ∈ x0}.
Apply binunionE with Sing 0, {(λ x3 . SetAdjoin x3 (Sing 1)) (ordsucc x2)|x2 ∈ x0}, (λ x2 . SetAdjoin x2 (Sing 1)) 0, False leaving 3 subgoals.
The subproof is completed by applying H5.
Assume H6: (λ x2 . SetAdjoin x2 (Sing 1)) 0Sing 0.
Apply EmptyE with Sing 1.
Apply SingE with 0, (λ x2 . SetAdjoin x2 (Sing 1)) 0, ... leaving 2 subgoals.
...
...
...
...
...