proposition: Lemma lt_epsilon0_trans : forall a, lt_epsilon0 a -> nf a -> forall b, lt b a -> nf b -> lt_epsilon0 b.
proof: Proof. intros. apply lt_epsilon0_okR. auto with T2. apply transitivity with a. auto with T2. apply lt_epsilon0_ok;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