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. Qed.
imports: Coq(Arith List Lia Compare_dec Relations Wellfounded RelationClasses) hydras(Epsilon0) hydras(More_Arith Restriction) hydras(ON_Generic) hydras(rpo.term rpo.rpo) hydras(T2) hydras(Compat815)