Lemma 10.2.14. The successor function induces an equivalence \[ s\colon\N\iso\N_{\geq 1}, \qquad n\longmapsto n+1. \]

Proof

By Lemma 10.2.12, every successor is nonzero. Hence \(\succ\) lifts through \(j\) to a function \[ s\colon\N\longrightarrow\N_{\geq 1}. \]

Dependent induction produces, for every \(n : \N\), a function \[ (n\neq 0)\longrightarrow \sum_{m : \N}(\succ(m)=n). \] For \(n=0\), a term of the source contradicts \(\id_0 : 0=0\). For \(n=\succ(m)\), send every term of the source to the pair \((m,\id_{\succ(m)})\). Passing to total animae and projecting to the first component defines a function \[ p\colon\N_{\geq 1}\longrightarrow\N \] together with identifications \[ \succ(p(x))=j(x) \qquad (x : \N_{\geq 1}). \] The successor clause of the construction gives \(ps=\id_{\N}\). The displayed identifications give \(jsp=j\), and since \(j\) is an embedding, they lift uniquely to an identification \(sp=\id_{\N_{\geq 1}}\). Thus \(p\) is inverse to \(s\).

From Section 10.2, The natural numbers.