proposition: Lemma Lt_Le_incl alpha beta : alpha o< beta -> alpha o<= beta.
proof: Proof. unfold E0lt, E0le. intro; rewrite le_lt_eq. destruct alpha, beta. left. auto. Qed.
imports: Coq(Arith Max Bool Lia Compare_dec Relations Ensembles ArithRing Wellfounded Operators_Properties Logic.Eqdep_dec) hydras(Prelude.More_Arith Prelude.Restriction Prelude.DecPreOrder ON_Generic OrdNotations)