TheoremBase

Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting

Basic facts about intervals of natural numbers: [n] consists of the natural numbers up to n, [0] is empty and [1]={1}, [n+1] adds the new element n+1 to [n], an interval splits into two consecutive disjoint intervals, adding p shifts an interval bijectively, and [m] ⊆ [n] exactly when m ≤ n.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let m,n,p∈N0m,n,p\in\mathbb{N}_{0}, and let intervals and [n][n] be as in Intervals of Natural Numbers §interval and Intervals of Natural Numbers §segment.

[n]={k∈N:k≤n}[n]=\{k\in\mathbb{N}:k\le n\}, [0]=∅[0]=\emptyset and [1]={1}[1]=\{1\}.

[n+1]=[n]∪{n+1}[n+1]=[n]\cup\{n+1\} and n+1∉[n]n+1\notin[n].

If m≤n+1m\le n+1, then {m,…,n+p}={m,…,n}∪{n+1,…,n+p}\{m,\dots,n+p\}=\{m,\dots,n\}\cup\{n+1,\dots,n+p\}, and these two intervals are disjoint.

The map k↦k+pk\mapsto k+p is a bijection from {m,…,n}\{m,\dots,n\} onto {m+p,…,n+p}\{m+p,\dots,n+p\}.

[m]⊆[n][m]\subseteq[n] if and only if m≤nm\le 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…