proposition: Lemma mleadN p : mlead (-p) = mlead p.
proof: Proof. have [->|nz_p] := eqVneq p 0; first by rewrite oppr0. by rewrite /mlead (perm_big _ (msuppN p)). 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