proposition: Lemma tail_lt : forall alpha n beta beta', lt beta beta' -> lt (cons alpha n beta) (cons alpha n beta').
proof: Proof. unfold lt. intros * H. rewrite compare_cons. now rewrite compare_refl, Nat.compare_refl. 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)