proposition: Lemma not_zero_lt (alpha: T1): nf alpha -> alpha <> zero -> zero t1< alpha.
proof: Proof. split. - constructor. - split;auto. now apply not_zero_gt_0. 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)