Beginning of Section TaggedSets
Let tag : set → set ≝ λalpha ⇒ SetAdjoin alpha {1}
Notation. We use
' as a postfix operator with priority 100 corresponding to applying term
tag.
Axiom. (
tagged_eqE_Subq) We take the following as an axiom:
∀alpha beta, ordinal alpha → alpha ' = beta ' → alpha ⊆ beta
Axiom. (
tagged_eqE_eq) We take the following as an axiom:
∀alpha beta, ordinal alpha → ordinal beta → alpha ' = beta ' → alpha = beta
Axiom. (
tagged_ReplE) We take the following as an axiom:
∀alpha beta, ordinal alpha → ordinal beta → beta ' ∈ {gamma '|gamma ∈ alpha} → beta ∈ alpha
Definition. We define
SNoElts_ to be
λalpha ⇒ alpha ∪ {beta '|beta ∈ alpha} of type
set → set.
Axiom. (
SNoElts_mon) We take the following as an axiom:
Definition. We define
SNo_ to be
λalpha x ⇒ x ⊆ SNoElts_ alpha ∧ ∀beta ∈ alpha, exactly1of2 (beta ' ∈ x) (beta ∈ x) of type
set → set → prop.
Definition. We define
PSNo to be
λalpha p ⇒ {beta ∈ alpha|p beta} ∪ {beta '|beta ∈ alpha, ¬ p beta} of type
set → (set → prop) → set.
Axiom. (
PNoEq_PSNo) We take the following as an axiom:
∀alpha, ordinal alpha → ∀p : set → prop, PNoEq_ alpha (λbeta ⇒ beta ∈ PSNo alpha p) p
Axiom. (
SNo_PSNo) We take the following as an axiom:
∀alpha, ordinal alpha → ∀p : set → prop, SNo_ alpha (PSNo alpha p)
Axiom. (
SNo_PSNo_eta_) We take the following as an axiom:
∀alpha x, ordinal alpha → SNo_ alpha x → x = PSNo alpha (λbeta ⇒ beta ∈ x)
Primitive. The name
SNo is a term of type
set → prop.
Axiom. (
SNo_SNo) We take the following as an axiom:
∀alpha, ordinal alpha → ∀z, SNo_ alpha z → SNo z
Primitive. The name
SNoLev is a term of type
set → set.
Axiom. (
SNoLev_uniq_Subq) We take the following as an axiom:
∀x alpha beta, ordinal alpha → ordinal beta → SNo_ alpha x → SNo_ beta x → alpha ⊆ beta
Axiom. (
SNoLev_uniq) We take the following as an axiom:
∀x alpha beta, ordinal alpha → ordinal beta → SNo_ alpha x → SNo_ beta x → alpha = beta
Axiom. (
SNoLev_prop) We take the following as an axiom:
Axiom. (
SNoLev_) We take the following as an axiom:
Axiom. (
SNoLev_PSNo) We take the following as an axiom:
∀alpha, ordinal alpha → ∀p : set → prop, SNoLev (PSNo alpha p) = alpha
Axiom. (
SNo_Subq) We take the following as an axiom:
Definition. We define
SNoEq_ to be
λalpha x y ⇒ PNoEq_ alpha (λbeta ⇒ beta ∈ x) (λbeta ⇒ beta ∈ y) of type
set → set → set → prop.
Axiom. (
SNoEq_I) We take the following as an axiom:
∀alpha x y, (∀beta ∈ alpha, beta ∈ x ↔ beta ∈ y) → SNoEq_ alpha x y
Axiom. (
SNo_eq) We take the following as an axiom:
End of Section TaggedSets
Beginning of Section TaggedSets2
Let tag : set → set ≝ λalpha ⇒ SetAdjoin alpha {1}
Notation. We use
' as a postfix operator with priority 100 corresponding to applying term
tag.
Axiom. (
SNoS_I) We take the following as an axiom:
∀alpha, ordinal alpha → ∀x, ∀beta ∈ alpha, SNo_ beta x → x ∈ SNoS_ alpha
Axiom. (
SNoS_I2) We take the following as an axiom:
Axiom. (
SNoS_Subq) We take the following as an axiom:
∀alpha beta, ordinal alpha → ordinal beta → alpha ⊆ beta → SNoS_ alpha ⊆ SNoS_ beta
Axiom. (
SNoLev_uniq2) We take the following as an axiom:
∀alpha, ordinal alpha → ∀x, SNo_ alpha x → SNoLev x = alpha
Axiom. (
SNoS_E2) We take the following as an axiom:
Axiom. (
SNoS_In_neq) We take the following as an axiom:
Axiom. (
SNoS_SNoLev) We take the following as an axiom:
Definition. We define
SNoL to be
λz ⇒ {x ∈ SNoS_ (SNoLev z)|x < z} of type
set → set.
Definition. We define
SNoR to be
λz ⇒ {y ∈ SNoS_ (SNoLev z)|z < y} of type
set → set.
Axiom. (
SNoL_E) We take the following as an axiom:
Axiom. (
SNoR_E) We take the following as an axiom:
Axiom. (
SNoL_SNoS_) We take the following as an axiom:
Axiom. (
SNoR_SNoS_) We take the following as an axiom:
Axiom. (
SNoL_SNoS) We take the following as an axiom:
Axiom. (
SNoR_SNoS) We take the following as an axiom:
Axiom. (
SNoL_I) We take the following as an axiom:
Axiom. (
SNoR_I) We take the following as an axiom:
Axiom. (
SNo_eta) We take the following as an axiom:
Axiom. (
SNoCut_Le) We take the following as an axiom:
Axiom. (
SNoCut_ext) We take the following as an axiom:
Axiom. (
ordinal_SNo_) We take the following as an axiom:
∀alpha, ordinal alpha → SNo_ alpha alpha
Axiom. (
ordinal_SNo) We take the following as an axiom:
∀alpha, ordinal alpha → SNo alpha
Axiom. (
ordinal_SNoLev) We take the following as an axiom:
∀alpha, ordinal alpha → SNoLev alpha = alpha
Axiom. (
ordinal_SNoL) We take the following as an axiom:
∀alpha, ordinal alpha → SNoL alpha = SNoS_ alpha
Axiom. (
ordinal_SNoR) We take the following as an axiom:
∀alpha, ordinal alpha → SNoR alpha = Empty
Axiom. (
nat_p_SNo) We take the following as an axiom:
Axiom. (
omega_SNo) We take the following as an axiom:
Axiom. (
ordinal_In_SNoLt) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta ∈ alpha, beta < alpha
Axiom. (
ordinal_Subq_SNoLe) We take the following as an axiom:
∀alpha beta, ordinal alpha → ordinal beta → alpha ⊆ beta → alpha ≤ beta
Axiom. (
ordinal_SNoLt_In) We take the following as an axiom:
∀alpha beta, ordinal alpha → ordinal beta → alpha < beta → alpha ∈ beta
Axiom. (
SNo_0) We take the following as an axiom:
Axiom. (
SNo_1) We take the following as an axiom:
Axiom. (
SNo_2) We take the following as an axiom:
Axiom. (
SNoLev_0) We take the following as an axiom:
Axiom. (
SNoCut_0_0) We take the following as an axiom:
Axiom. (
SNoL_0) We take the following as an axiom:
Axiom. (
SNoR_0) We take the following as an axiom:
Axiom. (
SNoL_1) We take the following as an axiom:
Axiom. (
SNoR_1) We take the following as an axiom:
Axiom. (
SNo_0_eq_0) We take the following as an axiom:
Definition. We define
eps_ to be
λn ⇒ {0} ∪ {(ordsucc m) '|m ∈ n} of type
set → set.
Axiom. (
eps_0_1) We take the following as an axiom:
Axiom. (
SNo__eps_) We take the following as an axiom:
Axiom. (
SNo_eps_) We take the following as an axiom:
Axiom. (
SNo_eps_1) We take the following as an axiom:
Axiom. (
SNoLev_eps_) We take the following as an axiom:
Axiom. (
SNo_eps_pos) We take the following as an axiom:
Axiom. (
eps_SNo_eq) We take the following as an axiom:
Axiom. (
eps_SNoCutP) We take the following as an axiom:
Axiom. (
eps_SNoCut) We take the following as an axiom:
End of Section TaggedSets2