proposition: Lemma eq_succ_LT : forall alpha beta, nf beta -> alpha = succ beta -> beta t1< alpha.
proof: Proof. intros; subst; apply LT_succ; 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)