Theorem conjsubgen 19515

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 19391	. . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2		conjghm.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
3		conjghm.p	. . . . . . . 8 ⊢ + = (+g‘𝐺)
4		conjghm.m	. . . . . . . 8 ⊢ − = (-g‘𝐺)
5		eqid 2763	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) = (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴))
6	2, 3, 4, 5	conjghm 19513	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋⟶1-1onto𝑋))
7	1, 6	sylan 592	. . . . . 6 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋⟶1-1onto𝑋))
8		f1of1 6853	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋⟶1-1onto𝑋 → (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋⟶1-1𝑋)
9	7, 8	simpl2im 513	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋⟶1-1𝑋)
10	2	subgss 19387	. . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ 𝑋)
11	10	adantr 486	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ 𝑋)
12		f1ssres 6817	. . . . 5 ⊢ (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋⟶1-1𝑋 ∧ 𝑆 ⊆ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆⟶1-1𝑋)
13	9, 11, 12	syl2anc 596	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆⟶1-1𝑋)
14	11	resmptd 6050	. . . . . 6 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴)))
15		conjsubg.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))
16	14, 15	eqtr4di 2816	. . . . 5 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = 𝐹)
17		f1eq1 6803	. . . . 5 ⊢ (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = 𝐹 → (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆⟶1-1𝑋 ↔ 𝐹:𝑆⟶1-1𝑋))
18	16, 17	syl 18	. . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆⟶1-1𝑋 ↔ 𝐹:𝑆⟶1-1𝑋))
19	13, 18	mpbid 235	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑆⟶1-1𝑋)
20		f1f1orn 6866	. . 3 ⊢ (𝐹:𝑆⟶1-1𝑋 → 𝐹:𝑆⟶1-1ontoran 𝐹)
21	19, 20	syl 18	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑆⟶1-1ontoran 𝐹)
22		f1oeng 9035	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐹:𝑆⟶1-1ontoran 𝐹) → 𝑆 ≈ ran 𝐹)
23	21, 22	syldan 603	1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝑆 ≈ ran 𝐹)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   class class class wbr 5108   ↦ cmpt 5192  ran crn 5659   ↾ cres 5660  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ≈ cen 9008  Basecbs 17431  +_gcplusg 17472  Grpcgrp 19194  -_gcsg 19196  SubGrpcsubg 19380   GrpHom cghm 19477

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-map 8887  df-en 9012  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-minusg 19198  df-sbg 19199  df-subg 19383  df-ghm 19478

This theorem is used by:  slwhash  19889  sylow2  19891  sylow3lem1  19892