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 1084	. 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 7181	. . . 4 ⊢ (𝑎 GrpHom 𝑏) ∈ V
4	3	rabex 5226	. . 3 ⊢ {𝑐 ∈ (𝑎 GrpHom 𝑏) ∣ 𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏)} ∈ V
5		oveq12 7157	. . . 4 ⊢ ((𝑎 = 𝑅 ∧ 𝑏 = 𝑆) → (𝑎 GrpHom 𝑏) = (𝑅 GrpHom 𝑆))
6		fveq2 6663	. . . . . 6 ⊢ (𝑎 = 𝑅 → (Base‘𝑎) = (Base‘𝑅))
7		isgim.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
8	6, 7	syl6eqr 2872	. . . . 5 ⊢ (𝑎 = 𝑅 → (Base‘𝑎) = 𝐵)
9		fveq2 6663	. . . . . 6 ⊢ (𝑏 = 𝑆 → (Base‘𝑏) = (Base‘𝑆))
10		isgim.c	. . . . . 6 ⊢ 𝐶 = (Base‘𝑆)
11	9, 10	syl6eqr 2872	. . . . 5 ⊢ (𝑏 = 𝑆 → (Base‘𝑏) = 𝐶)
12		f1oeq23 6600	. . . . 5 ⊢ (((Base‘𝑎) = 𝐵 ∧ (Base‘𝑏) = 𝐶) → (𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏) ↔ 𝑐:𝐵–1-1-onto→𝐶))
13	8, 11, 12	syl2an 597	. . . 4 ⊢ ((𝑎 = 𝑅 ∧ 𝑏 = 𝑆) → (𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏) ↔ 𝑐:𝐵–1-1-onto→𝐶))
14	5, 13	rabeqbidv 3484	. . 3 ⊢ ((𝑎 = 𝑅 ∧ 𝑏 = 𝑆) → {𝑐 ∈ (𝑎 GrpHom 𝑏) ∣ 𝑐:(Base‘𝑎)–1-1-onto→(Base‘𝑏)} = {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶})
15	2, 4, 14	elovmpo 7382	. 2 ⊢ (𝐹 ∈ (𝑅 GrpIso 𝑆) ↔ (𝑅 ∈ Grp ∧ 𝑆 ∈ Grp ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}))
16		ghmgrp1 18352	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑅 ∈ Grp)
17		ghmgrp2 18353	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → 𝑆 ∈ Grp)
18	16, 17	jca 514	. . . . 5 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑆) → (𝑅 ∈ Grp ∧ 𝑆 ∈ Grp))
19	18	adantr 483	. . . 4 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (𝑅 ∈ Grp ∧ 𝑆 ∈ Grp))
20	19	pm4.71ri 563	. . 3 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶)))
21		f1oeq1 6597	. . . . 5 ⊢ (𝑐 = 𝐹 → (𝑐:𝐵–1-1-onto→𝐶 ↔ 𝐹:𝐵–1-1-onto→𝐶))
22	21	elrab 3678	. . . 4 ⊢ (𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶} ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶))
23	22	anbi2i 624	. . 3 ⊢ (((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶)))
24	20, 23	bitr4i 280	. 2 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ↔ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) ∧ 𝐹 ∈ {𝑐 ∈ (𝑅 GrpHom 𝑆) ∣ 𝑐:𝐵–1-1-onto→𝐶}))
25	1, 15, 24	3bitr4i 305	1 ⊢ (𝐹 ∈ (𝑅 GrpIso 𝑆) ↔ (𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶))

Syntax hints:   ↔ wb 208   ∧ wa 398   ∧ w3a 1082   = wceq 1531   ∈ wcel 2108  {crab 3140  –1-1-onto→wf1o 6347  ‘cfv 6348  (class class class)co 7148  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 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-ghm 18348  df-gim 18391

This theorem is referenced by:  gimf1o  18395  gimghm  18396  isgim2  18397  invoppggim  18480  rimgim  19480  lmimgim  19829  zzngim  20691  cygznlem3  20708  pm2mpgrpiso  21417  reefgim  25030  imasgim  39690