Theorem conjsubgen 18393

Description: A conjugated subgroup is equinumerous to the original subgroup. (Contributed by Mario Carneiro, 18-Jan-2015.)

Hypotheses

Ref	Expression
conjghm.x	⊢ 𝑋 = (Base‘𝐺)
conjghm.p	⊢ + = (+g‘𝐺)
conjghm.m	⊢ − = (-g‘𝐺)
conjsubg.f	⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))

Assertion

Ref	Expression
conjsubgen	⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝑆 ≈ ran 𝐹)

Distinct variable groups:   𝑥, −   𝑥, +   𝑥,𝐴   𝑥,𝐺   𝑥,𝑆   𝑥,𝑋

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem conjsubgen

Step	Hyp	Ref	Expression
1		subgrcl 18286	. . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2		conjghm.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
3		conjghm.p	. . . . . . . 8 ⊢ + = (+g‘𝐺)
4		conjghm.m	. . . . . . . 8 ⊢ − = (-g‘𝐺)
5		eqid 2823	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) = (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴))
6	2, 3, 4, 5	conjghm 18391	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1-onto→𝑋))
7	1, 6	sylan 582	. . . . . 6 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1-onto→𝑋))
8		f1of1 6616	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1-onto→𝑋 → (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1→𝑋)
9	7, 8	simpl2im 506	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1→𝑋)
10	2	subgss 18282	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ 𝑋)
11	10	adantr 483	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ 𝑋)
12		f1ssres 6584	. . . . 5 ⊢ (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1→𝑋 ∧ 𝑆 ⊆ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋)
13	9, 11, 12	syl2anc 586	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋)
14	11	resmptd 5910	. . . . . 6 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴)))
15		conjsubg.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))
16	14, 15	syl6eqr 2876	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = 𝐹)
17		f1eq1 6572	. . . . 5 ⊢ (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = 𝐹 → (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋 ↔ 𝐹:𝑆–1-1→𝑋))
18	16, 17	syl 17	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋 ↔ 𝐹:𝑆–1-1→𝑋))
19	13, 18	mpbid 234	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑆–1-1→𝑋)
20		f1f1orn 6628	. . 3 ⊢ (𝐹:𝑆–1-1→𝑋 → 𝐹:𝑆–1-1-onto→ran 𝐹)
21	19, 20	syl 17	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑆–1-1-onto→ran 𝐹)
22		f1oeng 8530	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐹:𝑆–1-1-onto→ran 𝐹) → 𝑆 ≈ ran 𝐹)
23	21, 22	syldan 593	1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝑆 ≈ ran 𝐹)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114   ⊆ wss 3938   class class class wbr 5068   ↦ cmpt 5148  ran crn 5558   ↾ cres 5559  –1-1→wf1 6354  –1-1-onto→wf1o 6356  ‘cfv 6357  (class class class)co 7158   ≈ cen 8508  Basecbs 16485  +_gcplusg 16567  Grpcgrp 18105  -_gcsg 18107  SubGrpcsubg 18275   GrpHom cghm 18357

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-en 8512  df-0g 16717  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-grp 18108  df-minusg 18109  df-sbg 18110  df-subg 18278  df-ghm 18358

This theorem is referenced by:  slwhash  18751  sylow2  18753  sylow3lem1  18754