proposition: Lemma succ_nf2 : forall c a n b, nf2 c (cons a n b) -> nf2 (succ c) (cons a n b).
proof: Proof. induction c. simpl. repeat constructor. simpl. case c1. repeat constructor. intros t n0 t0 a n1 b H. inversion_clear H. constructor; auto. Qed.
imports: Arith Omega Compare_dec Relations Wellfounded Tools More_nat Wf_nat AccP not_decreasing ArithRing term rpo List