proposition: Lemma le0m m : (0%MM <= m)%O.
proof: Proof. rewrite leEmnm; have [/eqP|] := eqVneq (mdeg m) 0%N. by rewrite mdeg_eq0 => /eqP->; rewrite lexx. by rewrite -lt0n mdeg0 lexi_cons leEnat; case: ltngtP. 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