proposition: Lemma mleadc_mesym k (le_kn : k <= n) : mleadc 's_k = 1.
proof: Proof. rewrite mcoeff_mesym; case: (boolP (mechar _ _))=> //=. by rewrite -mem_msupp_mesym mlead_supp // mesym_neq0. 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