Theorem grpokerinj 36352

Description: A group homomorphism is injective if and only if its kernel is zero. (Contributed by Jeff Madsen, 16-Jun-2011.)

Hypotheses

Ref	Expression
grpkerinj.1	⊢ 𝑋 = ran 𝐺
grpkerinj.2	⊢ 𝑊 = (GId‘𝐺)
grpkerinj.3	⊢ 𝑌 = ran 𝐻
grpkerinj.4	⊢ 𝑈 = (GId‘𝐻)

Assertion

Ref	Expression
grpokerinj	⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → (𝐹:𝑋–1-1→𝑌 ↔ (◡𝐹 “ {𝑈}) = {𝑊}))

Proof of Theorem grpokerinj

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpkerinj.2	. . . . . . . . 9 ⊢ 𝑊 = (GId‘𝐺)
2		grpkerinj.4	. . . . . . . . 9 ⊢ 𝑈 = (GId‘𝐻)
3	1, 2	ghomidOLD 36348	. . . . . . . 8 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → (𝐹‘𝑊) = 𝑈)
4	3	sneqd 4598	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → {(𝐹‘𝑊)} = {𝑈})
5		grpkerinj.1	. . . . . . . . . 10 ⊢ 𝑋 = ran 𝐺
6		grpkerinj.3	. . . . . . . . . 10 ⊢ 𝑌 = ran 𝐻
7	5, 6	ghomf 36349	. . . . . . . . 9 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → 𝐹:𝑋⟶𝑌)
8	7	ffnd 6669	. . . . . . . 8 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → 𝐹 Fn 𝑋)
9	5, 1	grpoidcl 29456	. . . . . . . . 9 ⊢ (𝐺 ∈ GrpOp → 𝑊 ∈ 𝑋)
10	9	3ad2ant1 1133	. . . . . . . 8 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → 𝑊 ∈ 𝑋)
11		fnsnfv 6920	. . . . . . . 8 ⊢ ((𝐹 Fn 𝑋 ∧ 𝑊 ∈ 𝑋) → {(𝐹‘𝑊)} = (𝐹 “ {𝑊}))
12	8, 10, 11	syl2anc 584	. . . . . . 7 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → {(𝐹‘𝑊)} = (𝐹 “ {𝑊}))
13	4, 12	eqtr3d 2778	. . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → {𝑈} = (𝐹 “ {𝑊}))
14	13	imaeq2d 6013	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → (◡𝐹 “ {𝑈}) = (◡𝐹 “ (𝐹 “ {𝑊})))
15	14	adantl 482	. . . 4 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ (𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻))) → (◡𝐹 “ {𝑈}) = (◡𝐹 “ (𝐹 “ {𝑊})))
16	9	snssd 4769	. . . . . 6 ⊢ (𝐺 ∈ GrpOp → {𝑊} ⊆ 𝑋)
17	16	3ad2ant1 1133	. . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → {𝑊} ⊆ 𝑋)
18		f1imacnv 6800	. . . . 5 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ {𝑊} ⊆ 𝑋) → (◡𝐹 “ (𝐹 “ {𝑊})) = {𝑊})
19	17, 18	sylan2 593	. . . 4 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ (𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻))) → (◡𝐹 “ (𝐹 “ {𝑊})) = {𝑊})
20	15, 19	eqtrd 2776	. . 3 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ (𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻))) → (◡𝐹 “ {𝑈}) = {𝑊})
21	20	expcom 414	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → (𝐹:𝑋–1-1→𝑌 → (◡𝐹 “ {𝑈}) = {𝑊}))
22	7	adantr 481	. . . 4 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) → 𝐹:𝑋⟶𝑌)
23		simpl2 1192	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐻 ∈ GrpOp)
24	7	ffvelcdmda 7035	. . . . . . . . 9 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ∈ 𝑌)
25	24	adantrr 715	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑥) ∈ 𝑌)
26	7	ffvelcdmda 7035	. . . . . . . . 9 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ 𝑦 ∈ 𝑋) → (𝐹‘𝑦) ∈ 𝑌)
27	26	adantrl 714	. . . . . . . 8 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑦) ∈ 𝑌)
28		eqid 2736	. . . . . . . . 9 ⊢ ( /𝑔 ‘𝐻) = ( /𝑔 ‘𝐻)
29	6, 2, 28	grpoeqdivid 36340	. . . . . . . 8 ⊢ ((𝐻 ∈ GrpOp ∧ (𝐹‘𝑥) ∈ 𝑌 ∧ (𝐹‘𝑦) ∈ 𝑌) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ ((𝐹‘𝑥)( /𝑔 ‘𝐻)(𝐹‘𝑦)) = 𝑈))
30	23, 25, 27, 29	syl3anc 1371	. . . . . . 7 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ ((𝐹‘𝑥)( /𝑔 ‘𝐻)(𝐹‘𝑦)) = 𝑈))
31	30	adantlr 713	. . . . . 6 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ ((𝐹‘𝑥)( /𝑔 ‘𝐻)(𝐹‘𝑦)) = 𝑈))
32		eqid 2736	. . . . . . . . . 10 ⊢ ( /𝑔 ‘𝐺) = ( /𝑔 ‘𝐺)
33	5, 32, 28	ghomdiv 36351	. . . . . . . . 9 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) = ((𝐹‘𝑥)( /𝑔 ‘𝐻)(𝐹‘𝑦)))
34	33	adantlr 713	. . . . . . . 8 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) = ((𝐹‘𝑥)( /𝑔 ‘𝐻)(𝐹‘𝑦)))
35	34	eqeq1d 2738	. . . . . . 7 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) = 𝑈 ↔ ((𝐹‘𝑥)( /𝑔 ‘𝐻)(𝐹‘𝑦)) = 𝑈))
36	2	fvexi 6856	. . . . . . . . . 10 ⊢ 𝑈 ∈ V
37	36	snid 4622	. . . . . . . . 9 ⊢ 𝑈 ∈ {𝑈}
38		eleq1 2825	. . . . . . . . 9 ⊢ ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) = 𝑈 → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) ∈ {𝑈} ↔ 𝑈 ∈ {𝑈}))
39	37, 38	mpbiri 257	. . . . . . . 8 ⊢ ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) = 𝑈 → (𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) ∈ {𝑈})
40	7	ffund 6672	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → Fun 𝐹)
41	40	adantr 481	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → Fun 𝐹)
42	5, 32	grpodivcl 29481	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥( /𝑔 ‘𝐺)𝑦) ∈ 𝑋)
43	42	3expb 1120	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥( /𝑔 ‘𝐺)𝑦) ∈ 𝑋)
44	43	3ad2antl1 1185	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥( /𝑔 ‘𝐺)𝑦) ∈ 𝑋)
45	7	fdmd 6679	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → dom 𝐹 = 𝑋)
46	45	adantr 481	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → dom 𝐹 = 𝑋)
47	44, 46	eleqtrrd 2841	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥( /𝑔 ‘𝐺)𝑦) ∈ dom 𝐹)
48		fvimacnv 7003	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ (𝑥( /𝑔 ‘𝐺)𝑦) ∈ dom 𝐹) → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) ∈ {𝑈} ↔ (𝑥( /𝑔 ‘𝐺)𝑦) ∈ (◡𝐹 “ {𝑈})))
49	41, 47, 48	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) ∈ {𝑈} ↔ (𝑥( /𝑔 ‘𝐺)𝑦) ∈ (◡𝐹 “ {𝑈})))
50		eleq2 2826	. . . . . . . . . . 11 ⊢ ((◡𝐹 “ {𝑈}) = {𝑊} → ((𝑥( /𝑔 ‘𝐺)𝑦) ∈ (◡𝐹 “ {𝑈}) ↔ (𝑥( /𝑔 ‘𝐺)𝑦) ∈ {𝑊}))
51	49, 50	sylan9bb 510	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) ∈ {𝑈} ↔ (𝑥( /𝑔 ‘𝐺)𝑦) ∈ {𝑊}))
52	51	an32s 650	. . . . . . . . 9 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) ∈ {𝑈} ↔ (𝑥( /𝑔 ‘𝐺)𝑦) ∈ {𝑊}))
53		elsni 4603	. . . . . . . . . . 11 ⊢ ((𝑥( /𝑔 ‘𝐺)𝑦) ∈ {𝑊} → (𝑥( /𝑔 ‘𝐺)𝑦) = 𝑊)
54	5, 1, 32	grpoeqdivid 36340	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥 = 𝑦 ↔ (𝑥( /𝑔 ‘𝐺)𝑦) = 𝑊))
55	54	biimprd 247	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ GrpOp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → ((𝑥( /𝑔 ‘𝐺)𝑦) = 𝑊 → 𝑥 = 𝑦))
56	55	3expb 1120	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑥( /𝑔 ‘𝐺)𝑦) = 𝑊 → 𝑥 = 𝑦))
57	56	3ad2antl1 1185	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑥( /𝑔 ‘𝐺)𝑦) = 𝑊 → 𝑥 = 𝑦))
58	53, 57	syl5 34	. . . . . . . . . 10 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑥( /𝑔 ‘𝐺)𝑦) ∈ {𝑊} → 𝑥 = 𝑦))
59	58	adantlr 713	. . . . . . . . 9 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑥( /𝑔 ‘𝐺)𝑦) ∈ {𝑊} → 𝑥 = 𝑦))
60	52, 59	sylbid 239	. . . . . . . 8 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) ∈ {𝑈} → 𝑥 = 𝑦))
61	39, 60	syl5 34	. . . . . . 7 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘(𝑥( /𝑔 ‘𝐺)𝑦)) = 𝑈 → 𝑥 = 𝑦))
62	35, 61	sylbird 259	. . . . . 6 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (((𝐹‘𝑥)( /𝑔 ‘𝐻)(𝐹‘𝑦)) = 𝑈 → 𝑥 = 𝑦))
63	31, 62	sylbid 239	. . . . 5 ⊢ ((((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
64	63	ralrimivva 3197	. . . 4 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
65		dff13 7202	. . . 4 ⊢ (𝐹:𝑋–1-1→𝑌 ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
66	22, 64, 65	sylanbrc 583	. . 3 ⊢ (((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) ∧ (◡𝐹 “ {𝑈}) = {𝑊}) → 𝐹:𝑋–1-1→𝑌)
67	66	ex 413	. 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → ((◡𝐹 “ {𝑈}) = {𝑊} → 𝐹:𝑋–1-1→𝑌))
68	21, 67	impbid 211	1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐻 ∈ GrpOp ∧ 𝐹 ∈ (𝐺 GrpOpHom 𝐻)) → (𝐹:𝑋–1-1→𝑌 ↔ (◡𝐹 “ {𝑈}) = {𝑊}))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3064   ⊆ wss 3910  {csn 4586  ^◡ccnv 5632  dom cdm 5633  ran crn 5634   “ cima 5636  Fun wfun 6490   Fn wfn 6491  ⟶wf 6492  –1-1→wf1 6493  ‘cfv 6496  (class class class)co 7357  GrpOpcgr 29431  GIdcgi 29432   /_𝑔 cgs 29434   GrpOpHom cghomOLD 36342

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922  df-grpo 29435  df-gid 29436  df-ginv 29437  df-gdiv 29438  df-ghomOLD 36343

This theorem is referenced by:  rngokerinj  36434