proposition: Lemma rpo_6_4 : forall ta1 tb1 n2 tc2, (0 < n2)%nat -> rpo (Term ord_psi (ta1:: tb1 ::nil)) (Term ord_cons ((Term ord_psi (ta1:: tb1 ::nil)):: (nat_2_term n2) ::tc2::nil)).
proof: Proof. intros. eapply Subterm. 2:eleft. left;auto with T2. Qed.
imports: EPSILON0 Arith List Omega Compare_dec Relations Wellfounded Max Tools More_nat AccP not_decreasing EPSILON0 More_nat Gamma0_prelude Gamma0_length term rpo