proposition: Lemma phi_mono_weak_r : forall a b c, nf a -> nf b -> nf c -> b <= c -> phi a b <= phi a c.
proof: Proof. destruct 4. subst c;left;auto with T2. right; apply phi_mono_r;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