proposition: Lemma lt_epsilon0_succ : forall a, lt_epsilon0 a -> lt_epsilon0 (succ a).
proof: Proof. induction a. simpl. repeat constructor. simpl. case a1. case a2. repeat constructor. constructor. inversion H;auto with T2. apply IHa3. inversion H;auto with T2. inversion 1. 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