proposition: Lemma succ_cons' alpha i beta : alpha <> zero -> nf (cons alpha i beta) -> succ (cons alpha i beta) = cons alpha i (succ beta).
proof: Proof. simpl. destruct alpha. - now destruct 1. - reflexivity. Qed.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles Wellfounded Bool RelationClasses Operators_Properties ArithRing Logic.Eqdep_dec) hydras(More_Arith Restriction DecPreOrder) hydras(OrdNotations)