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

Theorem isnsg 13272
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 13241 . . 3 NrmSGrp = (𝑔 ∈ Grp ↦ {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)})
21mptrcl 5640 . 2 (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
3 subgrcl 13249 . . 3 (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
43adantr 276 . 2 ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) → 𝐺 ∈ Grp)
5 fveq2 5554 . . . . . 6 (𝑔 = 𝐺 → (SubGrp‘𝑔) = (SubGrp‘𝐺))
6 basfn 12676 . . . . . . . . . 10 Base Fn V
7 funfvex 5571 . . . . . . . . . . 11 ((Fun Base ∧ 𝑔 ∈ dom Base) → (Base‘𝑔) ∈ V)
87funfni 5354 . . . . . . . . . 10 ((Base Fn V ∧ 𝑔 ∈ V) → (Base‘𝑔) ∈ V)
96, 8mpan 424 . . . . . . . . 9 (𝑔 ∈ V → (Base‘𝑔) ∈ V)
109elv 2764 . . . . . . . 8 (Base‘𝑔) ∈ V
1110a1i 9 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) ∈ V)
12 fveq2 5554 . . . . . . . 8 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
13 isnsg.1 . . . . . . . 8 𝑋 = (Base‘𝐺)
1412, 13eqtr4di 2244 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
15 plusgslid 12730 . . . . . . . . . . 11 (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
1615slotex 12645 . . . . . . . . . 10 (𝑔 ∈ V → (+g𝑔) ∈ V)
1716elv 2764 . . . . . . . . 9 (+g𝑔) ∈ V
1817a1i 9 . . . . . . . 8 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) ∈ V)
19 simpl 109 . . . . . . . . . 10 ((𝑔 = 𝐺𝑏 = 𝑋) → 𝑔 = 𝐺)
2019fveq2d 5558 . . . . . . . . 9 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) = (+g𝐺))
21 isnsg.2 . . . . . . . . 9 + = (+g𝐺)
2220, 21eqtr4di 2244 . . . . . . . 8 ((𝑔 = 𝐺𝑏 = 𝑋) → (+g𝑔) = + )
23 simplr 528 . . . . . . . . 9 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑏 = 𝑋)
24 simpr 110 . . . . . . . . . . . . 13 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑝 = + )
2524oveqd 5935 . . . . . . . . . . . 12 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑥𝑝𝑦) = (𝑥 + 𝑦))
2625eleq1d 2262 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑠))
2724oveqd 5935 . . . . . . . . . . . 12 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑦𝑝𝑥) = (𝑦 + 𝑥))
2827eleq1d 2262 . . . . . . . . . . 11 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑦𝑝𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠))
2926, 28bibi12d 235 . . . . . . . . . 10 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3023, 29raleqbidv 2706 . . . . . . . . 9 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3123, 30raleqbidv 2706 . . . . . . . 8 (((𝑔 = 𝐺𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3218, 22, 31sbcied2 3023 . . . . . . 7 ((𝑔 = 𝐺𝑏 = 𝑋) → ([(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
3311, 14, 32sbcied2 3023 . . . . . 6 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
345, 33rabeqbidv 2755 . . . . 5 (𝑔 = 𝐺 → {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑥𝑏𝑦𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)} = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
35 id 19 . . . . 5 (𝐺 ∈ Grp → 𝐺 ∈ Grp)
36 subgex 13246 . . . . . 6 (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ V)
37 rabexg 4172 . . . . . 6 ((SubGrp‘𝐺) ∈ V → {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ∈ V)
3836, 37syl 14 . . . . 5 (𝐺 ∈ Grp → {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ∈ V)
391, 34, 35, 38fvmptd3 5651 . . . 4 (𝐺 ∈ Grp → (NrmSGrp‘𝐺) = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
4039eleq2d 2263 . . 3 (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ 𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)}))
41 eleq2 2257 . . . . . 6 (𝑠 = 𝑆 → ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑆))
42 eleq2 2257 . . . . . 6 (𝑠 = 𝑆 → ((𝑦 + 𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑆))
4341, 42bibi12d 235 . . . . 5 (𝑠 = 𝑆 → (((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
44432ralbidv 2518 . . . 4 (𝑠 = 𝑆 → (∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
4544elrab 2916 . . 3 (𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
4640, 45bitrdi 196 . 2 (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))))
472, 4, 46pm5.21nii 705 1 (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥𝑋𝑦𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1364  wcel 2164  wral 2472  {crab 2476  Vcvv 2760  [wsbc 2985   Fn wfn 5249  cfv 5254  (class class class)co 5918  Basecbs 12618  +gcplusg 12695  Grpcgrp 13072  SubGrpcsubg 13237  NrmSGrpcnsg 13238
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262  df-ov 5921  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-plusg 12708  df-subg 13240  df-nsg 13241
This theorem is referenced by:  isnsg2  13273  nsgbi  13274  nsgsubg  13275  isnsg4  13282  nmznsg  13283  ablnsg  13404
  Copyright terms: Public domain W3C validator