Theorem isnsg3 14063

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 14061	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2		isnsg3.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
3		isnsg3.2	. . . . . 6 ⊢ + = (+g‘𝐺)
4		isnsg3.3	. . . . . 6 ⊢ − = (-g‘𝐺)
5	2, 3, 4	nsgconj 14062	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
6	5	3expb 1235	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
7	6	ralrimivva 2632	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
8	1, 7	jca 306	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))
9		simpl 109	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10		subgrcl 14035	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
11	10	ad2antrr 492	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12		simprll 543	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧 ∈ 𝑋)
13		eqid 2238	. . . . . . . . . . . 12 ⊢ (0g‘𝐺) = (0g‘𝐺)
14		eqid 2238	. . . . . . . . . . . 12 ⊢ (invg‘𝐺) = (invg‘𝐺)
15	2, 3, 13, 14	grplinv 13908	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
16	11, 12, 15	syl2anc 415	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
17	16	oveq1d 6100	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g‘𝐺) + 𝑤))
18	2, 14	grpinvcl 13906	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
19	11, 12, 18	syl2anc 415	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
20		simprlr 544	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤 ∈ 𝑋)
21	2, 3	grpass 13867	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ (((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
22	11, 19, 12, 20, 21	syl13anc 1280	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
23	2, 3, 13	grplid 13889	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑤 ∈ 𝑋) → ((0g‘𝐺) + 𝑤) = 𝑤)
24	11, 20, 23	syl2anc 415	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g‘𝐺) + 𝑤) = 𝑤)
25	17, 22, 24	3eqtr3d 2279	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
26	25	oveq1d 6100	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 − ((invg‘𝐺)‘𝑧)))
27	2, 3, 4, 14, 11, 20, 12	grpsubinv 13931	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
28	26, 27	eqtrd 2271	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
29		simprr 537	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30		simplr 533	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
31		oveq1 6092	. . . . . . . . . 10 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg‘𝐺)‘𝑧) + 𝑦))
32		id 19	. . . . . . . . . 10 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → 𝑥 = ((invg‘𝐺)‘𝑧))
33	31, 32	oveq12d 6103	. . . . . . . . 9 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → ((𝑥 + 𝑦) − 𝑥) = ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)))
34	33	eleq1d 2307	. . . . . . . 8 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → (((𝑥 + 𝑦) − 𝑥) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
35		oveq2 6093	. . . . . . . . . 10 ⊢ (𝑦 = (𝑧 + 𝑤) → (((invg‘𝐺)‘𝑧) + 𝑦) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
36	35	oveq1d 6100	. . . . . . . . 9 ⊢ (𝑦 = (𝑧 + 𝑤) → ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) = ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)))
37	36	eleq1d 2307	. . . . . . . 8 ⊢ (𝑦 = (𝑧 + 𝑤) → (((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
38	34, 37	rspc2va 2944	. . . . . . 7 ⊢ (((((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
39	19, 29, 30, 38	syl21anc 1277	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
40	28, 39	eqeltrrd 2316	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
41	40	expr 375	. . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
42	41	ralrimivva 2632	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
43	2, 3	isnsg2 14059	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆)))
44	9, 42, 43	sylanbrc 421	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → 𝑆 ∈ (NrmSGrp‘𝐺))
45	8, 44	impbii 126	1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +_gcplusg 13484  0_gc0g 13663  Grpcgrp 13858  inv_gcminusg 13859  -_gcsg 13860  SubGrpcsubg 14023  NrmSGrpcnsg 14024

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  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-iun 4014  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-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-plusg 13497  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-sbg 13863  df-subg 14026  df-nsg 14027

This theorem is used by:  0nsg  14070  nsgid  14071  ghmnsgima  14124  ghmnsgpreima  14125  cntrsubgnsg  14169