Theorem isnsg 19195

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.

Step	Hyp	Ref	Expression
1		df-nsg 19164	. . 3 ⊢ NrmSGrp = (𝑔 ∈ Grp ↦ {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g‘𝑔) / 𝑝]∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)})
2	1	mptrcl 7038	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp)
3		subgrcl 19171	. . 3 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
4	3	adantr 480	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) → 𝐺 ∈ Grp)
5		fveq2 6920	. . . . . 6 ⊢ (𝑔 = 𝐺 → (SubGrp‘𝑔) = (SubGrp‘𝐺))
6		fvexd 6935	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) ∈ V)
7		fveq2 6920	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
8		isnsg.1	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
9	7, 8	eqtr4di 2798	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
10		fvexd 6935	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) → (+g‘𝑔) ∈ V)
11		simpl 482	. . . . . . . . . 10 ⊢ ((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) → 𝑔 = 𝐺)
12	11	fveq2d 6924	. . . . . . . . 9 ⊢ ((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) → (+g‘𝑔) = (+g‘𝐺))
13		isnsg.2	. . . . . . . . 9 ⊢ + = (+g‘𝐺)
14	12, 13	eqtr4di 2798	. . . . . . . 8 ⊢ ((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) → (+g‘𝑔) = + )
15		simplr 768	. . . . . . . . 9 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑏 = 𝑋)
16		simpr 484	. . . . . . . . . . . . 13 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → 𝑝 = + )
17	16	oveqd 7465	. . . . . . . . . . . 12 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑥𝑝𝑦) = (𝑥 + 𝑦))
18	17	eleq1d 2829	. . . . . . . . . . 11 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑠))
19	16	oveqd 7465	. . . . . . . . . . . 12 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → (𝑦𝑝𝑥) = (𝑦 + 𝑥))
20	19	eleq1d 2829	. . . . . . . . . . 11 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → ((𝑦𝑝𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠))
21	18, 20	bibi12d 345	. . . . . . . . . 10 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → (((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
22	15, 21	raleqbidv 3354	. . . . . . . . 9 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑦 ∈ 𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
23	15, 22	raleqbidv 3354	. . . . . . . 8 ⊢ (((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) ∧ 𝑝 = + ) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
24	10, 14, 23	sbcied2 3852	. . . . . . 7 ⊢ ((𝑔 = 𝐺 ∧ 𝑏 = 𝑋) → ([(+g‘𝑔) / 𝑝]∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
25	6, 9, 24	sbcied2 3852	. . . . . 6 ⊢ (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑏][(+g‘𝑔) / 𝑝]∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)))
26	5, 25	rabeqbidv 3462	. . . . 5 ⊢ (𝑔 = 𝐺 → {𝑠 ∈ (SubGrp‘𝑔) ∣ [(Base‘𝑔) / 𝑏][(+g‘𝑔) / 𝑝]∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ((𝑥𝑝𝑦) ∈ 𝑠 ↔ (𝑦𝑝𝑥) ∈ 𝑠)} = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
27		fvex 6933	. . . . . 6 ⊢ (SubGrp‘𝐺) ∈ V
28	27	rabex 5357	. . . . 5 ⊢ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ∈ V
29	26, 1, 28	fvmpt 7029	. . . 4 ⊢ (𝐺 ∈ Grp → (NrmSGrp‘𝐺) = {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)})
30	29	eleq2d 2830	. . 3 ⊢ (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ 𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)}))
31		eleq2 2833	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑥 + 𝑦) ∈ 𝑆))
32		eleq2 2833	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((𝑦 + 𝑥) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑆))
33	31, 32	bibi12d 345	. . . . 5 ⊢ (𝑠 = 𝑆 → (((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
34	33	2ralbidv 3227	. . . 4 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
35	34	elrab 3708	. . 3 ⊢ (𝑆 ∈ {𝑠 ∈ (SubGrp‘𝐺) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑠 ↔ (𝑦 + 𝑥) ∈ 𝑠)} ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))
36	30, 35	bitrdi 287	. 2 ⊢ (𝐺 ∈ Grp → (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))))
37	2, 4, 36	pm5.21nii 378	1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067  {crab 3443  Vcvv 3488  [wsbc 3804  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  +_gcplusg 17311  Grpcgrp 18973  SubGrpcsubg 19160  NrmSGrpcnsg 19161

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fv 6581  df-ov 7451  df-subg 19163  df-nsg 19164

This theorem is referenced by:  isnsg2  19196  nsgbi  19197  nsgsubg  19198  isnsg4  19207  nmznsg  19208  ablnsg  19889  rzgrp  21664