proposition: Lemma lt_succ (alpha: T2): alpha t2< succ alpha.
proof: Proof. induction alpha;simpl;auto with T2. case alpha1;auto with arith T2. case alpha2; auto with arith T2. 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)