proposition: Lemma T1limit_succ : forall alpha, nf alpha -> ~ T1limit (succ alpha) .
proof: Proof. induction alpha. - discriminate. - intros; simpl; destruct alpha1. + discriminate. + simpl; case_eq (succ alpha2). * intros; now destruct (succ_not_zero alpha2). * intros; rewrite <- H0; apply IHalpha2; eauto 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)