proposition: Lemma mlead_supp p : p != 0 -> mlead p \in msupp p.
proof: Proof. rewrite -msupp_eq0 /mlead => nz_p; case: bigjoinP => //; first exact: le_total. by case: (msupp p) nz_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