proposition: Lemma LT_succ : forall alpha, nf alpha -> alpha t1< succ alpha.
proof: Proof. repeat split; auto. - apply lt_succ. - now apply succ_nf. 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)