proposition: Lemma nat_induction (P : nat -> Type) : P 0 -> (forall n, P n -> P (1 + n)) -> forall n, P n.
proof: Proof. apply nat_rect. Qed.
imports: HoTT.Classes.interfaces.abstract_algebra HoTT.Classes.interfaces.naturals HoTT.Classes.interfaces.orders HoTT.Classes.theory.rings HoTT.Classes.orders.semirings HoTT.Classes.theory.apartness