proposition: Lemma subgK x : x \in G -> val (subg x) = x.
proof: Proof. by move=> Gx; rewrite insubdK. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)