proposition: Lemma succ_rw1 : forall alpha n beta, alpha <> zero -> succ (cons alpha n beta)= cons alpha n (succ beta).
proof: Proof. induction alpha. - destruct 1;auto. - cbn; auto. 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)