proposition: Lemma lt_subterm2 a a' n n' b b': lt a a' -> nf (cons a n b) -> nf (cons a' n' b') -> lt b (cons a' n' b').
proof: Proof. intros H H0 H1; apply le_lt_trans with (cons a n b). - apply lt_incl_le, tail_lt_cons;auto. - auto with T1. Qed.
imports: Coq(Arith Lia Compare_dec Relations Wellfounded Wf_nat List Bool Eqdep_dec Ensembles ArithRing Logic) hydras(More_Arith Restriction DecPreOrder rpo.term rpo.rpo Epsilon0.T1)