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