proposition: Lemma lt_subterm1 : forall a a' n' b' c', a t2< a' -> a t2< gcons a' b' n' c'.
proof: Proof. intros; apply lt_trans with (gcons a b' n' c');auto with 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)