proposition: Lemma lt_succ : forall a, a < succ a.
proof: Proof. induction a;simpl;auto with T2. case a1;auto with arith T2. case a2; auto with arith 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