proposition: Lemma conjCg A x : (~: A) :^ x = ~: A :^ x.
proof: Proof. by rewrite !conjg_preim preimsetC. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)