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