Theorem gastacl 17565

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 3650	. . . 4 ⊢ {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴} ⊆ 𝑋
3	1, 2	eqsstri 3598	. . 3 ⊢ 𝐻 ⊆ 𝑋
4	3	a1i 11	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ⊆ 𝑋)
5		gagrp 17548	. . . . . 6 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
6	5	adantr 480	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐺 ∈ Grp)
7		gasta.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
8		eqid 2610	. . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺)
9	7, 8	grpidcl 17273	. . . . 5 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
10	6, 9	syl 17	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (0g‘𝐺) ∈ 𝑋)
11	8	gagrpid 17550	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝐴) = 𝐴)
12		oveq1 6556	. . . . . 6 ⊢ (𝑢 = (0g‘𝐺) → (𝑢 ⊕ 𝐴) = ((0g‘𝐺) ⊕ 𝐴))
13	12	eqeq1d 2612	. . . . 5 ⊢ (𝑢 = (0g‘𝐺) → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ ((0g‘𝐺) ⊕ 𝐴) = 𝐴))
14	13, 1	elrab2 3333	. . . 4 ⊢ ((0g‘𝐺) ∈ 𝐻 ↔ ((0g‘𝐺) ∈ 𝑋 ∧ ((0g‘𝐺) ⊕ 𝐴) = 𝐴))
15	10, 11, 14	sylanbrc 695	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (0g‘𝐺) ∈ 𝐻)
16		ne0i 3880	. . 3 ⊢ ((0g‘𝐺) ∈ 𝐻 → 𝐻 ≠ ∅)
17	15, 16	syl 17	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ≠ ∅)
18		simpll 786	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → ⊕ ∈ (𝐺 GrpAct 𝑌))
19	18, 5	syl 17	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝐺 ∈ Grp)
20		simpr 476	. . . . . . . . . . 11 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝑥 ∈ 𝐻)
21		oveq1 6556	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑥 → (𝑢 ⊕ 𝐴) = (𝑥 ⊕ 𝐴))
22	21	eqeq1d 2612	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑥 → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ (𝑥 ⊕ 𝐴) = 𝐴))
23	22, 1	elrab2 3333	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐻 ↔ (𝑥 ∈ 𝑋 ∧ (𝑥 ⊕ 𝐴) = 𝐴))
24	20, 23	sylib 207	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (𝑥 ∈ 𝑋 ∧ (𝑥 ⊕ 𝐴) = 𝐴))
25	24	simpld 474	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝑥 ∈ 𝑋)
26	25	adantrr 749	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝑥 ∈ 𝑋)
27		simprr 792	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝑦 ∈ 𝐻)
28		oveq1 6556	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑦 → (𝑢 ⊕ 𝐴) = (𝑦 ⊕ 𝐴))
29	28	eqeq1d 2612	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑦 → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ (𝑦 ⊕ 𝐴) = 𝐴))
30	29, 1	elrab2 3333	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐻 ↔ (𝑦 ∈ 𝑋 ∧ (𝑦 ⊕ 𝐴) = 𝐴))
31	27, 30	sylib 207	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑦 ∈ 𝑋 ∧ (𝑦 ⊕ 𝐴) = 𝐴))
32	31	simpld 474	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝑦 ∈ 𝑋)
33		eqid 2610	. . . . . . . . 9 ⊢ (+g‘𝐺) = (+g‘𝐺)
34	7, 33	grpcl 17253	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑋)
35	19, 26, 32, 34	syl3anc 1318	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑋)
36		simplr 788	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → 𝐴 ∈ 𝑌)
37	7, 33	gaass 17553	. . . . . . . . 9 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌)) → ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = (𝑥 ⊕ (𝑦 ⊕ 𝐴)))
38	18, 26, 32, 36, 37	syl13anc 1320	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = (𝑥 ⊕ (𝑦 ⊕ 𝐴)))
39	31	simprd 478	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑦 ⊕ 𝐴) = 𝐴)
40	39	oveq2d 6565	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥 ⊕ (𝑦 ⊕ 𝐴)) = (𝑥 ⊕ 𝐴))
41	24	simprd 478	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (𝑥 ⊕ 𝐴) = 𝐴)
42	41	adantrr 749	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥 ⊕ 𝐴) = 𝐴)
43	38, 40, 42	3eqtrd 2648	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = 𝐴)
44		oveq1 6556	. . . . . . . . 9 ⊢ (𝑢 = (𝑥(+g‘𝐺)𝑦) → (𝑢 ⊕ 𝐴) = ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴))
45	44	eqeq1d 2612	. . . . . . . 8 ⊢ (𝑢 = (𝑥(+g‘𝐺)𝑦) → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = 𝐴))
46	45, 1	elrab2 3333	. . . . . . 7 ⊢ ((𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ↔ ((𝑥(+g‘𝐺)𝑦) ∈ 𝑋 ∧ ((𝑥(+g‘𝐺)𝑦) ⊕ 𝐴) = 𝐴))
47	35, 43, 46	sylanbrc 695	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑥 ∈ 𝐻 ∧ 𝑦 ∈ 𝐻)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐻)
48	47	anassrs 678	. . . . 5 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) ∧ 𝑦 ∈ 𝐻) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐻)
49	48	ralrimiva 2949	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻)
50		simpll 786	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ⊕ ∈ (𝐺 GrpAct 𝑌))
51	50, 5	syl 17	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝐺 ∈ Grp)
52		eqid 2610	. . . . . . 7 ⊢ (invg‘𝐺) = (invg‘𝐺)
53	7, 52	grpinvcl 17290	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((invg‘𝐺)‘𝑥) ∈ 𝑋)
54	51, 25, 53	syl2anc 691	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ((invg‘𝐺)‘𝑥) ∈ 𝑋)
55		simplr 788	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → 𝐴 ∈ 𝑌)
56	7, 52	gacan 17561	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌 ∧ 𝐴 ∈ 𝑌)) → ((𝑥 ⊕ 𝐴) = 𝐴 ↔ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
57	50, 25, 55, 55, 56	syl13anc 1320	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ((𝑥 ⊕ 𝐴) = 𝐴 ↔ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
58	41, 57	mpbid 221	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴)
59		oveq1 6556	. . . . . . 7 ⊢ (𝑢 = ((invg‘𝐺)‘𝑥) → (𝑢 ⊕ 𝐴) = (((invg‘𝐺)‘𝑥) ⊕ 𝐴))
60	59	eqeq1d 2612	. . . . . 6 ⊢ (𝑢 = ((invg‘𝐺)‘𝑥) → ((𝑢 ⊕ 𝐴) = 𝐴 ↔ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
61	60, 1	elrab2 3333	. . . . 5 ⊢ (((invg‘𝐺)‘𝑥) ∈ 𝐻 ↔ (((invg‘𝐺)‘𝑥) ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥) ⊕ 𝐴) = 𝐴))
62	54, 58, 61	sylanbrc 695	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → ((invg‘𝐺)‘𝑥) ∈ 𝐻)
63	49, 62	jca 553	. . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑥 ∈ 𝐻) → (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))
64	63	ralrimiva 2949	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ∀𝑥 ∈ 𝐻 (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))
65	7, 33, 52	issubg2 17432	. . 3 ⊢ (𝐺 ∈ Grp → (𝐻 ∈ (SubGrp‘𝐺) ↔ (𝐻 ⊆ 𝑋 ∧ 𝐻 ≠ ∅ ∧ ∀𝑥 ∈ 𝐻 (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))))
66	6, 65	syl 17	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (𝐻 ∈ (SubGrp‘𝐺) ↔ (𝐻 ⊆ 𝑋 ∧ 𝐻 ≠ ∅ ∧ ∀𝑥 ∈ 𝐻 (∀𝑦 ∈ 𝐻 (𝑥(+g‘𝐺)𝑦) ∈ 𝐻 ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐻))))
67	4, 17, 64, 66	mpbir3and 1238	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ∈ (SubGrp‘𝐺))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  {crab 2900   ⊆ wss 3540  ∅c0 3874  ‘cfv 5804  (class class class)co 6549  Basecbs 15695  +_gcplusg 15768  0_gc0g 15923  Grpcgrp 17245  inv_gcminusg 17246  SubGrpcsubg 17411   GrpAct cga 17545

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-ndx 15698  df-slot 15699  df-base 15700  df-sets 15701  df-ress 15702  df-plusg 15781  df-0g 15925  df-mgm 17065  df-sgrp 17107  df-mnd 17118  df-grp 17248  df-minusg 17249  df-subg 17414  df-ga 17546

This theorem is referenced by:  gastacos  17566  orbstafun  17567  orbstaval  17568  orbsta  17569  orbsta2  17570  sylow1lem5  17840