proposition: Lemma mnmwiden0 : mnmwiden 0 = 0%MM.
proof: Proof. apply/mnmP=> i; rewrite mnmE (mnm_nth 0%N) nth_rcons. case: ssrnat.ltnP; last by rewrite ?if_same. rewrite size_tuple=> lt_in; pose oi := Ordinal lt_in. by rewrite (nth_map oi) //; rewrite size_tuple. 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