Lemma 10.2.12. For all \(n : \N\) we have \(0 \neq \succ{n}\).

Proof

By recursion, we can construct a function \(f\colon \N \to \An\) with \(f(0):= *\) and \(f(\succ{n}):=\emptyset\). Thus for each \(n : \N\) we get the desired map \(e\colon (0=\succ{n}) \to \emptyset\) defined as \(e(p):=f(p)(*)\), where \(f(p)\colon * \to \emptyset\) is the map induced by the equality \(p:0=\succ{n}\).

From Section 10.2, The natural numbers.