proposition: Lemma succ_is_succ : forall alpha, T1is_succ (succ alpha).
proof: Proof. induction alpha. - reflexivity. - simpl. destruct alpha1. + reflexivity. + simpl. trivial. 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)