proposition: Lemma conjTg x : [set: gT] :^ x = [set: gT].
proof: Proof. by rewrite conjg_preim preimsetT. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)