proposition: Lemma symfnE0 k : symfn k 0 = (0, 0).
proof: Proof. by elim: k => /= [|k ih]; rewrite symf1E0 //= ih addr0. 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