proposition: Lemma mleadM_proper p q : mleadc p * mleadc q != 0 -> mlead (p * q) = (mlead p + mlead q)%MM.
proof: Proof. move: (mleadM_le p q); rewrite le_eqVlt => /predU1P[->//|]. rewrite -mleadcM 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