ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isnsg GIF version

Theorem isnsg 14007
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 13976 . . 3 NrmSGrp = (𝑔 ∈ Grp ↦ {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)})
21mptrcl 5788 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
3 subgrcl 13984 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
43adantr 276 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) → 𝐺 ∈ Grp)
5 fveq2 5695 . . . . . 6 (𝑔 = 𝐺 → (SubGrp‘𝑔) = (SubGrp‘𝐺))
6 basfn 13413 . . . . . . . . . 10 Base Fn V
7 funfvex 5712 . . . . . . . . . . 11 ((Fun Base ∧ 𝑔 ∈ dom Base) → (Base‘𝑔) ∈ V)
87funfni 5483 . . . . . . . . . 10 ((Base Fn V ∧ 𝑔 ∈ V) → (Base‘𝑔) ∈ V)
96, 8mpan 428 . . . . . . . . 9 (𝑔 ∈ V → (Base‘𝑔) ∈ V)
109elv 2825 . . . . . . . 8 (Base‘𝑔) ∈ V
1110a1i 9 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) ∈ V)
12 fveq2 5695 . . . . . . . 8 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
13 isnsg.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
1412, 13eqtr4di 2289 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
15 plusgslid 13468 . . . . . . . . . . 11 (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
1615slotex 13381 . . . . . . . . . 10 (𝑔 ∈ V → (+g𝑔) ∈ V)
1716elv 2825 . . . . . . . . 9 (+g𝑔) ∈ V
1817a1i 9 . . . . . . . 8 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) ∈ V)
19 simpl 109 . . . . . . . . . 10 ((𝑔 = 𝐺𝑏 = 𝑋) → 𝑔 = 𝐺)
2019fveq2d 5699 . . . . . . . . 9 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) = (+g𝐺))
21 isnsg.2 . . . . . . . . 9 + = (+g𝐺)
2220, 21eqtr4di 2289 . . . . . . . 8 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) = + )
23 simplr 533 . . . . . . . . 9 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑏 = 𝑋)
24 simpr 110 . . . . . . . . . . . . 13 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑝 = + )
2524oveqd 6102 . . . . . . . . . . . 12 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑥𝑝𝑦) = (𝑥 + 𝑦))
2625eleq1d 2307 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑠))
2724oveqd 6102 . . . . . . . . . . . 12 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑦𝑝𝑥) = (𝑦 + 𝑥))
2827eleq1d 2307 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑦𝑝𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠))
2926, 28bibi12d 235 . . . . . . . . . 10 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3023, 29raleqbidv 2765 . . . . . . . . 9 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3123, 30raleqbidv 2765 . . . . . . . 8 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3218, 22, 31sbcied2 3089 . . . . . . 7 ((𝑔 = 𝐺𝑏 = 𝑋) → ([(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3311, 14, 32sbcied2 3089 . . . . . 6 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
345, 33rabeqbidv 2816 . . . . 5 (𝑔 = 𝐺 → {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)} = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
35 id 19 . . . . 5 (𝐺 ∈ Grp → 𝐺 ∈ Grp)
36 subgex 13981 . . . . . 6 (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ V)
37 rabexg 4279 . . . . . 6 ((SubGrp‘𝐺) ∈ V → {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ∈ V)
3836, 37syl 14 . . . . 5 (𝐺 ∈ Grp → {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ∈ V)
391, 34, 35, 38fvmptd3 5799 . . . 4 (𝐺 ∈ Grp → (NrmSGrp‘𝐺) = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
4039eleq2d 2308 . . 3 (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ 𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)}))
41 eleq2 2302 . . . . . 6 (𝑠 = 𝑆 → ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑆))
42 eleq2 2302 . . . . . 6 (𝑠 = 𝑆 → ((𝑦 + 𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑆))
4341, 42bibi12d 235 . . . . 5 (𝑠 = 𝑆 → (((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
44432ralbidv 2574 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
4544elrab 2982 . . 3 (𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
4640, 45bitrdi 196 . 2 (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))))
472, 4, 46pm5.21nii 716 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wa 104  wb 105   = wceq 1402  wcel 2209  wral 2528  {crab 2532  Vcvv 2821  [wsbc 3051   Fn wfn 5372  cfv 5377  (class class class)co 6085  Basecbs 13354  +gcplusg 13433  Grpcgrp 13807  SubGrpcsubg 13972  NrmSGrpcnsg 13973
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9306  df-2 9364  df-ndx 13357  df-slot 13358  df-base 13360  df-plusg 13446  df-subg 13975  df-nsg 13976
This theorem is used by:  isnsg2  14008  nsgbi  14009  nsgsubg  14010  isnsg4  14017  nmznsg  14018  ablnsg  14140
  Copyright terms: Public domain W3C validator