proposition: Lemma mnmwiden_widen m (i : 'I_n) : (mnmwiden m) (widen i) = m i.
proof: Proof. case: m=> m; rewrite !(mnm_nth 0%N) nth_rcons. by rewrite size_tuple /=; case: i => i /= ->. 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