Theorem isnsg3 13413

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 13411	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺))
2		isnsg3.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
3		isnsg3.2	. . . . . 6 ⊢ + = (+g‘𝐺)
4		isnsg3.3	. . . . . 6 ⊢ − = (-g‘𝐺)
5	2, 3, 4	nsgconj 13412	. . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
6	5	3expb 1206	. . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
7	6	ralrimivva 2579	. . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
8	1, 7	jca 306	. 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆))
9		simpl 109	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → 𝑆 ∈ (SubGrp‘𝐺))
10		subgrcl 13385	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
11	10	ad2antrr 488	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝐺 ∈ Grp)
12		simprll 537	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑧 ∈ 𝑋)
13		eqid 2196	. . . . . . . . . . . 12 ⊢ (0g‘𝐺) = (0g‘𝐺)
14		eqid 2196	. . . . . . . . . . . 12 ⊢ (invg‘𝐺) = (invg‘𝐺)
15	2, 3, 13, 14	grplinv 13252	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
16	11, 12, 15	syl2anc 411	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + 𝑧) = (0g‘𝐺))
17	16	oveq1d 5940	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = ((0g‘𝐺) + 𝑤))
18	2, 14	grpinvcl 13250	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
19	11, 12, 18	syl2anc 411	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((invg‘𝐺)‘𝑧) ∈ 𝑋)
20		simprlr 538	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → 𝑤 ∈ 𝑋)
21	2, 3	grpass 13211	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ (((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
22	11, 19, 12, 20, 21	syl13anc 1251	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + 𝑧) + 𝑤) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
23	2, 3, 13	grplid 13233	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑤 ∈ 𝑋) → ((0g‘𝐺) + 𝑤) = 𝑤)
24	11, 20, 23	syl2anc 411	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((0g‘𝐺) + 𝑤) = 𝑤)
25	17, 22, 24	3eqtr3d 2237	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) = 𝑤)
26	25	oveq1d 5940	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 − ((invg‘𝐺)‘𝑧)))
27	2, 3, 4, 14, 11, 20, 12	grpsubinv 13275	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
28	26, 27	eqtrd 2229	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) = (𝑤 + 𝑧))
29		simprr 531	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑧 + 𝑤) ∈ 𝑆)
30		simplr 528	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆)
31		oveq1 5932	. . . . . . . . . 10 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → (𝑥 + 𝑦) = (((invg‘𝐺)‘𝑧) + 𝑦))
32		id 19	. . . . . . . . . 10 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → 𝑥 = ((invg‘𝐺)‘𝑧))
33	31, 32	oveq12d 5943	. . . . . . . . 9 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → ((𝑥 + 𝑦) − 𝑥) = ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)))
34	33	eleq1d 2265	. . . . . . . 8 ⊢ (𝑥 = ((invg‘𝐺)‘𝑧) → (((𝑥 + 𝑦) − 𝑥) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
35		oveq2 5933	. . . . . . . . . 10 ⊢ (𝑦 = (𝑧 + 𝑤) → (((invg‘𝐺)‘𝑧) + 𝑦) = (((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)))
36	35	oveq1d 5940	. . . . . . . . 9 ⊢ (𝑦 = (𝑧 + 𝑤) → ((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) = ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)))
37	36	eleq1d 2265	. . . . . . . 8 ⊢ (𝑦 = (𝑧 + 𝑤) → (((((invg‘𝐺)‘𝑧) + 𝑦) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆))
38	34, 37	rspc2va 2882	. . . . . . 7 ⊢ (((((invg‘𝐺)‘𝑧) ∈ 𝑋 ∧ (𝑧 + 𝑤) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
39	19, 29, 30, 38	syl21anc 1248	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → ((((invg‘𝐺)‘𝑧) + (𝑧 + 𝑤)) − ((invg‘𝐺)‘𝑧)) ∈ 𝑆)
40	28, 39	eqeltrrd 2274	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ ((𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) ∧ (𝑧 + 𝑤) ∈ 𝑆)) → (𝑤 + 𝑧) ∈ 𝑆)
41	40	expr 375	. . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
42	41	ralrimivva 2579	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ((𝑥 + 𝑦) − 𝑥) ∈ 𝑆) → ∀𝑧 ∈ 𝑋 ∀𝑤 ∈ 𝑋 ((𝑧 + 𝑤) ∈ 𝑆 → (𝑤 + 𝑧) ∈ 𝑆))
43	2, 3	isnsg2 13409	. . 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 1364   ∈ wcel 2167  ∀wral 2475  ‘cfv 5259  (class class class)co 5925  Basecbs 12703  +_gcplusg 12780  0_gc0g 12958  Grpcgrp 13202  inv_gcminusg 13203  -_gcsg 13204  SubGrpcsubg 13373  NrmSGrpcnsg 13374

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206  df-sbg 13207  df-subg 13376  df-nsg 13377

This theorem is referenced by:  0nsg  13420  nsgid  13421  ghmnsgima  13474  ghmnsgpreima  13475