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

Theorem isnsg3 19072
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 19070 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2 isnsg3.1 . . . . . 6 𝑋 = (Base‘𝐺)
3 isnsg3.2 . . . . . 6 + = (+g𝐺)
4 isnsg3.3 . . . . . 6 = (-g𝐺)
52, 3, 4nsgconj 19071 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥𝑋𝑦𝑆) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
653expb 1120 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥𝑋𝑦𝑆)) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
76ralrimivva 3175 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
81, 7jca 511 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
9 simpl 482 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10 subgrcl 19044 . . . . . . . . . . . 12 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1110ad2antrr 726 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12 simprll 778 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧𝑋)
13 eqid 2731 . . . . . . . . . . . 12 (0g𝐺) = (0g𝐺)
14 eqid 2731 . . . . . . . . . . . 12 (invg𝐺) = (invg𝐺)
152, 3, 13, 14grplinv 18902 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1611, 12, 15syl2anc 584 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1716oveq1d 7361 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g𝐺) + 𝑤))
182, 14grpinvcl 18900 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → ((invg𝐺)‘𝑧) ∈ 𝑋)
1911, 12, 18syl2anc 584 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg𝐺)‘𝑧) ∈ 𝑋)
20 simprlr 779 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤𝑋)
212, 3grpass 18855 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ (((invg𝐺)‘𝑧) ∈ 𝑋𝑧𝑋𝑤𝑋)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
2211, 19, 12, 20, 21syl13anc 1374 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
232, 3, 13grplid 18880 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑤𝑋) → ((0g𝐺) + 𝑤) = 𝑤)
2411, 20, 23syl2anc 584 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g𝐺) + 𝑤) = 𝑤)
2517, 22, 243eqtr3d 2774 . . . . . . . 8 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
2625oveq1d 7361 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 ((invg𝐺)‘𝑧)))
272, 3, 4, 14, 11, 20, 12grpsubinv 18925 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
2826, 27eqtrd 2766 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
29 simprr 772 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30 simplr 768 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
31 oveq1 7353 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg𝐺)‘𝑧) + 𝑦))
32 id 22 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → 𝑥 = ((invg𝐺)‘𝑧))
3331, 32oveq12d 7364 . . . . . . . . 9 (𝑥 = ((invg𝐺)‘𝑧) → ((𝑥 + 𝑦) 𝑥) = ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)))
3433eleq1d 2816 . . . . . . . 8 (𝑥 = ((invg𝐺)‘𝑧) → (((𝑥 + 𝑦) 𝑥) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆))
35 oveq2 7354 . . . . . . . . . 10 (𝑦 = (𝑧 + 𝑤) → (((invg𝐺)‘𝑧) + 𝑦) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
3635oveq1d 7361 . . . . . . . . 9 (𝑦 = (𝑧 + 𝑤) → ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) = ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)))
3736eleq1d 2816 . . . . . . . 8 (𝑦 = (𝑧 + 𝑤) → (((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆))
3834, 37rspc2va 3584 . . . . . . 7 (((((invg𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
3919, 29, 30, 38syl21anc 837 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
4028, 39eqeltrrd 2832 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
4140expr 456 . . . 4 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ (𝑧𝑋𝑤𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
4241ralrimivva 3175 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
432, 3isnsg2 19068 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆)))
449, 42, 43sylanbrc 583 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (NrmSGrp‘𝐺))
458, 44impbii 209 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2111  wral 3047  cfv 6481  (class class class)co 7346  Basecbs 17120  +gcplusg 17161  0gc0g 17343  Grpcgrp 18846  invgcminusg 18847  -gcsg 18848  SubGrpcsubg 19033  NrmSGrpcnsg 19034
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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-1st 7921  df-2nd 7922  df-0g 17345  df-mgm 18548  df-sgrp 18627  df-mnd 18643  df-grp 18849  df-minusg 18850  df-sbg 18851  df-subg 19036  df-nsg 19037
This theorem is referenced by:  nsgacs  19074  0nsg  19081  nsgid  19082  ghmnsgima  19152  ghmnsgpreima  19153  cntrsubgnsg  19255  clsnsg  24025
  Copyright terms: Public domain W3C validator