proposition: Lemma mdeg_eq0 m : (mdeg m == 0%N) = (m == 0%MM).
proof: Proof. apply/idP/eqP=> [h|->]; last by rewrite mdeg0. apply/mnmP=> i; move: h; rewrite mdegE mnm0E. by rewrite (bigD1 i) //= addn_eq0 => /andP[/eqP-> _]. 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