proposition: Lemma is_limit_not_succ alpha: is_limit alpha -> ~ is_successor alpha.
proof: Proof. induction 1. - red;inversion 1. + subst alpha beta; case H;intro;lt_clean. + inversion H8. - red;inversion 1. + subst gamma; case zero_not_lim;auto. + case IHis_limit; auto. Qed.
imports: Coq(Arith List Lia Compare_dec Relations Wellfounded RelationClasses) hydras(Epsilon0) hydras(More_Arith Restriction) hydras(ON_Generic) hydras(rpo.term rpo.rpo) hydras(T2) hydras(Compat815)