Theorem conjnmz 19191

Description: A subgroup is unchanged under conjugation by an element of its normalizer. (Contributed by Mario Carneiro, 18-Jan-2015.)

Hypotheses

Ref	Expression
conjghm.x	⊢ 𝑋 = (Base‘𝐺)
conjghm.p	⊢ + = (+g‘𝐺)
conjghm.m	⊢ − = (-g‘𝐺)
conjsubg.f	⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))
conjnmz.1	⊢ 𝑁 = {𝑦 ∈ 𝑋 ∣ ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)}

Assertion

Ref	Expression
conjnmz	⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝑆 = ran 𝐹)

Distinct variable groups:   𝑥,𝑦, −   𝑥,𝑧, + ,𝑦   𝑥,𝐴,𝑦,𝑧   𝑦,𝐹,𝑧   𝑥,𝑁   𝑥,𝐺,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧

Allowed substitution hints:   𝐹(𝑥)   − (𝑧)   𝑁(𝑦,𝑧)

Proof of Theorem conjnmz

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		conjghm.x	. . . . . . . . 9 ⊢ 𝑋 = (Base‘𝐺)
2		conjghm.p	. . . . . . . . 9 ⊢ + = (+g‘𝐺)
3		subgrcl 19070	. . . . . . . . . 10 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
4	3	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → 𝐺 ∈ Grp)
5		eqid 2730	. . . . . . . . . 10 ⊢ (invg‘𝐺) = (invg‘𝐺)
6		conjnmz.1	. . . . . . . . . . . 12 ⊢ 𝑁 = {𝑦 ∈ 𝑋 ∣ ∀𝑧 ∈ 𝑋 ((𝑦 + 𝑧) ∈ 𝑆 ↔ (𝑧 + 𝑦) ∈ 𝑆)}
7	6	ssrab3 4048	. . . . . . . . . . 11 ⊢ 𝑁 ⊆ 𝑋
8		simplr 768	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → 𝐴 ∈ 𝑁)
9	7, 8	sselid 3947	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → 𝐴 ∈ 𝑋)
10	1, 5, 4, 9	grpinvcld 18927	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((invg‘𝐺)‘𝐴) ∈ 𝑋)
11	1	subgss 19066	. . . . . . . . . . 11 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ 𝑋)
12	11	adantr 480	. . . . . . . . . 10 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝑆 ⊆ 𝑋)
13	12	sselda 3949	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → 𝑤 ∈ 𝑋)
14	1, 2, 4, 10, 13, 9	grpassd 18884	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((((invg‘𝐺)‘𝐴) + 𝑤) + 𝐴) = (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴)))
15		eqid 2730	. . . . . . . . . . . . 13 ⊢ (0g‘𝐺) = (0g‘𝐺)
16	1, 2, 15, 5, 4, 9	grprinvd 18934	. . . . . . . . . . . 12 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝐴 + ((invg‘𝐺)‘𝐴)) = (0g‘𝐺))
17	16	oveq1d 7405	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((𝐴 + ((invg‘𝐺)‘𝐴)) + 𝑤) = ((0g‘𝐺) + 𝑤))
18	1, 2, 4, 9, 10, 13	grpassd 18884	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((𝐴 + ((invg‘𝐺)‘𝐴)) + 𝑤) = (𝐴 + (((invg‘𝐺)‘𝐴) + 𝑤)))
19	1, 2, 15, 4, 13	grplidd 18908	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((0g‘𝐺) + 𝑤) = 𝑤)
20	17, 18, 19	3eqtr3d 2773	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝐴 + (((invg‘𝐺)‘𝐴) + 𝑤)) = 𝑤)
21		simpr 484	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → 𝑤 ∈ 𝑆)
22	20, 21	eqeltrd 2829	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝐴 + (((invg‘𝐺)‘𝐴) + 𝑤)) ∈ 𝑆)
23	1, 2, 4, 10, 13	grpcld 18886	. . . . . . . . . 10 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (((invg‘𝐺)‘𝐴) + 𝑤) ∈ 𝑋)
24	6	nmzbi 19103	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑁 ∧ (((invg‘𝐺)‘𝐴) + 𝑤) ∈ 𝑋) → ((𝐴 + (((invg‘𝐺)‘𝐴) + 𝑤)) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝐴) + 𝑤) + 𝐴) ∈ 𝑆))
25	8, 23, 24	syl2anc 584	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((𝐴 + (((invg‘𝐺)‘𝐴) + 𝑤)) ∈ 𝑆 ↔ ((((invg‘𝐺)‘𝐴) + 𝑤) + 𝐴) ∈ 𝑆))
26	22, 25	mpbid 232	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((((invg‘𝐺)‘𝐴) + 𝑤) + 𝐴) ∈ 𝑆)
27	14, 26	eqeltrrd 2830	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴)) ∈ 𝑆)
28		oveq2 7398	. . . . . . . . 9 ⊢ (𝑥 = (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴)) → (𝐴 + 𝑥) = (𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))))
29	28	oveq1d 7405	. . . . . . . 8 ⊢ (𝑥 = (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴)) → ((𝐴 + 𝑥) − 𝐴) = ((𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) − 𝐴))
30		conjsubg.f	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝑆 ↦ ((𝐴 + 𝑥) − 𝐴))
31		ovex 7423	. . . . . . . 8 ⊢ ((𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) − 𝐴) ∈ V
32	29, 30, 31	fvmpt 6971	. . . . . . 7 ⊢ ((((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴)) ∈ 𝑆 → (𝐹‘(((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) = ((𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) − 𝐴))
33	27, 32	syl 17	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝐹‘(((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) = ((𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) − 𝐴))
34	16	oveq1d 7405	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((𝐴 + ((invg‘𝐺)‘𝐴)) + (𝑤 + 𝐴)) = ((0g‘𝐺) + (𝑤 + 𝐴)))
35	1, 2, 4, 13, 9	grpcld 18886	. . . . . . . . 9 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝑤 + 𝐴) ∈ 𝑋)
36	1, 2, 4, 9, 10, 35	grpassd 18884	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((𝐴 + ((invg‘𝐺)‘𝐴)) + (𝑤 + 𝐴)) = (𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))))
37	1, 2, 15, 4, 35	grplidd 18908	. . . . . . . 8 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((0g‘𝐺) + (𝑤 + 𝐴)) = (𝑤 + 𝐴))
38	34, 36, 37	3eqtr3d 2773	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) = (𝑤 + 𝐴))
39	38	oveq1d 7405	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((𝐴 + (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) − 𝐴) = ((𝑤 + 𝐴) − 𝐴))
40		conjghm.m	. . . . . . . 8 ⊢ − = (-g‘𝐺)
41	1, 2, 40	grppncan 18970	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑤 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝑤 + 𝐴) − 𝐴) = 𝑤)
42	4, 13, 9, 41	syl3anc 1373	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → ((𝑤 + 𝐴) − 𝐴) = 𝑤)
43	33, 39, 42	3eqtrd 2769	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝐹‘(((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) = 𝑤)
44		ovex 7423	. . . . . . 7 ⊢ ((𝐴 + 𝑥) − 𝐴) ∈ V
45	44, 30	fnmpti 6664	. . . . . 6 ⊢ 𝐹 Fn 𝑆
46		fnfvelrn 7055	. . . . . 6 ⊢ ((𝐹 Fn 𝑆 ∧ (((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴)) ∈ 𝑆) → (𝐹‘(((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) ∈ ran 𝐹)
47	45, 27, 46	sylancr 587	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → (𝐹‘(((invg‘𝐺)‘𝐴) + (𝑤 + 𝐴))) ∈ ran 𝐹)
48	43, 47	eqeltrrd 2830	. . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑤 ∈ 𝑆) → 𝑤 ∈ ran 𝐹)
49	48	ex 412	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → (𝑤 ∈ 𝑆 → 𝑤 ∈ ran 𝐹))
50	49	ssrdv 3955	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝑆 ⊆ ran 𝐹)
51	3	ad2antrr 726	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → 𝐺 ∈ Grp)
52		simplr 768	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ 𝑁)
53	7, 52	sselid 3947	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ 𝑋)
54	12	sselda 3949	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑋)
55	1, 2, 40	grpaddsubass 18969	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝐴 + 𝑥) − 𝐴) = (𝐴 + (𝑥 − 𝐴)))
56	51, 53, 54, 53, 55	syl13anc 1374	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → ((𝐴 + 𝑥) − 𝐴) = (𝐴 + (𝑥 − 𝐴)))
57	1, 2, 40	grpnpcan 18971	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝑥 − 𝐴) + 𝐴) = 𝑥)
58	51, 54, 53, 57	syl3anc 1373	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → ((𝑥 − 𝐴) + 𝐴) = 𝑥)
59		simpr 484	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ 𝑆)
60	58, 59	eqeltrd 2829	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → ((𝑥 − 𝐴) + 𝐴) ∈ 𝑆)
61	1, 40	grpsubcl 18959	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑥 − 𝐴) ∈ 𝑋)
62	51, 54, 53, 61	syl3anc 1373	. . . . . . 7 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → (𝑥 − 𝐴) ∈ 𝑋)
63	6	nmzbi 19103	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑁 ∧ (𝑥 − 𝐴) ∈ 𝑋) → ((𝐴 + (𝑥 − 𝐴)) ∈ 𝑆 ↔ ((𝑥 − 𝐴) + 𝐴) ∈ 𝑆))
64	52, 62, 63	syl2anc 584	. . . . . 6 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → ((𝐴 + (𝑥 − 𝐴)) ∈ 𝑆 ↔ ((𝑥 − 𝐴) + 𝐴) ∈ 𝑆))
65	60, 64	mpbird 257	. . . . 5 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → (𝐴 + (𝑥 − 𝐴)) ∈ 𝑆)
66	56, 65	eqeltrd 2829	. . . 4 ⊢ (((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) ∧ 𝑥 ∈ 𝑆) → ((𝐴 + 𝑥) − 𝐴) ∈ 𝑆)
67	66, 30	fmptd 7089	. . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝐹:𝑆⟶𝑆)
68	67	frnd 6699	. 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → ran 𝐹 ⊆ 𝑆)
69	50, 68	eqssd 3967	1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝐴 ∈ 𝑁) → 𝑆 = ran 𝐹)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3045  {crab 3408   ⊆ wss 3917   ↦ cmpt 5191  ran crn 5642   Fn wfn 6509  ‘cfv 6514  (class class class)co 7390  Basecbs 17186  +_gcplusg 17227  0_gc0g 17409  Grpcgrp 18872  inv_gcminusg 18873  -_gcsg 18874  SubGrpcsubg 19059

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972  df-0g 17411  df-mgm 18574  df-sgrp 18653  df-mnd 18669  df-grp 18875  df-minusg 18876  df-sbg 18877  df-subg 19062

This theorem is referenced by:  conjnmzb  19192  conjnsg  19193  sylow3lem2  19565