proposition: Lemma nderivn1 p : p^`N(1) = p^`().
proof: Proof. by rewrite -[p^`N(1)](nderivn_def 1). Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype bigop finset tuple) mathcomp(div ssralg countalg binomial)