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

Theorem nsgbi 19065
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 19063 . . . 4 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
43simprbi 496 . . 3 (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))
5 oveq1 7376 . . . . . 6 (𝑥 = 𝐴 → (𝑥 + 𝑦) = (𝐴 + 𝑦))
65eleq1d 2813 . . . . 5 (𝑥 = 𝐴 → ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝑦) ∈ 𝑆))
7 oveq2 7377 . . . . . 6 (𝑥 = 𝐴 → (𝑦 + 𝑥) = (𝑦 + 𝐴))
87eleq1d 2813 . . . . 5 (𝑥 = 𝐴 → ((𝑦 + 𝑥) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆))
96, 8bibi12d 345 . . . 4 (𝑥 = 𝐴 → (((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) ↔ ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆)))
10 oveq2 7377 . . . . . 6 (𝑦 = 𝐵 → (𝐴 + 𝑦) = (𝐴 + 𝐵))
1110eleq1d 2813 . . . . 5 (𝑦 = 𝐵 → ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝐵) ∈ 𝑆))
12 oveq1 7376 . . . . . 6 (𝑦 = 𝐵 → (𝑦 + 𝐴) = (𝐵 + 𝐴))
1312eleq1d 2813 . . . . 5 (𝑦 = 𝐵 → ((𝑦 + 𝐴) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))
1411, 13bibi12d 345 . . . 4 (𝑦 = 𝐵 → (((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆) ↔ ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)))
159, 14rspc2v 3596 . . 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 1540  wcel 2109  wral 3044  cfv 6499  (class class class)co 7369  Basecbs 17155  +gcplusg 17196  SubGrpcsubg 19028  NrmSGrpcnsg 19029
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5103  df-opab 5165  df-mpt 5184  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 6452  df-fun 6501  df-fv 6507  df-ov 7372  df-subg 19031  df-nsg 19032
This theorem is referenced by:  nsgconj  19067  eqgcpbl  19090
  Copyright terms: Public domain W3C validator