proposition: Lemma mperm_inj (s : 'S_n) : injective (fun m => m#s).
proof: Proof. move=> m1 m2 /= /mnmP h; apply/mnmP=> i. by move: (h (s^-1 i)%g); rewrite !mnmE permKV. 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