Theorem ghmf1o 14137

Description: A bijective group homomorphism is an isomorphism. (Contributed by Mario Carneiro, 13-Jan-2015.)

Hypotheses

Ref	Expression
ghmf1o.x	⊢ 𝑋 = (Base‘𝑆)
ghmf1o.y	⊢ 𝑌 = (Base‘𝑇)

Assertion

Ref	Expression
ghmf1o	⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋–1-1-onto→𝑌 ↔ ◡𝐹 ∈ (𝑇 GrpHom 𝑆)))

Proof of Theorem ghmf1o

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

Step	Hyp	Ref	Expression
1		ghmgrp2 14108	. . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑇 ∈ Grp)
2		ghmgrp1 14107	. . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)
3	1, 2	jca 306	. . . 4 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝑇 ∈ Grp ∧ 𝑆 ∈ Grp))
4	3	adantr 276	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) → (𝑇 ∈ Grp ∧ 𝑆 ∈ Grp))
5		f1ocnv 5655	. . . . . 6 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ◡𝐹:𝑌–1-1-onto→𝑋)
6	5	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) → ◡𝐹:𝑌–1-1-onto→𝑋)
7		f1of 5642	. . . . 5 ⊢ (◡𝐹:𝑌–1-1-onto→𝑋 → ◡𝐹:𝑌⟶𝑋)
8	6, 7	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) → ◡𝐹:𝑌⟶𝑋)
9		simpll 531	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → 𝐹 ∈ (𝑆 GrpHom 𝑇))
10	8	adantr 276	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → ◡𝐹:𝑌⟶𝑋)
11		simprl 535	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → 𝑥 ∈ 𝑌)
12	10, 11	ffvelcdmd 5847	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (◡𝐹‘𝑥) ∈ 𝑋)
13		simprr 537	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → 𝑦 ∈ 𝑌)
14	10, 13	ffvelcdmd 5847	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (◡𝐹‘𝑦) ∈ 𝑋)
15		ghmf1o.x	. . . . . . . . 9 ⊢ 𝑋 = (Base‘𝑆)
16		eqid 2238	. . . . . . . . 9 ⊢ (+g‘𝑆) = (+g‘𝑆)
17		eqid 2238	. . . . . . . . 9 ⊢ (+g‘𝑇) = (+g‘𝑇)
18	15, 16, 17	ghmlin 14110	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ (◡𝐹‘𝑥) ∈ 𝑋 ∧ (◡𝐹‘𝑦) ∈ 𝑋) → (𝐹‘((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))) = ((𝐹‘(◡𝐹‘𝑥))(+g‘𝑇)(𝐹‘(◡𝐹‘𝑦))))
19	9, 12, 14, 18	syl3anc 1278	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝐹‘((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))) = ((𝐹‘(◡𝐹‘𝑥))(+g‘𝑇)(𝐹‘(◡𝐹‘𝑦))))
20		simplr 533	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → 𝐹:𝑋–1-1-onto→𝑌)
21		f1ocnvfv2 5987	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑥 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑥)) = 𝑥)
22	20, 11, 21	syl2anc 415	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑥)) = 𝑥)
23		f1ocnvfv2 5987	. . . . . . . . 9 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ 𝑦 ∈ 𝑌) → (𝐹‘(◡𝐹‘𝑦)) = 𝑦)
24	20, 13, 23	syl2anc 415	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝐹‘(◡𝐹‘𝑦)) = 𝑦)
25	22, 24	oveq12d 6106	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → ((𝐹‘(◡𝐹‘𝑥))(+g‘𝑇)(𝐹‘(◡𝐹‘𝑦))) = (𝑥(+g‘𝑇)𝑦))
26	19, 25	eqtrd 2271	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝐹‘((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))) = (𝑥(+g‘𝑇)𝑦))
27	9, 2	syl 14	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → 𝑆 ∈ Grp)
28	15, 16	grpcl 13872	. . . . . . . 8 ⊢ ((𝑆 ∈ Grp ∧ (◡𝐹‘𝑥) ∈ 𝑋 ∧ (◡𝐹‘𝑦) ∈ 𝑋) → ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦)) ∈ 𝑋)
29	27, 12, 14, 28	syl3anc 1278	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦)) ∈ 𝑋)
30		f1ocnvfv 5988	. . . . . . 7 ⊢ ((𝐹:𝑋–1-1-onto→𝑌 ∧ ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦)) ∈ 𝑋) → ((𝐹‘((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))) = (𝑥(+g‘𝑇)𝑦) → (◡𝐹‘(𝑥(+g‘𝑇)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))))
31	20, 29, 30	syl2anc 415	. . . . . 6 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → ((𝐹‘((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))) = (𝑥(+g‘𝑇)𝑦) → (◡𝐹‘(𝑥(+g‘𝑇)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))))
32	26, 31	mpd 13	. . . . 5 ⊢ (((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (◡𝐹‘(𝑥(+g‘𝑇)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦)))
33	32	ralrimivva 2632	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) → ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (◡𝐹‘(𝑥(+g‘𝑇)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦)))
34	8, 33	jca 306	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) → (◡𝐹:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (◡𝐹‘(𝑥(+g‘𝑇)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦))))
35		ghmf1o.y	. . . 4 ⊢ 𝑌 = (Base‘𝑇)
36	35, 15, 17, 16	isghm 14105	. . 3 ⊢ (◡𝐹 ∈ (𝑇 GrpHom 𝑆) ↔ ((𝑇 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (◡𝐹:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (◡𝐹‘(𝑥(+g‘𝑇)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑆)(◡𝐹‘𝑦)))))
37	4, 34, 36	sylanbrc 421	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹:𝑋–1-1-onto→𝑌) → ◡𝐹 ∈ (𝑇 GrpHom 𝑆))
38	15, 35	ghmf 14109	. . . . 5 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝐹:𝑋⟶𝑌)
39	38	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ ◡𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑋⟶𝑌)
40	39	ffnd 5537	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ ◡𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹 Fn 𝑋)
41	35, 15	ghmf 14109	. . . . 5 ⊢ (◡𝐹 ∈ (𝑇 GrpHom 𝑆) → ◡𝐹:𝑌⟶𝑋)
42	41	adantl 277	. . . 4 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ ◡𝐹 ∈ (𝑇 GrpHom 𝑆)) → ◡𝐹:𝑌⟶𝑋)
43	42	ffnd 5537	. . 3 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ ◡𝐹 ∈ (𝑇 GrpHom 𝑆)) → ◡𝐹 Fn 𝑌)
44		dff1o4 5650	. . 3 ⊢ (𝐹:𝑋–1-1-onto→𝑌 ↔ (𝐹 Fn 𝑋 ∧ ◡𝐹 Fn 𝑌))
45	40, 43, 44	sylanbrc 421	. 2 ⊢ ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ ◡𝐹 ∈ (𝑇 GrpHom 𝑆)) → 𝐹:𝑋–1-1-onto→𝑌)
46	37, 45	impbida 604	1 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → (𝐹:𝑋–1-1-onto→𝑌 ↔ ◡𝐹 ∈ (𝑇 GrpHom 𝑆)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ^◡ccnv 4775   Fn wfn 5375  ⟶wf 5376  –1-1-onto→wf1o 5379  ‘cfv 5380  (class class class)co 6088  Basecbs 13410  +_gcplusg 13490  Grpcgrp 13864   GrpHom cghm 14102

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-inn 9314  df-2 9372  df-ndx 13413  df-slot 13414  df-base 13416  df-plusg 13503  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-ghm 14103

This theorem is used by:  rhmf1o  14584