TheoremBase

The Order on Omega

Defines the order on omega by m ≤ n when m is an element of n or equal to it, and the strict order by m < n when m is an element of n.

Statement

In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation, let ω\omega be as in The Class Omega of Natural Numbers with Zero §omega. The two classes below are formed by class abstraction with the parameter ω\omega; their formulas quantify over set variables only, the ordered pair being a defined set symbol, so they are predicative as Class Theory NBG: the Axioms, Standing Conventions and Basic Notation §comprehension requires.

The order on ω\omega is the class

≤={p:∃m ∃n (p=(m,n)∧m∈ω∧n∈ω∧(m∈n∨m=n))},{\le}=\{p:\exists m\,\exists n\,(p=(m,n)\wedge m\in\omega\wedge n\in\omega\wedge(m\in n\vee m=n))\},

and for sets mm and nn, m≤nm\le n means (m,n)∈≤(m,n)\in{\le}.

The strict order on ω\omega is the class

<={p:∃m ∃n (p=(m,n)∧m∈ω∧n∈ω∧m∈n)},{<}=\{p:\exists m\,\exists n\,(p=(m,n)\wedge m\in\omega\wedge n\in\omega\wedge m\in n)\},

and for sets mm and nn, m<nm<n means (m,n)∈<(m,n)\in{<}.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…