proposition: Lemma nf_cons_LT : forall (a : T1) (n : nat) (a' : T1) (n' : nat) (b : T1), a' t1< a -> nf a -> nf (cons a' n' b) -> nf (cons a n (cons a' n' b)).
proof: Proof. intros; apply cons_nf; auto; destruct H;tauto. 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)