proposition: Lemma CNFq_p6 e c n: natp n -> CNFq_ax e c (csucc n) -> forall i, i <c n -> e i <o e n.
proof: Proof. move => nN ax i lin. exact:(CNF_exponents_sM (NS_succ nN) ax lin (cltS nN)). Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)