proposition: Lemma LE_nf_l : forall alpha beta , alpha t1<= beta -> nf alpha.
proof: Proof. now destruct 1. 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)