Proofgold Signed Transaction

Param nat_p^nat_p : ι → ο
Definition and^and := λ x0 x1 : ο . ∀ x2 : ο . (x0 ⟶ x1 ⟶ x2) ⟶ x2
Param omega^omega : ι
Param mul_nat^mul_nat : ι → ι → ι
Definition divides_nat^divides_nat := λ x0 x1 . and (and (x0 ∈ omega) (x1 ∈ omega)) (∀ x2 : ο . (∀ x3 . and (x3 ∈ omega) (mul_nat x0 x3 = x1) ⟶ x2) ⟶ x2)
Known and3I^and3I : ∀ x0 x1 x2 : ο . x0 ⟶ x1 ⟶ x2 ⟶ and (and x0 x1) x2
Known nat_p_omega^nat_p_omega : ∀ x0 . nat_p x0 ⟶ x0 ∈ omega
Param ordsucc^ordsucc : ι → ι
Known andI^andI : ∀ x0 x1 : ο . x0 ⟶ x1 ⟶ and x0 x1
Known nat_1^nat_1 : nat_p 1
Known mul_nat_1R^mul_nat_1R : ∀ x0 . mul_nat x0 1 = x0
Theorem 91381..^{divides_nat_ref} : ∀ x0 . nat_p x0 ⟶ divides_nat x0 x0 (proof)
Known nat_0^nat_0 : nat_p 0
Known mul_nat_0R^mul_nat_0R : ∀ x0 . mul_nat x0 0 = 0
Theorem abdca.. : ∀ x0 . nat_p x0 ⟶ divides_nat x0 0 (proof)
Param add_SNo^add_SNo : ι → ι → ι
Param add_nat^add_nat : ι → ι → ι
Known add_nat_add_SNo^{add_nat_add_SNo} : ∀ x0 . x0 ∈ omega ⟶ ∀ x1 . x1 ∈ omega ⟶ add_nat x0 x1 = add_SNo x0 x1
Known add_nat_p^add_nat_p : ∀ x0 . nat_p x0 ⟶ ∀ x1 . nat_p x1 ⟶ nat_p (add_nat x0 x1)
Known omega_nat_p^omega_nat_p : ∀ x0 . x0 ∈ omega ⟶ nat_p x0
Known mul_add_nat_distrL^{mul_add_nat_distrL} : ∀ x0 . nat_p x0 ⟶ ∀ x1 . nat_p x1 ⟶ ∀ x2 . nat_p x2 ⟶ mul_nat x0 (add_nat x1 x2) = add_nat (mul_nat x0 x1) (mul_nat x0 x2)
Theorem 068c4.. : ∀ x0 . nat_p x0 ⟶ ∀ x1 x2 . divides_nat x0 x1 ⟶ divides_nat x0 x2 ⟶ divides_nat x0 (add_SNo x1 x2) (proof)
Known 256ca.. : add_nat 2 2 = 4
Known nat_2^nat_2 : nat_p 2
Theorem 3bd3d.. : add_SNo 2 2 = 4 (proof)
Param SNo^SNo : ι → ο
Param mul_SNo^mul_SNo : ι → ι → ι
Known cebfe.. : ∀ x0 : ι → ο . ∀ x1 x2 : ι → ι → ι . (∀ x3 x4 . x0 x3 ⟶ x0 x4 ⟶ x0 (x1 x3 x4)) ⟶ (∀ x3 x4 x5 . x0 x3 ⟶ x0 x4 ⟶ x0 x5 ⟶ x2 x3 (x1 x4 x5) = x1 (x2 x3 x4) (x2 x3 x5)) ⟶ ∀ x3 x4 x5 x6 . x0 x3 ⟶ x0 x4 ⟶ x0 x5 ⟶ x0 x6 ⟶ x2 x6 (x1 x3 (x1 x4 x5)) = x1 (x2 x6 x3) (x1 (x2 x6 x4) (x2 x6 x5))
Known SNo_add_SNo^SNo_add_SNo : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNo (add_SNo x0 x1)
Known mul_SNo_distrL^{mul_SNo_distrL} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ mul_SNo x0 (add_SNo x1 x2) = add_SNo (mul_SNo x0 x1) (mul_SNo x0 x2)
Theorem 55f68.. : ∀ x0 x1 x2 x3 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNo x3 ⟶ mul_SNo x3 (add_SNo x0 (add_SNo x1 x2)) = add_SNo (mul_SNo x3 x0) (add_SNo (mul_SNo x3 x1) (mul_SNo x3 x2)) (proof)
Known bbdc7.. : ∀ x0 : ι → ο . ∀ x1 x2 : ι → ι → ι . (∀ x3 x4 . x0 x3 ⟶ x0 x4 ⟶ x0 (x1 x3 x4)) ⟶ (∀ x3 x4 x5 . x0 x3 ⟶ x0 x4 ⟶ x0 x5 ⟶ x2 x3 (x1 x4 x5) = x1 (x2 x3 x4) (x2 x3 x5)) ⟶ ∀ x3 x4 x5 x6 x7 . x0 x3 ⟶ x0 x4 ⟶ x0 x5 ⟶ x0 x6 ⟶ x0 x7 ⟶ x2 x7 (x1 x3 (x1 x4 (x1 x5 x6))) = x1 (x2 x7 x3) (x1 (x2 x7 x4) (x1 (x2 x7 x5) (x2 x7 x6)))
Theorem cb85b.. : ∀ x0 x1 x2 x3 x4 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNo x3 ⟶ SNo x4 ⟶ mul_SNo x4 (add_SNo x0 (add_SNo x1 (add_SNo x2 x3))) = add_SNo (mul_SNo x4 x0) (add_SNo (mul_SNo x4 x1) (add_SNo (mul_SNo x4 x2) (mul_SNo x4 x3))) (proof)
Known mul_SNo_distrR^{mul_SNo_distrR} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ mul_SNo (add_SNo x0 x1) x2 = add_SNo (mul_SNo x0 x2) (mul_SNo x1 x2)
Known SNo_2^SNo_2 : SNo 2
Known add_SNo_1_1_2^{add_SNo_1_1_2} : add_SNo 1 1 = 2
Known SNo_1^SNo_1 : SNo 1
Known mul_SNo_oneL^mul_SNo_oneL : ∀ x0 . SNo x0 ⟶ mul_SNo 1 x0 = x0
Known add_SNo_assoc^{add_SNo_assoc} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ add_SNo x0 (add_SNo x1 x2) = add_SNo (add_SNo x0 x1) x2
Theorem 23c65.. : ∀ x0 . SNo x0 ⟶ mul_SNo 4 x0 = add_SNo x0 (add_SNo x0 (add_SNo x0 x0)) (proof)
Param SNoLe^SNoLe : ι → ι → ο
Known add_SNo_Le3^add_SNo_Le3 : ∀ x0 x1 x2 x3 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNo x3 ⟶ SNoLe x0 x2 ⟶ SNoLe x1 x3 ⟶ SNoLe (add_SNo x0 x1) (add_SNo x2 x3)
Theorem 73fab.. : ∀ x0 x1 x2 x3 x4 x5 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNo x3 ⟶ SNo x4 ⟶ SNo x5 ⟶ SNoLe x0 x3 ⟶ SNoLe x1 x4 ⟶ SNoLe x2 x5 ⟶ SNoLe (add_SNo x0 (add_SNo x1 x2)) (add_SNo x3 (add_SNo x4 x5)) (proof)
Known SNo_add_SNo_3^{SNo_add_SNo_3} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNo (add_SNo x0 (add_SNo x1 x2))
Theorem 7b468.. : ∀ x0 x1 x2 x3 x4 x5 x6 x7 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNo x3 ⟶ SNo x4 ⟶ SNo x5 ⟶ SNo x6 ⟶ SNo x7 ⟶ SNoLe x0 x4 ⟶ SNoLe x1 x5 ⟶ SNoLe x2 x6 ⟶ SNoLe x3 x7 ⟶ SNoLe (add_SNo x0 (add_SNo x1 (add_SNo x2 x3))) (add_SNo x4 (add_SNo x5 (add_SNo x6 x7))) (proof)
Param abs_SNo^abs_SNo : ι → ι
Definition or^or := λ x0 x1 : ο . ∀ x2 : ο . (x0 ⟶ x2) ⟶ (x1 ⟶ x2) ⟶ x2
Param SNoLt^SNoLt : ι → ι → ο
Known SNoLtLe_or^SNoLtLe_or : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ or (SNoLt x0 x1) (SNoLe x1 x0)
Known SNo_0^SNo_0 : SNo 0
Param minus_SNo^minus_SNo : ι → ι
Known neg_abs_SNo^neg_abs_SNo : ∀ x0 . SNo x0 ⟶ SNoLt x0 0 ⟶ abs_SNo x0 = minus_SNo x0
Known SNoLtLe^SNoLtLe : ∀ x0 x1 . SNoLt x0 x1 ⟶ SNoLe x0 x1
Known minus_SNo_Lt_contra2^{minus_SNo_Lt_contra2} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLt x0 (minus_SNo x1) ⟶ SNoLt x1 (minus_SNo x0)
Known minus_SNo_0^minus_SNo_0 : minus_SNo 0 = 0
Known nonneg_abs_SNo^{nonneg_abs_SNo} : ∀ x0 . SNoLe 0 x0 ⟶ abs_SNo x0 = x0
Theorem 6e9d4.. : ∀ x0 . SNo x0 ⟶ SNoLe 0 (abs_SNo x0) (proof)
Param int^int : ι
Definition divides_int^divides_int := λ x0 x1 . and (and (x0 ∈ int) (x1 ∈ int)) (∀ x2 : ο . (∀ x3 . and (x3 ∈ int) (mul_SNo x0 x3 = x1) ⟶ x2) ⟶ x2)
Known mul_SNo_minus_distrL^{mul_SNo_minus_distrL} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ mul_SNo (minus_SNo x0) x1 = minus_SNo (mul_SNo x0 x1)
Known SNo_minus_SNo^{SNo_minus_SNo} : ∀ x0 . SNo x0 ⟶ SNo (minus_SNo x0)
Known mul_SNo_minus_distrR^{mul_minus_SNo_distrR} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ mul_SNo x0 (minus_SNo x1) = minus_SNo (mul_SNo x0 x1)
Known minus_SNo_invol^{minus_SNo_invol} : ∀ x0 . SNo x0 ⟶ minus_SNo (minus_SNo x0) = x0
Known SNo_mul_SNo^SNo_mul_SNo : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNo (mul_SNo x0 x1)
Theorem 1ef08.. : ∀ x0 . SNo x0 ⟶ mul_SNo (abs_SNo x0) (abs_SNo x0) = mul_SNo x0 x0 (proof)
Param ordinal^ordinal : ι → ο
Definition Subq^Subq := λ x0 x1 . ∀ x2 . x2 ∈ x0 ⟶ x2 ∈ x1
Known ordinal_Subq_SNoLe^{ordinal_Subq_SNoLe} : ∀ x0 x1 . ordinal x0 ⟶ ordinal x1 ⟶ x0 ⊆ x1 ⟶ SNoLe x0 x1
Known ordinal_Empty^{ordinal_Empty} : ordinal 0
Known nat_p_ordinal^{nat_p_ordinal} : ∀ x0 . nat_p x0 ⟶ ordinal x0
Known Subq_Empty^Subq_Empty : ∀ x0 . 0 ⊆ x0
Theorem 84495.. : ∀ x0 . nat_p x0 ⟶ SNoLe 0 x0 (proof)
Known nat_p_SNo^nat_p_SNo : ∀ x0 . nat_p x0 ⟶ SNo x0
Definition False^False := ∀ x0 : ο . x0
Known FalseE^FalseE : False ⟶ ∀ x0 : ο . x0
Known SNoLe_antisym^{SNoLe_antisym} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLe x0 x1 ⟶ SNoLe x1 x0 ⟶ x0 = x1
Theorem 7bee1.. : ∀ x0 . nat_p x0 ⟶ (x0 = 0 ⟶ ∀ x1 : ο . x1) ⟶ SNoLt 0 x0 (proof)
Known int_SNo_cases^{int_SNo_cases} : ∀ x0 : ι → ο . (∀ x1 . x1 ∈ omega ⟶ x0 x1) ⟶ (∀ x1 . x1 ∈ omega ⟶ x0 (minus_SNo x1)) ⟶ ∀ x1 . x1 ∈ int ⟶ x0 x1
Known minus_SNo_Le_contra^{minus_SNo_Le_contra} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLe x0 x1 ⟶ SNoLe (minus_SNo x1) (minus_SNo x0)
Theorem aa7e8..^{nonneg_int_nat_p} : ∀ x0 . x0 ∈ int ⟶ SNoLe 0 x0 ⟶ nat_p x0 (proof)
Known add_SNo_com^add_SNo_com : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ add_SNo x0 x1 = add_SNo x1 x0
Known ordinal_ordsucc_SNo_eq^{ordinal_ordsucc_SNo_eq} : ∀ x0 . ordinal x0 ⟶ ordsucc x0 = add_SNo 1 x0
Param SNoLev^SNoLev : ι → ι
Known ordinal_SNoLev_max_2^{ordinal_SNoLev_max_2} : ∀ x0 . ordinal x0 ⟶ ∀ x1 . SNo x1 ⟶ SNoLev x1 ∈ ordsucc x0 ⟶ SNoLe x1 x0
Known nat_ordsucc^nat_ordsucc : ∀ x0 . nat_p x0 ⟶ nat_p (ordsucc x0)
Known ordinal_SNoLev^{ordinal_SNoLev} : ∀ x0 . ordinal x0 ⟶ SNoLev x0 = x0
Known ordinal_ordsucc^{ordinal_ordsucc} : ∀ x0 . ordinal x0 ⟶ ordinal (ordsucc x0)
Known ordinal_ordsucc_In^{ordinal_ordsucc_In} : ∀ x0 . ordinal x0 ⟶ ∀ x1 . x1 ∈ x0 ⟶ ordsucc x1 ∈ ordsucc x0
Known ordinal_SNoLt_In^{ordinal_SNoLt_In} : ∀ x0 x1 . ordinal x0 ⟶ ordinal x1 ⟶ SNoLt x0 x1 ⟶ x0 ∈ x1
Theorem a91d1.. : ∀ x0 x1 . nat_p x0 ⟶ nat_p x1 ⟶ SNoLt x0 x1 ⟶ SNoLe (add_SNo x0 1) x1 (proof)
Definition not^not := λ x0 : ο . x0 ⟶ False
Known SNoLt_irref^SNoLt_irref : ∀ x0 . not (SNoLt x0 x0)
Known SNoLeLt_tra^SNoLeLt_tra : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLe x0 x1 ⟶ SNoLt x1 x2 ⟶ SNoLt x0 x2
Known SNoLtLe_tra^SNoLtLe_tra : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt x0 x1 ⟶ SNoLe x1 x2 ⟶ SNoLt x0 x2
Known nat_inv_impred^{nat_inv_impred} : ∀ x0 : ι → ο . x0 0 ⟶ (∀ x1 . nat_p x1 ⟶ x0 (ordsucc x1)) ⟶ ∀ x1 . nat_p x1 ⟶ x0 x1
Known minus_add_SNo_distr^{minus_add_SNo_distr} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ minus_SNo (add_SNo x0 x1) = add_SNo (minus_SNo x0) (minus_SNo x1)
Known add_SNo_minus_R2'^{add_SNo_minus_R2} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ add_SNo (add_SNo x0 (minus_SNo x1)) x1 = x0
Known cases_1^cases_1 : ∀ x0 . x0 ∈ 1 ⟶ ∀ x1 : ι → ο . x1 0 ⟶ x1 x0
Known nat_0_in_ordsucc^{nat_0_in_ordsucc} : ∀ x0 . nat_p x0 ⟶ 0 ∈ ordsucc x0
Known add_SNo_0L^add_SNo_0L : ∀ x0 . SNo x0 ⟶ add_SNo 0 x0 = x0
Known add_SNo_Le1^add_SNo_Le1 : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLe x0 x2 ⟶ SNoLe (add_SNo x0 x1) (add_SNo x2 x1)
Known add_SNo_minus_R2^{add_SNo_minus_R2} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ add_SNo (add_SNo x0 x1) (minus_SNo x1) = x0
Known minus_SNo_Lt_contra3^{minus_SNo_Lt_contra3} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLt (minus_SNo x0) (minus_SNo x1) ⟶ SNoLt x1 x0
Theorem bf402.. : ∀ x0 . x0 ∈ int ⟶ ∀ x1 . x1 ∈ int ⟶ SNoLt x0 x1 ⟶ SNoLe (add_SNo x0 1) x1 (proof)
Known nat_ind^nat_ind : ∀ x0 : ι → ο . x0 0 ⟶ (∀ x1 . nat_p x1 ⟶ x0 x1 ⟶ x0 (ordsucc x1)) ⟶ ∀ x1 . nat_p x1 ⟶ x0 x1
Known nat_p_int^nat_p_int : ∀ x0 . nat_p x0 ⟶ x0 ∈ int
Known abs_SNo_0^abs_SNo_0 : abs_SNo 0 = 0
Known mul_SNo_zeroR^{mul_SNo_zeroR} : ∀ x0 . SNo x0 ⟶ mul_SNo x0 0 = 0
Known int_SNo^int_SNo : ∀ x0 . x0 ∈ int ⟶ SNo x0
Known SNoLe_tra^SNoLe_tra : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLe x0 x1 ⟶ SNoLe x1 x2 ⟶ SNoLe x0 x2
Known SNo_abs_SNo^SNo_abs_SNo : ∀ x0 . SNo x0 ⟶ SNo (abs_SNo x0)
Known pos_mul_SNo_Lt^{pos_mul_SNo_Lt} : ∀ x0 x1 x2 . SNo x0 ⟶ SNoLt 0 x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt x1 x2 ⟶ SNoLt (mul_SNo x0 x1) (mul_SNo x0 x2)
Known SNoLt_0_2^SNoLt_0_2 : SNoLt 0 2
Known add_SNo_0R^add_SNo_0R : ∀ x0 . SNo x0 ⟶ add_SNo x0 0 = x0
Known add_SNo_Lt2^add_SNo_Lt2 : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt x1 x2 ⟶ SNoLt (add_SNo x0 x1) (add_SNo x0 x2)
Known minus_SNo_Lt_contra1^{minus_SNo_Lt_contra1} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLt (minus_SNo x0) x1 ⟶ SNoLt (minus_SNo x1) x0
Known SNoLt_0_1^SNoLt_0_1 : SNoLt 0 1
Known int_add_SNo^int_add_SNo : ∀ x0 . x0 ∈ int ⟶ ∀ x1 . x1 ∈ int ⟶ add_SNo x0 x1 ∈ int
Known int_minus_SNo^{int_minus_SNo} : ∀ x0 . x0 ∈ int ⟶ minus_SNo x0 ∈ int
Known abs_SNo_dist_swap^{abs_SNo_dist_swap} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ abs_SNo (add_SNo x0 (minus_SNo x1)) = abs_SNo (add_SNo x1 (minus_SNo x0))
Known add_SNo_minus_Lt1b^{add_SNo_minus_Lt1b} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt x0 (add_SNo x2 x1) ⟶ SNoLt (add_SNo x0 (minus_SNo x1)) x2
Known add_SNo_minus_Le2b^{add_SNo_minus_Le2b} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLe (add_SNo x2 x1) x0 ⟶ SNoLe x2 (add_SNo x0 (minus_SNo x1))
Known SNoLeE^SNoLeE : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLe x0 x1 ⟶ or (SNoLt x0 x1) (x0 = x1)
Known pos_abs_SNo^pos_abs_SNo : ∀ x0 . SNoLt 0 x0 ⟶ abs_SNo x0 = x0
Known add_SNo_minus_SNo_prop2^{add_SNo_minus_SNo_prop2} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ add_SNo x0 (add_SNo (minus_SNo x0) x1) = x1
Theorem 2a08a.. : ∀ x0 . nat_p x0 ⟶ (x0 = 0 ⟶ ∀ x1 : ο . x1) ⟶ ∀ x1 . nat_p x1 ⟶ ∀ x2 : ο . (∀ x3 . and (x3 ∈ int) (and (SNoLe (mul_SNo 2 (abs_SNo x3)) x0) (divides_nat x0 (add_SNo x1 (minus_SNo x3)))) ⟶ x2) ⟶ x2 (proof)