Theorem isnsg3 13485

Description: A subgroup is normal iff the conjugation of all the elements of the subgroup is in the subgroup. (Contributed by Mario Carneiro, 18-Jan-2015.)

Hypotheses

Ref	Expression
isnsg3.1	⊢ 𝑋 = (Base‘𝐺)
isnsg3.2	⊢ + = (+g‘𝐺)
isnsg3.3	⊢ − = (-g‘𝐺)

Assertion

Ref	Expression
isnsg3	⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))

Distinct variable groups:   𝑥,𝑦, −   𝑥,𝐺,𝑦   𝑥, + ,𝑦   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦

Proof of Theorem isnsg3

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nsgsubg 13483	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2		isnsg3.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
3		isnsg3.2	. . . . . 6 ⊢ + = (+g‘𝐺)
4		isnsg3.3	. . . . . 6 ⊢ − = (-g‘𝐺)
5	2, 3, 4	nsgconj 13484	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
6	5	3expb 1206	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
7	6	ralrimivva 2587	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
8	1, 7	jca 306	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))
9		simpl 109	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10		subgrcl 13457	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
11	10	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12		simprll 537	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧 ∈ 𝑋)
13		eqid 2204	. . . . . . . . . . . 12 ⊢ (0g‘𝐺) = (0g‘𝐺)
14		eqid 2204	. . . . . . . . . . . 12 ⊢ (invg‘𝐺) = (invg‘𝐺)
15	2, 3, 13, 14	grplinv 13324	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
16	11, 12, 15	syl2anc 411	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
17	16	oveq1d 5958	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g‘𝐺) + 𝑤))
18	2, 14	grpinvcl 13322	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
19	11, 12, 18	syl2anc 411	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
20		simprlr 538	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤 ∈ 𝑋)
21	2, 3	grpass 13283	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ (((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
22	11, 19, 12, 20, 21	syl13anc 1251	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
23	2, 3, 13	grplid 13305	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑤 ∈ 𝑋) → ((0g‘𝐺) + 𝑤) = 𝑤)
24	11, 20, 23	syl2anc 411	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g‘𝐺) + 𝑤) = 𝑤)
25	17, 22, 24	3eqtr3d 2245	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
26	25	oveq1d 5958	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 − ((invg‘𝐺)‘𝑧)))
27	2, 3, 4, 14, 11, 20, 12	grpsubinv 13347	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
28	26, 27	eqtrd 2237	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
29		simprr 531	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30		simplr 528	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
31		oveq1 5950	. . . . . . . . . 10 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg‘𝐺)‘𝑧) + 𝑦))
32		id 19	. . . . . . . . . 10 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → 𝑥 = ((invg‘𝐺)‘𝑧))
33	31, 32	oveq12d 5961	. . . . . . . . 9 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → ((𝑥 + 𝑦) − 𝑥) = ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)))
34	33	eleq1d 2273	. . . . . . . 8 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → (((𝑥 + 𝑦) − 𝑥) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
35		oveq2 5951	. . . . . . . . . 10 ⊢ (𝑦 = (𝑧 + 𝑤) → (((invg‘𝐺)‘𝑧) + 𝑦) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
36	35	oveq1d 5958	. . . . . . . . 9 ⊢ (𝑦 = (𝑧 + 𝑤) → ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) = ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)))
37	36	eleq1d 2273	. . . . . . . 8 ⊢ (𝑦 = (𝑧 + 𝑤) → (((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
38	34, 37	rspc2va 2890	. . . . . . 7 ⊢ (((((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
39	19, 29, 30, 38	syl21anc 1248	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
40	28, 39	eqeltrrd 2282	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
41	40	expr 375	. . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
42	41	ralrimivva 2587	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
43	2, 3	isnsg2 13481	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆)))
44	9, 42, 43	sylanbrc 417	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → 𝑆 ∈ (NrmSGrp‘𝐺))
45	8, 44	impbii 126	1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1372   ∈ wcel 2175  ∀wral 2483  ‘cfv 5270  (class class class)co 5943  Basecbs 12774  +_gcplusg 12851  0_gc0g 13030  Grpcgrp 13274  inv_gcminusg 13275  -_gcsg 13276  SubGrpcsubg 13445  NrmSGrpcnsg 13446

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-in1 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-cnex 8015  ax-resscn 8016  ax-1re 8018  ax-addrcl 8021

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rmo 2491  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-inn 9036  df-2 9094  df-ndx 12777  df-slot 12778  df-base 12780  df-plusg 12864  df-0g 13032  df-mgm 13130  df-sgrp 13176  df-mnd 13191  df-grp 13277  df-minusg 13278  df-sbg 13279  df-subg 13448  df-nsg 13449

This theorem is referenced by:  0nsg  13492  nsgid  13493  ghmnsgima  13546  ghmnsgpreima  13547