Proofgold Address

Param Pi^Pi : ι → (ι → ι) → ι
Definition setexp^setexp := λ x0 x1 . Pi x1 (λ x2 . x0)
Param SNoS_^SNoS_ : ι → ι
Param omega^omega : ι
Param SNoLt^SNoLt : ι → ι → ο
Param ap^ap : ι → ι → ι
Definition and^and := λ x0 x1 : ο . ∀ x2 : ο . (x0 ⟶ x1 ⟶ x2) ⟶ x2
Param SNo^SNo : ι → ο
Definition SNoCutP^SNoCutP := λ x0 x1 . and (and (∀ x2 . x2 ∈ x0 ⟶ SNo x2) (∀ x2 . x2 ∈ x1 ⟶ SNo x2)) (∀ x2 . x2 ∈ x0 ⟶ ∀ x3 . x3 ∈ x1 ⟶ SNoLt x2 x3)
Param SNoCut^SNoCut : ι → ι → ι
Param SNoLev^SNoLev : ι → ι
Param ordsucc^ordsucc : ι → ι
Param binunion^binunion : ι → ι → ι
Param famunion^famunion : ι → (ι → ι) → ι
Definition Subq^Subq := λ x0 x1 . ∀ x2 . x2 ∈ x0 ⟶ x2 ∈ x1
Param SNoEq_^SNoEq_ : ι → ι → ι → ο
Known SNoCutP_SNoCut_impred^{SNoCutP_SNoCut_impred} : ∀ x0 x1 . SNoCutP x0 x1 ⟶ ∀ x2 : ο . (SNo (SNoCut x0 x1) ⟶ SNoLev (SNoCut x0 x1) ∈ ordsucc (binunion (famunion x0 (λ x3 . ordsucc (SNoLev x3))) (famunion x1 (λ x3 . ordsucc (SNoLev x3)))) ⟶ (∀ x3 . x3 ∈ x0 ⟶ SNoLt x3 (SNoCut x0 x1)) ⟶ (∀ x3 . x3 ∈ x1 ⟶ SNoLt (SNoCut x0 x1) x3) ⟶ (∀ x3 . SNo x3 ⟶ (∀ x4 . x4 ∈ x0 ⟶ SNoLt x4 x3) ⟶ (∀ x4 . x4 ∈ x1 ⟶ SNoLt x3 x4) ⟶ and (SNoLev (SNoCut x0 x1) ⊆ SNoLev x3) (SNoEq_ (SNoLev (SNoCut x0 x1)) (SNoCut x0 x1) x3)) ⟶ x2) ⟶ x2
Known SNoCutP_SNoCut_omega^{SNoCutP_SNoCut_omega} : ∀ x0 . x0 ⊆ SNoS_ omega ⟶ ∀ x1 . x1 ⊆ SNoS_ omega ⟶ SNoCutP x0 x1 ⟶ SNoLev (SNoCut x0 x1) ∈ ordsucc omega
Param ordinal^ordinal : ι → ο
Param SNo_^SNo_ : ι → ι → ο
Known SNoS_I^SNoS_I : ∀ x0 . ordinal x0 ⟶ ∀ x1 x2 . x2 ∈ x0 ⟶ SNo_ x2 x1 ⟶ x1 ∈ SNoS_ x0
Known ordsucc_omega_ordinal^{ordsucc_omega_ordinal} : ordinal (ordsucc omega)
Known SNoLev_^SNoLev_ : ∀ x0 . SNo x0 ⟶ SNo_ (SNoLev x0) x0
Known ReplI^ReplI : ∀ x0 . ∀ x1 : ι → ι . ∀ x2 . x2 ∈ x0 ⟶ x1 x2 ∈ prim5 x0 x1
Known ReplE_impred^ReplE_impred : ∀ x0 . ∀ x1 : ι → ι . ∀ x2 . x2 ∈ prim5 x0 x1 ⟶ ∀ x3 : ο . (∀ x4 . x4 ∈ x0 ⟶ x2 = x1 x4 ⟶ x3) ⟶ x3
Known ap_Pi^ap_Pi : ∀ x0 . ∀ x1 : ι → ι . ∀ x2 x3 . x2 ∈ Pi x0 x1 ⟶ x3 ∈ x0 ⟶ ap x2 x3 ∈ x1 x3
Known and3I^and3I : ∀ x0 x1 x2 : ο . x0 ⟶ x1 ⟶ x2 ⟶ and (and x0 x1) x2
Known SNoS_E2^SNoS_E2 : ∀ x0 . ordinal x0 ⟶ ∀ x1 . x1 ∈ SNoS_ x0 ⟶ ∀ x2 : ο . (SNoLev x1 ∈ x0 ⟶ ordinal (SNoLev x1) ⟶ SNo x1 ⟶ SNo_ (SNoLev x1) x1 ⟶ x2) ⟶ x2
Known omega_ordinal^{omega_ordinal} : ordinal omega
Theorem SNo_approx_real_lem^{SNo_approx_real_lem} : ∀ x0 . x0 ∈ setexp (SNoS_ omega) omega ⟶ ∀ x1 . x1 ∈ setexp (SNoS_ omega) omega ⟶ (∀ x2 . x2 ∈ omega ⟶ ∀ x3 . x3 ∈ omega ⟶ SNoLt (ap x0 x2) (ap x1 x3)) ⟶ ∀ x2 : ο . (SNoCutP (prim5 omega (ap x0)) (prim5 omega (ap x1)) ⟶ SNo (SNoCut (prim5 omega (ap x0)) (prim5 omega (ap x1))) ⟶ SNoLev (SNoCut (prim5 omega (ap x0)) (prim5 omega (ap x1))) ∈ ordsucc omega ⟶ SNoCut (prim5 omega (ap x0)) (prim5 omega (ap x1)) ∈ SNoS_ (ordsucc omega) ⟶ (∀ x3 . x3 ∈ omega ⟶ SNoLt (ap x0 x3) (SNoCut (prim5 omega (ap x0)) (prim5 omega (ap x1)))) ⟶ (∀ x3 . x3 ∈ omega ⟶ SNoLt (SNoCut (prim5 omega (ap x0)) (prim5 omega (ap x1))) (ap x1 x3)) ⟶ x2) ⟶ x2 (proof)
Param add_SNo^add_SNo : ι → ι → ι
Param eps_^eps_ : ι → ι
Param real^real : ι
Known SNoLt_tra^SNoLt_tra : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt x0 x1 ⟶ SNoLt x1 x2 ⟶ SNoLt x0 x2
Definition or^or := λ x0 x1 : ο . ∀ x2 : ο . (x0 ⟶ x2) ⟶ (x1 ⟶ x2) ⟶ x2
Known ordsuccE^ordsuccE : ∀ x0 x1 . x1 ∈ ordsucc x0 ⟶ or (x1 ∈ x0) (x1 = x0)
Known SNoS_omega_real^{SNoS_omega_real} : SNoS_ omega ⊆ real
Param minus_SNo^minus_SNo : ι → ι
Param abs_SNo^abs_SNo : ι → ι
Known real_I^real_I : ∀ x0 . x0 ∈ SNoS_ (ordsucc omega) ⟶ (x0 = omega ⟶ ∀ x1 : ο . x1) ⟶ (x0 = minus_SNo omega ⟶ ∀ x1 : ο . x1) ⟶ (∀ x1 . x1 ∈ SNoS_ omega ⟶ (∀ x2 . x2 ∈ omega ⟶ SNoLt (abs_SNo (add_SNo x1 (minus_SNo x0))) (eps_ x2)) ⟶ x1 = x0) ⟶ x0 ∈ real
Definition False^False := ∀ x0 : ο . x0
Known real_E^real_E : ∀ x0 . x0 ∈ real ⟶ ∀ x1 : ο . (SNo x0 ⟶ SNoLev x0 ∈ ordsucc omega ⟶ x0 ∈ SNoS_ (ordsucc omega) ⟶ SNoLt (minus_SNo omega) x0 ⟶ SNoLt x0 omega ⟶ (∀ x2 . x2 ∈ SNoS_ omega ⟶ (∀ x3 . x3 ∈ omega ⟶ SNoLt (abs_SNo (add_SNo x2 (minus_SNo x0))) (eps_ x3)) ⟶ x2 = x0) ⟶ (∀ x2 . x2 ∈ omega ⟶ ∀ x3 : ο . (∀ x4 . and (x4 ∈ SNoS_ omega) (and (SNoLt x4 x0) (SNoLt x0 (add_SNo x4 (eps_ x2)))) ⟶ x3) ⟶ x3) ⟶ x1) ⟶ x1
Param nat_p^nat_p : ι → ο
Known nat_p_omega^nat_p_omega : ∀ x0 . nat_p x0 ⟶ x0 ∈ omega
Known nat_0^nat_0 : nat_p 0
Definition not^not := λ x0 : ο . x0 ⟶ False
Known SNoLt_irref^SNoLt_irref : ∀ x0 . not (SNoLt x0 x0)
Param SNoLe^SNoLe : ι → ι → ο
Known SNoLtLe_or^SNoLtLe_or : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ or (SNoLt x0 x1) (SNoLe x1 x0)
Known omega_ordsucc^{omega_ordsucc} : ∀ x0 . x0 ∈ omega ⟶ ordsucc x0 ∈ omega
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 pos_abs_SNo^pos_abs_SNo : ∀ x0 . SNoLt 0 x0 ⟶ abs_SNo x0 = x0
Known SNoLt_minus_pos^{SNoLt_minus_pos} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLt x0 x1 ⟶ SNoLt 0 (add_SNo x1 (minus_SNo x0))
Known SNo_add_SNo^SNo_add_SNo : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNo (add_SNo x0 x1)
Known SNo_eps_^SNo_eps_ : ∀ x0 . x0 ∈ omega ⟶ SNo (eps_ x0)
Known add_SNo_Lt1^add_SNo_Lt1 : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt x0 x2 ⟶ SNoLt (add_SNo x0 x1) (add_SNo x2 x1)
Known SNoLeLt_tra^SNoLeLt_tra : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLe x0 x1 ⟶ SNoLt x1 x2 ⟶ SNoLt x0 x2
Known ordsuccI2^ordsuccI2 : ∀ x0 . x0 ∈ ordsucc x0
Known SNo_minus_SNo^{SNo_minus_SNo} : ∀ x0 . SNo x0 ⟶ SNo (minus_SNo 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_contra^{minus_SNo_Lt_contra} : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ SNoLt x0 x1 ⟶ SNoLt (minus_SNo x1) (minus_SNo x0)
Known SNoLtLe_tra^SNoLtLe_tra : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt x0 x1 ⟶ SNoLe x1 x2 ⟶ SNoLt x0 x2
Known FalseE^FalseE : False ⟶ ∀ x0 : ο . x0
Definition nIn^nIn := λ x0 x1 . not (x0 ∈ x1)
Known In_irref^In_irref : ∀ x0 . nIn x0 x0
Theorem SNo_approx_real^{SNo_approx_real} : ∀ x0 . SNo x0 ⟶ ∀ x1 . x1 ∈ setexp (SNoS_ omega) omega ⟶ ∀ x2 . x2 ∈ setexp (SNoS_ omega) omega ⟶ (∀ x3 . x3 ∈ omega ⟶ SNoLt (ap x1 x3) x0) ⟶ (∀ x3 . x3 ∈ omega ⟶ SNoLt x0 (add_SNo (ap x1 x3) (eps_ x3))) ⟶ (∀ x3 . x3 ∈ omega ⟶ ∀ x4 . x4 ∈ x3 ⟶ SNoLt (ap x1 x4) (ap x1 x3)) ⟶ (∀ x3 . x3 ∈ omega ⟶ SNoLt x0 (ap x2 x3)) ⟶ (∀ x3 . x3 ∈ omega ⟶ ∀ x4 . x4 ∈ x3 ⟶ SNoLt (ap x2 x3) (ap x2 x4)) ⟶ x0 = SNoCut (prim5 omega (ap x1)) (prim5 omega (ap x2)) ⟶ x0 ∈ real (proof)
Known SNo_prereal_incr_lower_approx^{SNo_prereal_incr_lower_approx} : ∀ x0 . SNo x0 ⟶ (∀ x1 . x1 ∈ SNoS_ omega ⟶ (∀ x2 . x2 ∈ omega ⟶ SNoLt (abs_SNo (add_SNo x1 (minus_SNo x0))) (eps_ x2)) ⟶ x1 = x0) ⟶ (∀ x1 . x1 ∈ omega ⟶ ∀ x2 : ο . (∀ x3 . and (x3 ∈ SNoS_ omega) (and (SNoLt x3 x0) (SNoLt x0 (add_SNo x3 (eps_ x1)))) ⟶ x2) ⟶ x2) ⟶ ∀ x1 : ο . (∀ x2 . and (x2 ∈ setexp (SNoS_ omega) omega) (∀ x3 . x3 ∈ omega ⟶ and (and (SNoLt (ap x2 x3) x0) (SNoLt x0 (add_SNo (ap x2 x3) (eps_ x3)))) (∀ x4 . x4 ∈ x3 ⟶ SNoLt (ap x2 x4) (ap x2 x3))) ⟶ x1) ⟶ x1
Known SNo_prereal_decr_upper_approx^{SNo_prereal_decr_upper_approx} : ∀ x0 . SNo x0 ⟶ (∀ x1 . x1 ∈ SNoS_ omega ⟶ (∀ x2 . x2 ∈ omega ⟶ SNoLt (abs_SNo (add_SNo x1 (minus_SNo x0))) (eps_ x2)) ⟶ x1 = x0) ⟶ (∀ x1 . x1 ∈ omega ⟶ ∀ x2 : ο . (∀ x3 . and (x3 ∈ SNoS_ omega) (and (SNoLt x3 x0) (SNoLt x0 (add_SNo x3 (eps_ x1)))) ⟶ x2) ⟶ x2) ⟶ ∀ x1 : ο . (∀ x2 . and (x2 ∈ setexp (SNoS_ omega) omega) (∀ x3 . x3 ∈ omega ⟶ and (and (SNoLt (add_SNo (ap x2 x3) (minus_SNo (eps_ x3))) x0) (SNoLt x0 (ap x2 x3))) (∀ x4 . x4 ∈ x3 ⟶ SNoLt (ap x2 x3) (ap x2 x4))) ⟶ x1) ⟶ x1
Param SNoL^SNoL : ι → ι
Param SNoR^SNoR : ι → ι
Known SNo_eta^SNo_eta : ∀ x0 . SNo x0 ⟶ x0 = SNoCut (SNoL x0) (SNoR x0)
Known SNoCut_ext^SNoCut_ext : ∀ x0 x1 x2 x3 . SNoCutP x0 x1 ⟶ SNoCutP x2 x3 ⟶ (∀ x4 . x4 ∈ x0 ⟶ SNoLt x4 (SNoCut x2 x3)) ⟶ (∀ x4 . x4 ∈ x1 ⟶ SNoLt (SNoCut x2 x3) x4) ⟶ (∀ x4 . x4 ∈ x2 ⟶ SNoLt x4 (SNoCut x0 x1)) ⟶ (∀ x4 . x4 ∈ x3 ⟶ SNoLt (SNoCut x0 x1) x4) ⟶ SNoCut x0 x1 = SNoCut x2 x3
Known SNoCutP_SNoL_SNoR^{SNoCutP_SNoL_SNoR} : ∀ x0 . SNo x0 ⟶ SNoCutP (SNoL x0) (SNoR x0)
Known SNoL_E^SNoL_E : ∀ x0 . SNo x0 ⟶ ∀ x1 . x1 ∈ SNoL x0 ⟶ ∀ x2 : ο . (SNo x1 ⟶ SNoLev x1 ∈ SNoLev x0 ⟶ SNoLt x1 x0 ⟶ x2) ⟶ x2
Known dneg^dneg : ∀ x0 : ο . not (not x0) ⟶ x0
Known SNoLev_In_real_SNoS_omega^{SNoLev_In_real_SNoS_omega} : ∀ x0 . x0 ∈ real ⟶ ∀ x1 . SNo x1 ⟶ SNoLev x1 ∈ SNoLev x0 ⟶ x1 ∈ SNoS_ omega
Known andI^andI : ∀ x0 x1 : ο . x0 ⟶ x1 ⟶ and x0 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 add_SNo_com^add_SNo_com : ∀ x0 x1 . SNo x0 ⟶ SNo x1 ⟶ add_SNo x0 x1 = add_SNo x1 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_Lt1_cancel^{add_SNo_Lt1_cancel} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt (add_SNo x0 x1) (add_SNo x2 x1) ⟶ SNoLt x0 x2
Known SNoR_E^SNoR_E : ∀ x0 . SNo x0 ⟶ ∀ x1 . x1 ∈ SNoR x0 ⟶ ∀ x2 : ο . (SNo x1 ⟶ SNoLev x1 ∈ SNoLev x0 ⟶ SNoLt x0 x1 ⟶ x2) ⟶ x2
Known add_SNo_minus_Lt1^{add_SNo_minus_Lt1} : ∀ x0 x1 x2 . SNo x0 ⟶ SNo x1 ⟶ SNo x2 ⟶ SNoLt (add_SNo x0 (minus_SNo x1)) x2 ⟶ SNoLt x0 (add_SNo x2 x1)
Theorem SNo_approx_real_rep^{SNo_approx_real_rep} : ∀ x0 . x0 ∈ real ⟶ ∀ x1 : ο . (∀ x2 . x2 ∈ setexp (SNoS_ omega) omega ⟶ ∀ x3 . x3 ∈ setexp (SNoS_ omega) omega ⟶ (∀ x4 . x4 ∈ omega ⟶ SNoLt (ap x2 x4) x0) ⟶ (∀ x4 . x4 ∈ omega ⟶ SNoLt x0 (add_SNo (ap x2 x4) (eps_ x4))) ⟶ (∀ x4 . x4 ∈ omega ⟶ ∀ x5 . x5 ∈ x4 ⟶ SNoLt (ap x2 x5) (ap x2 x4)) ⟶ (∀ x4 . x4 ∈ omega ⟶ SNoLt (add_SNo (ap x3 x4) (minus_SNo (eps_ x4))) x0) ⟶ (∀ x4 . x4 ∈ omega ⟶ SNoLt x0 (ap x3 x4)) ⟶ (∀ x4 . x4 ∈ omega ⟶ ∀ x5 . x5 ∈ x4 ⟶ SNoLt (ap x3 x4) (ap x3 x5)) ⟶ SNoCutP (prim5 omega (ap x2)) (prim5 omega (ap x3)) ⟶ x0 = SNoCut (prim5 omega (ap x2)) (prim5 omega (ap x3)) ⟶ x1) ⟶ x1 (proof)