proposition: Lemma lt_tail: forall a b n c, nf (gcons a b n c) -> c t2< gcons a b n c.
proof: Proof. intros a b n c H; change c with (gtail (gcons a b n c)). apply lt_tail0. + cbn;auto with T2. + discriminate. 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)