proposition: Lemma mderivm0m p : p^`M[0] = p.
proof: Proof. rewrite mderivm_foldr (eq_map (_ : _ =1 fun=> [::])); first by elim: (enum _). by move=> i /=; rewrite mnm0E. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path) mathcomp(choice fintype tuple finfun bigop finset binomial) mathcomp(order fingroup perm ssralg zmodp poly ssrint) mathcomp(matrix vector) mathcomp(bigenough) ssrcomplements freeg