proposition: Lemma lt_succ (alpha : T1) : lt alpha (succ alpha).
proof: Proof. induction alpha; cbn; auto with T1. - destruct alpha1; cbn; auto with T1. 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)