Theorem gastacl 17742

Description: The stabilizer subgroup in a group action. (Contributed by Mario Carneiro, 15-Jan-2015.)

Hypotheses

Ref	Expression
gasta.1	⊢ 𝑋 = (Base‘𝐺)
gasta.2	⊢ 𝐻 = {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴}

Assertion

Ref	Expression
gastacl	⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ∈ (SubGrp‘𝐺))

Distinct variable groups:   𝑢, ⊕   𝑢,𝐴   𝑢,𝐺   𝑢,𝑋

Allowed substitution hints:   𝐻(𝑢)   𝑌(𝑢)

Proof of Theorem gastacl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gasta.2	. . . 4 ⊢ 𝐻 = {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴}
2		ssrab2 3687	. . . 4 ⊢ {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴} ⊆ 𝑋
3	1, 2	eqsstri 3635	. . 3 ⊢ 𝐻 ⊆ 𝑋
4	3	a1i 11	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ⊆ 𝑋)
5		gagrp 17725	. . . . . 6 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
6	5	adantr 481	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐺 ∈ Grp)
7		gasta.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
8		eqid 2622	. . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺)
9	7, 8	grpidcl 17450	. . . . 5 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
10	6, 9	syl 17	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (0g‘𝐺) ∈ 𝑋)
11	8	gagrpid 17727	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐴) = 𝐴)
12		oveq1 6657	. . . . . 6 ⊢ (𝑢 = (0g‘𝐺) → (𝑢 ⊕ 𝐴) = ((0g‘𝐺) ⊕ 𝐴))
13	12	eqeq1d 2624	. . . . 5 ⊢ (𝑢 = (0g‘𝐺) → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ ((0g‘𝐺) ⊕ 𝐴) = 𝐴))
14	13, 1	elrab2 3366	. . . 4 ⊢ ((0g‘𝐺) ∈ 𝐻 ↔ ((0g‘𝐺) ∈ 𝑋 ∧ ((0g‘𝐺) ⊕ 𝐴) = 𝐴))
15	10, 11, 14	sylanbrc 698	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (0g‘𝐺) ∈ 𝐻)
16		ne0i 3921	. . 3 ⊢ ((0g‘𝐺) ∈ 𝐻 → 𝐻 ≠ ∅)
17	15, 16	syl 17	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ≠ ∅)
18		simpll 790	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
19	18, 5	syl 17	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝐺 ∈ Grp)
20		simpr 477	. . . . . . . . . . 11 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝑥 ∈ 𝐻)
21		oveq1 6657	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ⊕ 𝐴) = (𝑥 ⊕ 𝐴))
22	21	eqeq1d 2624	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ (𝑥 ⊕ 𝐴) = 𝐴))
23	22, 1	elrab2 3366	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐻 ↔ (𝑥 ∈ 𝑋 ∧ (𝑥 ⊕ 𝐴) = 𝐴))
24	20, 23	sylib 208	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (𝑥 ∈ 𝑋 ∧ (𝑥 ⊕ 𝐴) = 𝐴))
25	24	simpld 475	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝑥 ∈ 𝑋)
26	25	adantrr 753	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝑥 ∈ 𝑋)
27		simprr 796	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝑦 ∈ 𝐻)
28		oveq1 6657	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑦 → (𝑢 ⊕ 𝐴) = (𝑦 ⊕ 𝐴))
29	28	eqeq1d 2624	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑦 → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ (𝑦 ⊕ 𝐴) = 𝐴))
30	29, 1	elrab2 3366	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐻 ↔ (𝑦 ∈ 𝑋 ∧ (𝑦 ⊕ 𝐴) = 𝐴))
31	27, 30	sylib 208	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑦 ∈ 𝑋 ∧ (𝑦 ⊕ 𝐴) = 𝐴))
32	31	simpld 475	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝑦 ∈ 𝑋)
33		eqid 2622	. . . . . . . . 9 ⊢ (+g‘𝐺) = (+g‘𝐺)
34	7, 33	grpcl 17430	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑋)
35	19, 26, 32, 34	syl3anc 1326	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑋)
36		simplr 792	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝐴 ∈ 𝑌)
37	7, 33	gaass 17730	. . . . . . . . 9 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌)) → ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = (𝑥 ⊕ (𝑦 ⊕ 𝐴)))
38	18, 26, 32, 36, 37	syl13anc 1328	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = (𝑥 ⊕ (𝑦 ⊕ 𝐴)))
39	31	simprd 479	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑦 ⊕ 𝐴) = 𝐴)
40	39	oveq2d 6666	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥 ⊕ (𝑦 ⊕ 𝐴)) = (𝑥 ⊕ 𝐴))
41	24	simprd 479	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (𝑥 ⊕ 𝐴) = 𝐴)
42	41	adantrr 753	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥 ⊕ 𝐴) = 𝐴)
43	38, 40, 42	3eqtrd 2660	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = 𝐴)
44		oveq1 6657	. . . . . . . . 9 ⊢ (𝑢 = (𝑥(+g‘𝐺)𝑦) → (𝑢 ⊕ 𝐴) = ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴))
45	44	eqeq1d 2624	. . . . . . . 8 ⊢ (𝑢 = (𝑥(+g‘𝐺)𝑦) → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = 𝐴))
46	45, 1	elrab2 3366	. . . . . . 7 ⊢ ((𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ↔ ((𝑥(+g‘𝐺)𝑦) ∈ 𝑋 ∧ ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = 𝐴))
47	35, 43, 46	sylanbrc 698	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐻)
48	47	anassrs 680	. . . . 5 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) ∧ 𝑦 ∈ 𝐻) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐻)
49	48	ralrimiva 2966	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻)
50		simpll 790	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ⊕ ∈ (𝐺 GrpAct 𝑌))
51	50, 5	syl 17	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝐺 ∈ Grp)
52		eqid 2622	. . . . . . 7 ⊢ (invg‘𝐺) = (invg‘𝐺)
53	7, 52	grpinvcl 17467	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((invg‘𝐺)‘𝑥) ∈ 𝑋)
54	51, 25, 53	syl2anc 693	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ((invg‘𝐺)‘𝑥) ∈ 𝑋)
55		simplr 792	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝐴 ∈ 𝑌)
56	7, 52	gacan 17738	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌 ∧ 𝐴 ∈ 𝑌)) → ((𝑥 ⊕ 𝐴) = 𝐴 ↔ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
57	50, 25, 55, 55, 56	syl13anc 1328	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ((𝑥 ⊕ 𝐴) = 𝐴 ↔ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
58	41, 57	mpbid 222	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴)
59		oveq1 6657	. . . . . . 7 ⊢ (𝑢 = ((invg‘𝐺)‘𝑥) → (𝑢 ⊕ 𝐴) = (((invg‘𝐺)‘𝑥) ⊕ 𝐴))
60	59	eqeq1d 2624	. . . . . 6 ⊢ (𝑢 = ((invg‘𝐺)‘𝑥) → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
61	60, 1	elrab2 3366	. . . . 5 ⊢ (((invg‘𝐺)‘𝑥) ∈ 𝐻 ↔ (((invg‘𝐺)‘𝑥) ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
62	54, 58, 61	sylanbrc 698	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ((invg‘𝐺)‘𝑥) ∈ 𝐻)
63	49, 62	jca 554	. . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))
64	63	ralrimiva 2966	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ∀𝑥 ∈ 𝐻 (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))
65	7, 33, 52	issubg2 17609	. . 3 ⊢ (𝐺 ∈ Grp → (𝐻 ∈ (SubGrp‘𝐺) ↔ (𝐻 ⊆ 𝑋 ∧ 𝐻 ≠ ∅ ∧ ∀𝑥 ∈ 𝐻 (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))))
66	6, 65	syl 17	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (𝐻 ∈ (SubGrp‘𝐺) ↔ (𝐻 ⊆ 𝑋 ∧ 𝐻 ≠ ∅ ∧ ∀𝑥 ∈ 𝐻 (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))))
67	4, 17, 64, 66	mpbir3and 1245	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ∈ (SubGrp‘𝐺))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990   ≠ wne 2794  ∀wral 2912  {crab 2916   ⊆ wss 3574  ∅c0 3915  ‘cfv 5888  (class class class)co 6650  Basecbs 15857  +_gcplusg 15941  0_gc0g 16100  Grpcgrp 17422  inv_gcminusg 17423  SubGrpcsubg 17588   GrpAct cga 17722

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-er 7742  df-map 7859  df-en 7956  df-dom 7957  df-sdom 7958  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-nn 11021  df-2 11079  df-ndx 15860  df-slot 15861  df-base 15863  df-sets 15864  df-ress 15865  df-plusg 15954  df-0g 16102  df-mgm 17242  df-sgrp 17284  df-mnd 17295  df-grp 17425  df-minusg 17426  df-subg 17591  df-ga 17723

This theorem is referenced by:  gastacos  17743  orbstafun  17744  orbstaval  17745  orbsta  17746  orbsta2  17747  sylow1lem5  18017