proposition: Lemma mleadZ_le c p : (mlead (c *: p) <= mlead p)%O.
proof: Proof. have [->|] := eqVneq (c *: p) 0; first by rewrite mlead0 le0x. by move/mlead_supp/msuppZ_le/msupp_le_mlead. 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