proposition: Lemma mleadcZE a p : mleadc (a *: p) = a * mleadc p.
proof: Proof. have [->|Za] := eqVneq a 0; last by rewrite mleadZ // mcoeffZ. by rewrite scale0r mleadc0 mul0r. 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