TheoremBase

The Order on Omega Is a Well-Order with Membership as Its Strict Order, and Nothing Lies between n and Its Successor

The order on omega is a well-order whose strict order is membership; zero is its least element; m < S(n) exactly when m ≤ n, so nothing lies strictly between n and its successor; m < n exactly when S(m) ≤ n; and each n is the set of elements of omega below it.

Statement

In the setting of Class Theory NBG: the Axioms, Standing Conventions and Basic Notation, let ω\omega and 00 be as in The Class Omega of Natural Numbers with Zero §omega and The Class Omega of Natural Numbers with Zero §zero, let S(x)S(x) denote the successor of a set xx, and let ≤\le and << be the order and the strict order on ω\omega.

≤\le is a well-order on ω\omega.

The class << equals the strict relation associated with ≤\le; in particular, for all sets mm and nn, m<nm<n if and only if m≤nm\le n and m≠nm\neq n.

0≤n0\le n for every n∈ωn\in\omega.

For all m,n∈ωm,n\in\omega, m<S(n)m<S(n) if and only if m≤nm\le n; in particular n<S(n)n<S(n).

For every n∈ωn\in\omega there is no m∈ωm\in\omega with n<mn<m and m<S(n)m<S(n).

For all m,n∈ωm,n\in\omega, m<nm<n if and only if S(m)≤nS(m)\le n.

For every n∈ωn\in\omega, n={m∈ω:m<n}n=\{m\in\omega:m<n\}.

Proofs

Log in to submit a proof.

Loading...

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…