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

Theorem isnsg3 19200
Description: A subgroup is normal iff the conjugation of all the elements of the subgroup is in the subgroup. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
isnsg3.1 𝑋 = (Base‘𝐺)
isnsg3.2 + = (+g𝐺)
isnsg3.3 = (-g𝐺)
Assertion
Ref Expression
isnsg3 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
Distinct variable groups:   𝑥,𝑦,   𝑥,𝐺,𝑦   𝑥, + ,𝑦   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦

Proof of Theorem isnsg3
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nsgsubg 19198 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2 isnsg3.1 . . . . . 6 𝑋 = (Base‘𝐺)
3 isnsg3.2 . . . . . 6 + = (+g𝐺)
4 isnsg3.3 . . . . . 6 = (-g𝐺)
52, 3, 4nsgconj 19199 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥𝑋𝑦𝑆) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
653expb 1120 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥𝑋𝑦𝑆)) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
76ralrimivva 3208 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
81, 7jca 511 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
9 simpl 482 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10 subgrcl 19171 . . . . . . . . . . . 12 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1110ad2antrr 725 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12 simprll 778 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧𝑋)
13 eqid 2740 . . . . . . . . . . . 12 (0g𝐺) = (0g𝐺)
14 eqid 2740 . . . . . . . . . . . 12 (invg𝐺) = (invg𝐺)
152, 3, 13, 14grplinv 19029 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1611, 12, 15syl2anc 583 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1716oveq1d 7463 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g𝐺) + 𝑤))
182, 14grpinvcl 19027 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → ((invg𝐺)‘𝑧) ∈ 𝑋)
1911, 12, 18syl2anc 583 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg𝐺)‘𝑧) ∈ 𝑋)
20 simprlr 779 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤𝑋)
212, 3grpass 18982 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ (((invg𝐺)‘𝑧) ∈ 𝑋𝑧𝑋𝑤𝑋)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
2211, 19, 12, 20, 21syl13anc 1372 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
232, 3, 13grplid 19007 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑤𝑋) → ((0g𝐺) + 𝑤) = 𝑤)
2411, 20, 23syl2anc 583 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g𝐺) + 𝑤) = 𝑤)
2517, 22, 243eqtr3d 2788 . . . . . . . 8 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
2625oveq1d 7463 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 ((invg𝐺)‘𝑧)))
272, 3, 4, 14, 11, 20, 12grpsubinv 19052 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
2826, 27eqtrd 2780 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
29 simprr 772 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30 simplr 768 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
31 oveq1 7455 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg𝐺)‘𝑧) + 𝑦))
32 id 22 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → 𝑥 = ((invg𝐺)‘𝑧))
3331, 32oveq12d 7466 . . . . . . . . 9 (𝑥 = ((invg𝐺)‘𝑧) → ((𝑥 + 𝑦) 𝑥) = ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)))
3433eleq1d 2829 . . . . . . . 8 (𝑥 = ((invg𝐺)‘𝑧) → (((𝑥 + 𝑦) 𝑥) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆))
35 oveq2 7456 . . . . . . . . . 10 (𝑦 = (𝑧 + 𝑤) → (((invg𝐺)‘𝑧) + 𝑦) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
3635oveq1d 7463 . . . . . . . . 9 (𝑦 = (𝑧 + 𝑤) → ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) = ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)))
3736eleq1d 2829 . . . . . . . 8 (𝑦 = (𝑧 + 𝑤) → (((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆))
3834, 37rspc2va 3647 . . . . . . 7 (((((invg𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
3919, 29, 30, 38syl21anc 837 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
4028, 39eqeltrrd 2845 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
4140expr 456 . . . 4 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ (𝑧𝑋𝑤𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
4241ralrimivva 3208 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
432, 3isnsg2 19196 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆)))
449, 42, 43sylanbrc 582 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (NrmSGrp‘𝐺))
458, 44impbii 209 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wcel 2108  wral 3067  cfv 6573  (class class class)co 7448  Basecbs 17258  +gcplusg 17311  0gc0g 17499  Grpcgrp 18973  invgcminusg 18974  -gcsg 18975  SubGrpcsubg 19160  NrmSGrpcnsg 19161
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-0g 17501  df-mgm 18678  df-sgrp 18757  df-mnd 18773  df-grp 18976  df-minusg 18977  df-sbg 18978  df-subg 19163  df-nsg 19164
This theorem is referenced by:  nsgacs  19202  0nsg  19209  nsgid  19210  ghmnsgima  19280  ghmnsgpreima  19281  cntrsubgnsg  19383  clsnsg  24139
  Copyright terms: Public domain W3C validator