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

Theorem isnsg 18783
Description: Property of being a normal subgroup. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
isnsg.1 𝑋 = (Base‘𝐺)
isnsg.2 + = (+g𝐺)
Assertion
Ref Expression
isnsg (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
Distinct variable groups:   𝑥,𝑦,𝐺   𝑥, + ,𝑦   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦

Proof of Theorem isnsg
Dummy variables 𝑔 𝑏 𝑝 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nsg 18753 . . 3 NrmSGrp = (𝑔 ∈ Grp ↦ {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)})
21mptrcl 6884 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
3 subgrcl 18760 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
43adantr 481 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) → 𝐺 ∈ Grp)
5 fveq2 6774 . . . . . 6 (𝑔 = 𝐺 → (SubGrp‘𝑔) = (SubGrp‘𝐺))
6 fvexd 6789 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) ∈ V)
7 fveq2 6774 . . . . . . . 8 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
8 isnsg.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
97, 8eqtr4di 2796 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
10 fvexd 6789 . . . . . . . 8 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) ∈ V)
11 simpl 483 . . . . . . . . . 10 ((𝑔 = 𝐺𝑏 = 𝑋) → 𝑔 = 𝐺)
1211fveq2d 6778 . . . . . . . . 9 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) = (+g𝐺))
13 isnsg.2 . . . . . . . . 9 + = (+g𝐺)
1412, 13eqtr4di 2796 . . . . . . . 8 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) = + )
15 simplr 766 . . . . . . . . 9 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑏 = 𝑋)
16 simpr 485 . . . . . . . . . . . . 13 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑝 = + )
1716oveqd 7292 . . . . . . . . . . . 12 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑥𝑝𝑦) = (𝑥 + 𝑦))
1817eleq1d 2823 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑠))
1916oveqd 7292 . . . . . . . . . . . 12 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑦𝑝𝑥) = (𝑦 + 𝑥))
2019eleq1d 2823 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑦𝑝𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠))
2118, 20bibi12d 346 . . . . . . . . . 10 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
2215, 21raleqbidv 3336 . . . . . . . . 9 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
2315, 22raleqbidv 3336 . . . . . . . 8 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
2410, 14, 23sbcied2 3763 . . . . . . 7 ((𝑔 = 𝐺𝑏 = 𝑋) → ([(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
256, 9, 24sbcied2 3763 . . . . . 6 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
265, 25rabeqbidv 3420 . . . . 5 (𝑔 = 𝐺 → {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)} = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
27 fvex 6787 . . . . . 6 (SubGrp‘𝐺) ∈ V
2827rabex 5256 . . . . 5 {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ∈ V
2926, 1, 28fvmpt 6875 . . . 4 (𝐺 ∈ Grp → (NrmSGrp‘𝐺) = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
3029eleq2d 2824 . . 3 (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ 𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)}))
31 eleq2 2827 . . . . . 6 (𝑠 = 𝑆 → ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑆))
32 eleq2 2827 . . . . . 6 (𝑠 = 𝑆 → ((𝑦 + 𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑆))
3331, 32bibi12d 346 . . . . 5 (𝑠 = 𝑆 → (((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
34332ralbidv 3129 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
3534elrab 3624 . . 3 (𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
3630, 35bitrdi 287 . 2 (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))))
372, 4, 36pm5.21nii 380 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1539  wcel 2106  wral 3064  {crab 3068  Vcvv 3432  [wsbc 3716  cfv 6433  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  Grpcgrp 18577  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
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-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  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-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-fv 6441  df-ov 7278  df-subg 18752  df-nsg 18753
This theorem is referenced by:  isnsg2  18784  nsgbi  18785  nsgsubg  18786  isnsg4  18795  nmznsg  18796  ablnsg  19448  rzgrp  20828
  Copyright terms: Public domain W3C validator