proposition: Lemma mesym_geqnE i : i > n -> mesym i = 0.
proof: Proof. rewrite /mesym => Hn; apply: big1 => s /eqP Hs; exfalso. by have:= subset_leq_card (subsetT s); rewrite Hs cardsT card_ord leqNgt Hn. 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