proposition: Lemma mleadcX_proper p k : GRing.lreg (mleadc p) -> mleadc (p ^+ k) = mleadc p ^+ k.
proof: Proof. move=> h; rewrite -[k](card_ord k) -!prodr_const. by apply/mleadc_prod_proper=> /= i _ _. 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