proposition: Lemma Lt_Succ : forall alpha, E0lt alpha (E0_succ alpha).
proof: Proof. destruct alpha; unfold lt, E0_succ; cbn; apply LT_succ;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)