proposition: Lemma case : forall x : N, x = 0 |_| exists y : N, (x = 1 + y)%mc.
proof: Proof. refine (from_nat_stmt nat (fun s => forall x : s, x = 0 |_| exists y : s, (x = 1 + y)%mc) _). simpl. intros [|x];eauto. Qed.
imports: HoTT.Basics.Decidable HoTT.Classes.interfaces.orders HoTT.Classes.implementations.peano_naturals HoTT.Classes.theory.rings HoTT.Classes.isomorphisms.rings HoTT.Classes.interfaces.naturals