proposition: Lemma mker x : x \in 'ker f -> f x = 1.
proof: Proof. by move=> Kx; apply/kerP=> //; apply: dom_ker. Qed.
imports: mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype finfun bigop finset fingroup)