proposition: Lemma succ_nf : forall alpha, nf alpha -> nf (succ alpha).
proof: Proof. intros alpha Halpha. rewrite <- succ_as_plus;auto with T2. apply plus_nf;auto with T2. compute; constructor;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