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

Theorem isnsg3 19135
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 19133 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2 isnsg3.1 . . . . . 6 𝑋 = (Base‘𝐺)
3 isnsg3.2 . . . . . 6 + = (+g𝐺)
4 isnsg3.3 . . . . . 6 = (-g𝐺)
52, 3, 4nsgconj 19134 . . . . 5 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥𝑋𝑦𝑆) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
653expb 1121 . . . 4 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥𝑋𝑦𝑆)) → ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
76ralrimivva 3180 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
81, 7jca 511 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
9 simpl 482 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10 subgrcl 19107 . . . . . . . . . . . 12 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
1110ad2antrr 727 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12 simprll 779 . . . . . . . . . . 11 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧𝑋)
13 eqid 2736 . . . . . . . . . . . 12 (0g𝐺) = (0g𝐺)
14 eqid 2736 . . . . . . . . . . . 12 (invg𝐺) = (invg𝐺)
152, 3, 13, 14grplinv 18965 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1611, 12, 15syl2anc 585 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + 𝑧) = (0g𝐺))
1716oveq1d 7382 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g𝐺) + 𝑤))
182, 14grpinvcl 18963 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑧𝑋) → ((invg𝐺)‘𝑧) ∈ 𝑋)
1911, 12, 18syl2anc 585 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg𝐺)‘𝑧) ∈ 𝑋)
20 simprlr 780 . . . . . . . . . 10 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤𝑋)
212, 3grpass 18918 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ (((invg𝐺)‘𝑧) ∈ 𝑋𝑧𝑋𝑤𝑋)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
2211, 19, 12, 20, 21syl13anc 1375 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
232, 3, 13grplid 18943 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑤𝑋) → ((0g𝐺) + 𝑤) = 𝑤)
2411, 20, 23syl2anc 585 . . . . . . . . 9 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g𝐺) + 𝑤) = 𝑤)
2517, 22, 243eqtr3d 2779 . . . . . . . 8 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
2625oveq1d 7382 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 ((invg𝐺)‘𝑧)))
272, 3, 4, 14, 11, 20, 12grpsubinv 18988 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
2826, 27eqtrd 2771 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) = (𝑤 + 𝑧))
29 simprr 773 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30 simplr 769 . . . . . . 7 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆)
31 oveq1 7374 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg𝐺)‘𝑧) + 𝑦))
32 id 22 . . . . . . . . . 10 (𝑥 = ((invg𝐺)‘𝑧) → 𝑥 = ((invg𝐺)‘𝑧))
3331, 32oveq12d 7385 . . . . . . . . 9 (𝑥 = ((invg𝐺)‘𝑧) → ((𝑥 + 𝑦) 𝑥) = ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)))
3433eleq1d 2821 . . . . . . . 8 (𝑥 = ((invg𝐺)‘𝑧) → (((𝑥 + 𝑦) 𝑥) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆))
35 oveq2 7375 . . . . . . . . . 10 (𝑦 = (𝑧 + 𝑤) → (((invg𝐺)‘𝑧) + 𝑦) = (((invg𝐺)‘𝑧) + (𝑧 + 𝑤)))
3635oveq1d 7382 . . . . . . . . 9 (𝑦 = (𝑧 + 𝑤) → ((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) = ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)))
3736eleq1d 2821 . . . . . . . 8 (𝑦 = (𝑧 + 𝑤) → (((((invg𝐺)‘𝑧) + 𝑦) ((invg𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆))
3834, 37rspc2va 3576 . . . . . . 7 (((((invg𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
3919, 29, 30, 38syl21anc 838 . . . . . 6 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg𝐺)‘𝑧) + (𝑧 + 𝑤)) ((invg𝐺)‘𝑧)) ∈ 𝑆)
4028, 39eqeltrrd 2837 . . . . 5 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ ((𝑧𝑋𝑤𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
4140expr 456 . . . 4 (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) ∧ (𝑧𝑋𝑤𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
4241ralrimivva 3180 . . 3 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
432, 3isnsg2 19131 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑧𝑋𝑤𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆)))
449, 42, 43sylanbrc 584 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆) → 𝑆 ∈ (NrmSGrp‘𝐺))
458, 44impbii 209 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑆 ((𝑥 + 𝑦) 𝑥) ∈ 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3051  cfv 6498  (class class class)co 7367  Basecbs 17179  +gcplusg 17220  0gc0g 17402  Grpcgrp 18909  invgcminusg 18910  -gcsg 18911  SubGrpcsubg 19096  NrmSGrpcnsg 19097
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-0g 17404  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-grp 18912  df-minusg 18913  df-sbg 18914  df-subg 19099  df-nsg 19100
This theorem is referenced by:  nsgacs  19137  0nsg  19144  nsgid  19145  ghmnsgima  19215  ghmnsgpreima  19216  cntrsubgnsg  19318  clsnsg  24075
  Copyright terms: Public domain W3C validator