proposition: Lemma succ_of_cons : forall a b n c, zero t2< a \/ zero t2< b -> succ (gcons a b n c)= gcons a b n (succ c).
proof: Proof. destruct a;destruct b;simpl;auto with T2. destruct 1 as [H|H];inversion H. 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)