proposition: Lemma mleadcM_proper p q : mleadc p * mleadc q != 0 -> mleadc (p * q) = mleadc p * mleadc q.
proof: Proof. by move/mleadM_proper=> ->; rewrite mleadcM. 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