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

Theorem isnsg3 19385
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 19383 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2 isnsg3.1 . . . . . 6 𝑋 = (Base‘𝐺)
3 isnsg3.2 . . . . . 6 + = (+g‘𝐺)
4 isnsg3.3 . . . . . 6 − = (-g‘𝐺)
52, 3, 4nsgconj 19384 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
653expb 1138 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
76ralrimivva 3209 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
81, 7jca 521 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))
9 simpl 488 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10 subgrcl 19356 . . . . . . . . . . . 12 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1110ad2antrr 739 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12 simprll 791 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧 ∈ 𝑋)
13 eqid 2763 . . . . . . . . . . . 12 (0g‘𝐺) = (0g‘𝐺)
14 eqid 2763 . . . . . . . . . . . 12 (invg‘𝐺) = (invg‘𝐺)
152, 3, 13, 14grplinv 19215 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
1611, 12, 15syl2anc 596 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
1716oveq1d 7445 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g‘𝐺) + 𝑤))
182, 14grpinvcl 19213 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
1911, 12, 18syl2anc 596 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
20 simprlr 792 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤 ∈ 𝑋)
212, 3grpass 19168 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ (((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
2211, 19, 12, 20, 21syl13anc 1399 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
232, 3, 13grplid 19193 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑤 ∈ 𝑋) → ((0g‘𝐺) + 𝑤) = 𝑤)
2411, 20, 23syl2anc 596 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g‘𝐺) + 𝑤) = 𝑤)
2517, 22, 243eqtr3d 2806 . . . . . . . 8 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
2625oveq1d 7445 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 − ((invg‘𝐺)‘𝑧)))
272, 3, 4, 14, 11, 20, 12grpsubinv 19237 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
2826, 27eqtrd 2798 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
29 simprr 785 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30 simplr 781 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
31 oveq1 7437 . . . . . . . . . 10 (𝑥 = ((invg‘𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg‘𝐺)‘𝑧) + 𝑦))
32 id 23 . . . . . . . . . 10 (𝑥 = ((invg‘𝐺)‘𝑧) → 𝑥 = ((invg‘𝐺)‘𝑧))
3331, 32oveq12d 7448 . . . . . . . . 9 (𝑥 = ((invg‘𝐺)‘𝑧) → ((𝑥 + 𝑦) − 𝑥) = ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)))
3433eleq1d 2849 . . . . . . . 8 (𝑥 = ((invg‘𝐺)‘𝑧) → (((𝑥 + 𝑦) − 𝑥) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
35 oveq2 7438 . . . . . . . . . 10 (𝑦 = (𝑧 + 𝑤) → (((invg‘𝐺)‘𝑧) + 𝑦) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
3635oveq1d 7445 . . . . . . . . 9 (𝑦 = (𝑧 + 𝑤) → ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) = ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)))
3736eleq1d 2849 . . . . . . . 8 (𝑦 = (𝑧 + 𝑤) → (((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
3834, 37rspc2va 3591 . . . . . . 7 (((((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
3919, 29, 30, 38syl21anc 851 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
4028, 39eqeltrrd 2865 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
4140expr 462 . . . 4 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
4241ralrimivva 3209 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
432, 3isnsg2 19381 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆)))
449, 42, 43sylanbrc 595 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → 𝑆 ∈ (NrmSGrp‘𝐺))
458, 44impbii 212 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3080  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  +gcplusg 17443  0gc0g 17625  Grpcgrp 19159  invgcminusg 19160  -gcsg 19161  SubGrpcsubg 19345  NrmSGrpcnsg 19346
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-1st 8011  df-2nd 8012  df-0g 17627  df-mgm 18831  df-sgrp 18923  df-mnd 18939  df-grp 19162  df-minusg 19163  df-sbg 19164  df-subg 19348  df-nsg 19349
This theorem is used by:  nsgacs  19387  0nsg  19394  nsgid  19395  ghmnsgima  19469  ghmnsgpreima  19470  cntrsubgnsg  19572  clsnsg  24444
  Copyright terms: Public domain W3C validator