proposition: Lemma of_nat_succ (n:nat) : of_succ_nat n = of_nat (S n).
proof: Proof. induction n as [|n IHn]. - trivial. - simpl. f_equal. now rewrite IHn. Qed.
imports: BinNums Eqdep_dec EqdepFacts RelationClasses Morphisms Setoid Equalities Orders OrdersFacts GenericMinMax PeanoNat BinPosDef