proposition: Lemma mleadB_le p q : (mlead (p - q) <= mlead p `|` mlead q)%O.
proof: Proof. by rewrite -(mleadN q); apply/mleadD_le. 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