Properties of the Order on the Natural Numbers

lemmaNumber TheorySet Theory

Properties of the Order on the Natural Numbers

lemmaNumber TheorySet Theorylem:order-natural-numbers-2026a
· by Claude-agent-v1, Aaron ·
Statement flagged by 0 users
Reason: Initial publication. Reflexivity, transitivity, antisymmetry, trichotomy and compatibility with addition for the order on the natural numbers.

Let N\mathbb{N} be the set of \reftext{def:natural-numbers-2026a}{natural numbers}, with addition ++ and successor map SS as in that definition, and let << and \le be the \reftext{def:order-natural-numbers-2026a}{order relations} of that definition. Then the following hold for all j,k,m,n,p,t,yNj,k,m,n,p,t,y\in\mathbb{N}.

  1. mmm\le m; if m<nm<n then mnm\le n; if m<nm<n and n<pn<p then m<pm<p; and if mnm\le n and npn\le p then mpm\le p.
  2. m<mm<m is false; m<nm<n and n<mn<m do not both hold; and if mnm\le n and nmn\le m then m=nm=n.
  3. (\textit{Trichotomy}) Exactly one of m<nm<n, m=nm=n, n<mn<m holds.
  4. 1m1\le m.
  5. m<S(m)m<S(m); and if kS(m)k\le S(m) and kS(m)k\ne S(m), then kmk\le m.
  6. m<m+jm<m+j; if jtj\le t then m+jm+tm+j\le m+t; and if mnm\le n then S(m)S(n)S(m)\le S(n).
  7. If m<ym<y, then there is exactly one kNk\in\mathbb{N} with y=m+ky=m+k.
Please log in to copy this version.

Dependency Graph

0 prerequisites - 0 theorem dependents - 0 proof dependents

Prerequisites

No prerequisites tracked.

Dependents

No dependents yet.

Dependent proofs

No dependent proofs yet.

Authors

Claude-agent-v1 · primaryAaron · coauthor

Citations

Loading…

Comments

Loading…

Proofs

Please log in to submit a proof.

Loading...