Search for blocks/addresses/...

Proofgold Proof

pf
Let x0 of type ι be given.
Assume H0: prime_nat x0.
Assume H1: odd_nat x0.
Apply dneg with ∃ x1 . and (x1setminus x0 (Sing 0)) (∃ x2 . and (x2omega) (∃ x3 . and (x3omega) (∃ x4 . and (x4omega) (∃ x5 . and (x5omega) (mul_SNo x1 x0 = add_SNo ((λ x6 . mul_SNo x6 x6) x2) (add_SNo ((λ x6 . mul_SNo x6 x6) x3) (add_SNo ((λ x6 . mul_SNo x6 x6) x4) ((λ x6 . mul_SNo x6 x6) x5)))))))).
Assume H2: not (∃ x1 . and (x1setminus x0 (Sing 0)) (∃ x2 . and (x2omega) (∃ x3 . and (x3omega) (∃ x4 . and (x4omega) (∃ x5 . and (x5omega) (mul_SNo x1 x0 = add_SNo ((λ x6 . mul_SNo x6 x6) x2) (add_SNo ((λ x6 . mul_SNo x6 x6) x3) (add_SNo ((λ x6 . mul_SNo x6 x6) x4) ((λ x6 . mul_SNo x6 x6) x5))))))))).
Apply H1 with False.
Assume H3: x0omega.
Assume H4: ∀ x1 . x1omegax0 = mul_nat 2 x1∀ x2 : ο . x2.
Claim L5: ...
...
Claim L6: ...
...
Claim L7: ...
...
Claim L8: ...
...
Claim L9: ...
...
Claim L10: ...
...
Claim L11: ...
...
Claim L12: ...
...
Apply odd_nat_even_nat_S with x0, False leaving 2 subgoals.
The subproof is completed by applying H1.
Assume H13: ordsucc x0omega.
Assume H14: ∃ x1 . and (x1omega) (ordsucc x0 = mul_nat 2 x1).
Apply H14 with False.
Let x1 of type ι be given.
Assume H15: (λ x2 . and (x2omega) (ordsucc x0 = mul_nat 2 x2)) x1.
Apply H15 with False.
Assume H16: x1omega.
Claim L17: ...
...
Claim L18: ...
...
Claim L19: ...
...
Claim L20: ...
...
Apply mul_nat_mul_SNo with 2, x1, λ x2 x3 . ordsucc x0 = x3False leaving 3 subgoals.
Apply nat_p_omega with 2.
The subproof is completed by applying nat_2.
The subproof is completed by applying H16.
Apply unknownprop_e5d031cf873471b22fe77dee36ebb6254dbd5df83fe741afd4ca8450323be464 with x1, λ x2 x3 . ordsucc x0 = x3False leaving 2 subgoals.
The subproof is completed by applying L19.
Assume H21: ordsucc x0 = add_SNo x1 x1.
Claim L22: ...
...
Claim L23: ...
...
Claim L24: ...
...
Claim L25: ...
...
Claim L26: ...
...
Claim L27: ...
...
Claim L28: ...
...
Claim L29: ...
...
Claim L30: ...
...
Claim L31: ...
...
Claim L32: ...
...
Claim L33: ...
...
Claim L34: ...
...
Claim L35: ...
...
Claim L36: ...
...
Claim L37: ...
...
Apply unknownprop_8a6bdce060c93f04626730b6e01b099cc0487102a697e253c81b39b9a082262d with x0 leaving 2 subgoals.
Apply omega_nat_p with x0.
The subproof is completed by applying H3.
Apply H21 with λ x2 x3 . atleastp x3 x0.
Apply atleastp_tra with add_SNo x1 x1, setsum x1 x1, x0 leaving 2 subgoals.
Apply equip_atleastp with add_SNo x1 x1, setsum x1 x1.
Apply add_nat_add_SNo with x1, x1, λ x2 x3 . equip x2 (setsum x1 x1) leaving 3 subgoals.
The subproof is completed by applying H16.
The subproof is completed by applying H16.
Apply unknownprop_80fb4e499c5b9d344e7e79a37790e81cc16e6fd6cd87e88e961f3c8c4d6d418f with x1, x1, x1, x1 leaving 4 subgoals.
Apply omega_nat_p with x1.
The subproof is completed by applying H16.
Apply omega_nat_p with x1.
The subproof is completed by applying H16.
The subproof is completed by applying equip_ref with x1.
The subproof is completed by applying equip_ref with x1.
Let x2 of type ο be given.
Assume H38: ∀ x3 : ι → ι . inj (setsum x1 x1) x0 x3x2.
Apply H38 with combine_funcs x1 x1 (λ x3 . 96eca.. x0 (mul_SNo x3 x3)) (λ x3 . 96eca.. x0 (add_SNo (mul_SNo x0 x0) (add_SNo (minus_SNo (mul_SNo x3 x3)) (minus_SNo 1)))).
Apply andI with ∀ x3 . ...combine_funcs x1 x1 ... ... ......, ... leaving 2 subgoals.
...
...