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

Theorem nsgbi 19077
Description: Defining property of a normal subgroup. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
isnsg.1 𝑋 = (Base‘𝐺)
isnsg.2 + = (+g𝐺)
Assertion
Ref Expression
nsgbi ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))

Proof of Theorem nsgbi
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isnsg.1 . . . . 5 𝑋 = (Base‘𝐺)
2 isnsg.2 . . . . 5 + = (+g𝐺)
31, 2isnsg 19075 . . . 4 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
43simprbi 496 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))
5 oveq1 7362 . . . . . 6 (𝑥 = 𝐴 → (𝑥 + 𝑦) = (𝐴 + 𝑦))
65eleq1d 2818 . . . . 5 (𝑥 = 𝐴 → ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝑦) ∈ 𝑆))
7 oveq2 7363 . . . . . 6 (𝑥 = 𝐴 → (𝑦 + 𝑥) = (𝑦 + 𝐴))
87eleq1d 2818 . . . . 5 (𝑥 = 𝐴 → ((𝑦 + 𝑥) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆))
96, 8bibi12d 345 . . . 4 (𝑥 = 𝐴 → (((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) ↔ ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆)))
10 oveq2 7363 . . . . . 6 (𝑦 = 𝐵 → (𝐴 + 𝑦) = (𝐴 + 𝐵))
1110eleq1d 2818 . . . . 5 (𝑦 = 𝐵 → ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝐵) ∈ 𝑆))
12 oveq1 7362 . . . . . 6 (𝑦 = 𝐵 → (𝑦 + 𝐴) = (𝐵 + 𝐴))
1312eleq1d 2818 . . . . 5 (𝑦 = 𝐵 → ((𝑦 + 𝐴) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))
1411, 13bibi12d 345 . . . 4 (𝑦 = 𝐵 → (((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆) ↔ ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)))
159, 14rspc2v 3584 . . 3 ((𝐴𝑋𝐵𝑋) → (∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)))
164, 15syl5com 31 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝐴𝑋𝐵𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)))
17163impib 1116 1 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3048  cfv 6489  (class class class)co 7355  Basecbs 17127  +gcplusg 17168  SubGrpcsubg 19041  NrmSGrpcnsg 19042
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374
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 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fv 6497  df-ov 7358  df-subg 19044  df-nsg 19045
This theorem is referenced by:  nsgconj  19079  eqgcpbl  19102
  Copyright terms: Public domain W3C validator