proposition: Lemma LE_r : forall alpha beta, alpha t1< beta -> alpha t1<= beta.
proof: Proof. intros alpha beta [H1 [H2 H3]]; repeat split; eauto with T1. now left. 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)