Theorem isgim 18394

Description: An isomorphism of groups is a bijective homomorphism. (Contributed by Stefan O'Rear, 21-Jan-2015.)

Hypotheses

Ref	Expression
isgim.b	⊢ 𝐵 = (Base‘𝑅)
isgim.c	⊢ 𝐶 = (Base‘𝑆)

Assertion

Ref	Expression
isgim	⊢ (𝐹 ∈ (𝑅 GrpIso 𝑆) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶))

Proof of Theorem isgim

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-3an 1086	. 2 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}))
2		df-gim 18391	. . 3 ⊢ GrpIso = (𝑎 ∈ Grp, 𝑏 ∈ Grp ↦ {𝑐 ∈ (𝑎 GrpHom 𝑏) ∣ 𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏)})
3		ovex 7168	. . . 4 ⊢ (𝑎 GrpHom 𝑏) ∈ V
4	3	rabex 5199	. . 3 ⊢ {𝑐 ∈ (𝑎 GrpHom 𝑏) ∣ 𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏)} ∈ V
5		oveq12 7144	. . . 4 ⊢ ((𝑎 = 𝑅 ∧ 𝑏 = 𝑆) → (𝑎 GrpHom 𝑏) = (𝑅 GrpHom 𝑆))
6		fveq2 6645	. . . . . 6 ⊢ (𝑎 = 𝑅 → (Base‘𝑎) = (Base‘𝑅))
7		isgim.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
8	6, 7	eqtr4di 2851	. . . . 5 ⊢ (𝑎 = 𝑅 → (Base‘𝑎) = 𝐵)
9		fveq2 6645	. . . . . 6 ⊢ (𝑏 = 𝑆 → (Base‘𝑏) = (Base‘𝑆))
10		isgim.c	. . . . . 6 ⊢ 𝐶 = (Base‘𝑆)
11	9, 10	eqtr4di 2851	. . . . 5 ⊢ (𝑏 = 𝑆 → (Base‘𝑏) = 𝐶)
12		f1oeq23 6582	. . . . 5 ⊢ (((Base‘𝑎) = 𝐵 ∧ (Base‘𝑏) = 𝐶) → (𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏) ↔ 𝑐:𝐵–1-1-onto→𝐶))
13	8, 11, 12	syl2an 598	. . . 4 ⊢ ((𝑎 = 𝑅 ∧ 𝑏 = 𝑆) → (𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏) ↔ 𝑐:𝐵–1-1-onto→𝐶))
14	5, 13	rabeqbidv 3433	. . 3 ⊢ ((𝑎 = 𝑅 ∧ 𝑏 = 𝑆) → {𝑐 ∈ (𝑎 GrpHom 𝑏) ∣ 𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏)} = {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶})
15	2, 4, 14	elovmpo 7370	. 2 ⊢ (𝐹 ∈ (𝑅 GrpIso 𝑆) ↔ (𝑅 ∈ Grp ∧ 𝑆 ∈ Grp ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}))
16		ghmgrp1 18352	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp)
17		ghmgrp2 18353	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑆 ∈ Grp)
18	16, 17	jca 515	. . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝑅 ∈ Grp ∧ 𝑆 ∈ Grp))
19	18	adantr 484	. . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (𝑅 ∈ Grp ∧ 𝑆 ∈ Grp))
20	19	pm4.71ri 564	. . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶)))
21		f1oeq1 6579	. . . . 5 ⊢ (𝑐 = 𝐹 → (𝑐:𝐵–1-1-onto→𝐶 ↔ 𝐹:𝐵–1-1-onto→𝐶))
22	21	elrab 3628	. . . 4 ⊢ (𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶} ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶))
23	22	anbi2i 625	. . 3 ⊢ (((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶)))
24	20, 23	bitr4i 281	. 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}))
25	1, 15, 24	3bitr4i 306	1 ⊢ (𝐹 ∈ (𝑅 GrpIso 𝑆) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶))

Syntax hints:   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  {crab 3110  –1-1-onto→wf1o 6323  ‘cfv 6324  (class class class)co 7135  Basecbs 16475  Grpcgrp 18095   GrpHom cghm 18347   GrpIso cgim 18389

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-ghm 18348  df-gim 18391

This theorem is referenced by:  gimf1o  18395  gimghm  18396  isgim2  18397  invoppggim  18480  rimgim  19484  lmimgim  19830  zzngim  20244  cygznlem3  20261  pm2mpgrpiso  21422  reefgim  25045  imasgim  40044