proposition: Lemma mperm1 m : m#(1 : 'S_n)%g = m.
proof: Proof. by apply/mnmP=> i; rewrite mnmE perm1. 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