proposition: Lemma is_limit_intro : forall b1 b2 n , nf b1 -> nf b2 -> zero t2< b1 \/ zero t2< b2 -> is_limit (gcons b1 b2 n zero).
proof: Proof. constructor;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)