proposition: Lemma commr_mderivX i m p : GRing.comm p ('X_[m])^`M(i).
proof: Proof. rewrite /GRing.comm mderivX -mul_mpolyC mpolyC_nat. by rewrite -{1}commr_nat mulrA commr_nat commr_mpolyX mulrA. 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