MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  conjsubgen Structured version   Visualization version   GIF version

Theorem conjsubgen 19458
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
StepHypRef Expression
1 subgrcl 19334 . . . . . . 7 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2 conjghm.x . . . . . . . 8 𝑋 = (Base‘𝐺)
3 conjghm.p . . . . . . . 8 + = (+g‘𝐺)
4 conjghm.m . . . . . . . 8 − = (-g‘𝐺)
5 eqid 2761 . . . . . . . 8 (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) = (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴))
62, 3, 4, 5conjghm 19456 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1-onto→𝑋))
71, 6sylan 592 . . . . . 6 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ∈ (𝐺 GrpHom 𝐺) ∧ (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1-onto→𝑋))
8 f1of1 6821 . . . . . 6 ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1-onto→𝑋 → (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1→𝑋)
97, 8simpl2im 513 . . . . 5 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → (𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1→𝑋)
102subgss 19330 . . . . . 6 (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ 𝑋)
1110adantr 486 . . . . 5 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝑆 ⊆ 𝑋)
12 f1ssres 6785 . . . . 5 (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)):𝑋–1-1→𝑋 ∧ 𝑆 ⊆ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋)
139, 11, 12syl2anc 596 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋)
1411resmptd 6032 . . . . . 6 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴)))
15 conjsubg.f . . . . . 6 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))
1614, 15eqtr4di 2814 . . . . 5 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → ((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = 𝐹)
17 f1eq1 6771 . . . . 5 (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆) = 𝐹 → (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋 ↔ 𝐹:𝑆–1-1→𝑋))
1816, 17syl 18 . . . 4 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → (((𝑥 ∈ 𝑋 ↦ ((𝐴 + 𝑥) − 𝐴)) ↾ 𝑆):𝑆–1-1→𝑋 ↔ 𝐹:𝑆–1-1→𝑋))
1913, 18mpbid 235 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑆–1-1→𝑋)
20 f1f1orn 6834 . . 3 (𝐹:𝑆–1-1→𝑋 → 𝐹:𝑆–1-1-onto→ran 𝐹)
2119, 20syl 18 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝐹:𝑆–1-1-onto→ran 𝐹)
22 f1oeng 8990 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐹:𝑆–1-1-onto→ran 𝐹) → 𝑆 ≈ ran 𝐹)
2321, 22syldan 603 1 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑋) → 𝑆 ≈ ran 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899   class class class wbr 5103   ↦ cmpt 5186  ran crn 5652   ↾ cres 5653  –1-1→wf1 6534  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7418   ≈ cen 8963  Basecbs 17380  +gcplusg 17421  Grpcgrp 19137  -gcsg 19139  SubGrpcsubg 19323   GrpHom cghm 19420
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-map 8842  df-en 8967  df-0g 17605  df-mgm 18809  df-sgrp 18901  df-mnd 18917  df-grp 19140  df-minusg 19141  df-sbg 19142  df-subg 19326  df-ghm 19421
This theorem is used by:  slwhash  19831  sylow2  19833  sylow3lem1  19834
  Copyright terms: Public domain W3C validator