proposition: Lemma not_LT_zero : forall alpha, ~ alpha t1< zero.
proof: Proof. intros alpha [H [H0 H1]]; inversion H0. destruct (not_lt_zero 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)