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

Theorem nsgbi 19200
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 19198 . . . 4 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
43simprbi 501 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))
5 oveq1 7405 . . . . . 6 (𝑥 = 𝐴 → (𝑥 + 𝑦) = (𝐴 + 𝑦))
65eleq1d 2849 . . . . 5 (𝑥 = 𝐴 → ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝑦) ∈ 𝑆))
7 oveq2 7406 . . . . . 6 (𝑥 = 𝐴 → (𝑦 + 𝑥) = (𝑦 + 𝐴))
87eleq1d 2849 . . . . 5 (𝑥 = 𝐴 → ((𝑦 + 𝑥) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆))
96, 8bibi12d 347 . . . 4 (𝑥 = 𝐴 → (((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) ↔ ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆)))
10 oveq2 7406 . . . . . 6 (𝑦 = 𝐵 → (𝐴 + 𝑦) = (𝐴 + 𝐵))
1110eleq1d 2849 . . . . 5 (𝑦 = 𝐵 → ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝐵) ∈ 𝑆))
12 oveq1 7405 . . . . . 6 (𝑦 = 𝐵 → (𝑦 + 𝐴) = (𝐵 + 𝐴))
1312eleq1d 2849 . . . . 5 (𝑦 = 𝐵 → ((𝑦 + 𝐴) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))
1411, 13bibi12d 347 . . . 4 (𝑦 = 𝐵 → (((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆) ↔ ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)))
159, 14rspc2v 3594 . . 3 ((𝐴𝑋𝐵𝑋) → (∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)))
164, 15syl5com 31 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝐴𝑋𝐵𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)))
17163impib 1130 1 ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴𝑋𝐵𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1099   = wceq 1562  wcel 2144  wral 3078  cfv 6523  (class class class)co 7398  Basecbs 17247  +gcplusg 17288  SubGrpcsubg 19164  NrmSGrpcnsg 19165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fv 6531  df-ov 7401  df-subg 19167  df-nsg 19168
This theorem is referenced by:  nsgconj  19202  eqgcpbl  19225
  Copyright terms: Public domain W3C validator