proposition: Lemma LT1 : forall alpha n beta, nf (cons alpha n beta) -> zero t1< cons alpha n beta.
proof: Proof. repeat split;auto; constructor. 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)