proposition: Lemma LT_irrefl (alpha : T1) : ~ alpha t1< alpha.
proof: Proof. destruct 1 as [H [H0 H1]]. now apply lt_irrefl in H0. 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)