proposition: Lemma lt_a_phi_ab : forall a b, nf a -> nf b -> a < phi a b.
proof: Proof. intros. apply lt_le_trans with (phi a zero). apply no_critical. apply phi_mono_weak_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