proposition: Lemma succ_not_limit : forall alpha:T1, T1is_succ alpha -> T1limit alpha = false.
proof: Proof. induction alpha. intro; discriminate. simpl. destruct alpha1. auto. intro. rewrite IHalpha2;auto. destruct alpha2;auto. 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)