proposition: Lemma mleadZ_proper c p : c * mleadc p != 0 -> mlead (c *: p) = mlead p.
proof: Proof. move: (mleadZ_le c p); rewrite le_eqVlt => /predU1P[->//|]. rewrite -mleadcZ mcoeff_eq0 negbK => ltm /msupp_le_mlead lem. by move: (lt_le_trans ltm lem); rewrite ltxx. 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