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

Theorem conjnsg 18870
Description: A normal subgroup is unchanged under conjugation. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
conjghm.x 𝑋 = (Base‘𝐺)
conjghm.p + = (+g𝐺)
conjghm.m = (-g𝐺)
conjsubg.f 𝐹 = (𝑥𝑆 ↦ ((𝐴 + 𝑥) 𝐴))
Assertion
Ref Expression
conjnsg ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴𝑋) → 𝑆 = ran 𝐹)
Distinct variable groups:   𝑥,   𝑥, +   𝑥,𝐴   𝑥,𝐺   𝑥,𝑆   𝑥,𝑋
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem conjnsg
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nsgsubg 18786 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2 eqid 2738 . . . . . 6 {𝑦𝑋 ∣ ∀𝑧𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)} = {𝑦𝑋 ∣ ∀𝑧𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)}
3 conjghm.x . . . . . 6 𝑋 = (Base‘𝐺)
4 conjghm.p . . . . . 6 + = (+g𝐺)
52, 3, 4isnsg4 18795 . . . . 5 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ {𝑦𝑋 ∣ ∀𝑧𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)} = 𝑋))
65simprbi 497 . . . 4 (𝑆 ∈ (NrmSGrp‘𝐺) → {𝑦𝑋 ∣ ∀𝑧𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)} = 𝑋)
76eleq2d 2824 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝐴 ∈ {𝑦𝑋 ∣ ∀𝑧𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)} ↔ 𝐴𝑋))
87biimpar 478 . 2 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴𝑋) → 𝐴 ∈ {𝑦𝑋 ∣ ∀𝑧𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)})
9 conjghm.m . . 3 = (-g𝐺)
10 conjsubg.f . . 3 𝐹 = (𝑥𝑆 ↦ ((𝐴 + 𝑥) 𝐴))
113, 4, 9, 10, 2conjnmz 18868 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ {𝑦𝑋 ∣ ∀𝑧𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)}) → 𝑆 = ran 𝐹)
121, 8, 11syl2an2r 682 1 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴𝑋) → 𝑆 = ran 𝐹)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1539  wcel 2106  wral 3064  {crab 3068  cmpt 5157  ran crn 5590  cfv 6433  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  -gcsg 18579  SubGrpcsubg 18749  NrmSGrpcnsg 18750
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-0g 17152  df-mgm 18326  df-sgrp 18375  df-mnd 18386  df-grp 18580  df-minusg 18581  df-sbg 18582  df-subg 18752  df-nsg 18753
This theorem is referenced by:  sylow3lem6  19237
  Copyright terms: Public domain W3C validator