Theorem fxpsubm 33313

Description: Provided the group action 𝐴 induces monoid automorphisms, the set of fixed points of 𝐴 on a monoid 𝑊 is a submonoid, which could be called the fixed submonoid under 𝐴. (Contributed by Thierry Arnoux, 18-Nov-2025.)

Hypotheses

Ref	Expression
fxpsubm.b	⊢ 𝐵 = (Base‘𝐺)
fxpsubm.c	⊢ 𝐶 = (Base‘𝑊)
fxpsubm.f	⊢ 𝐹 = (𝑥 ∈ 𝐶 ↦ (𝑝𝐴𝑥))
fxpsubm.a	⊢ (𝜑 → 𝐴 ∈ (𝐺 GrpAct 𝐶))
fxpsubm.1	⊢ ((𝜑 ∧ 𝑝 ∈ 𝐵) → 𝐹 ∈ (𝑊 MndHom 𝑊))

Assertion

Ref	Expression
fxpsubm	⊢ (𝜑 → (𝐶FixPts𝐴) ∈ (SubMnd‘𝑊))

Distinct variable groups:   𝐴,𝑝,𝑥   𝐵,𝑝,𝑥   𝐶,𝑝,𝑥   𝐺,𝑝,𝑥   𝑊,𝑝,𝑥   𝜑,𝑝,𝑥

Allowed substitution hints:   𝐹(𝑥,𝑝)

Proof of Theorem fxpsubm

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

Step	Hyp	Ref	Expression
1		fxpsubm.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐶 ↦ (𝑝𝐴𝑥))
2		oveq1 7399	. . . . . . 7 ⊢ (𝑝 = (0g‘𝐺) → (𝑝𝐴𝑥) = ((0g‘𝐺)𝐴𝑥))
3	2	mpteq2dv 5193	. . . . . 6 ⊢ (𝑝 = (0g‘𝐺) → (𝑥 ∈ 𝐶 ↦ (𝑝𝐴𝑥)) = (𝑥 ∈ 𝐶 ↦ ((0g‘𝐺)𝐴𝑥)))
4	1, 3	eqtrid 2808	. . . . 5 ⊢ (𝑝 = (0g‘𝐺) → 𝐹 = (𝑥 ∈ 𝐶 ↦ ((0g‘𝐺)𝐴𝑥)))
5	4	eleq1d 2846	. . . 4 ⊢ (𝑝 = (0g‘𝐺) → (𝐹 ∈ (𝑊 MndHom 𝑊) ↔ (𝑥 ∈ 𝐶 ↦ ((0g‘𝐺)𝐴𝑥)) ∈ (𝑊 MndHom 𝑊)))
6		fxpsubm.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐵) → 𝐹 ∈ (𝑊 MndHom 𝑊))
7	6	ralrimiva 3153	. . . 4 ⊢ (𝜑 → ∀𝑝 ∈ 𝐵 𝐹 ∈ (𝑊 MndHom 𝑊))
8		fxpsubm.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (𝐺 GrpAct 𝐶))
9		gagrp 19315	. . . . . 6 ⊢ (𝐴 ∈ (𝐺 GrpAct 𝐶) → 𝐺 ∈ Grp)
10	8, 9	syl 17	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ Grp)
11		fxpsubm.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
12		eqid 2761	. . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺)
13	11, 12	grpidcl 18990	. . . . 5 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝐵)
14	10, 13	syl 17	. . . 4 ⊢ (𝜑 → (0g‘𝐺) ∈ 𝐵)
15	5, 7, 14	rspcdva 3582	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ ((0g‘𝐺)𝐴𝑥)) ∈ (𝑊 MndHom 𝑊))
16		mhmrcl1 18804	. . 3 ⊢ ((𝑥 ∈ 𝐶 ↦ ((0g‘𝐺)𝐴𝑥)) ∈ (𝑊 MndHom 𝑊) → 𝑊 ∈ Mnd)
17	15, 16	syl 17	. 2 ⊢ (𝜑 → 𝑊 ∈ Mnd)
18		gaset 19316	. . . 4 ⊢ (𝐴 ∈ (𝐺 GrpAct 𝐶) → 𝐶 ∈ V)
19	8, 18	syl 17	. . 3 ⊢ (𝜑 → 𝐶 ∈ V)
20	19, 8	fxpss 33307	. 2 ⊢ (𝜑 → (𝐶FixPts𝐴) ⊆ 𝐶)
21		oveq2 7400	. . . . . 6 ⊢ (𝑥 = (0g‘𝑊) → (𝑝𝐴𝑥) = (𝑝𝐴(0g‘𝑊)))
22		fxpsubm.c	. . . . . . . . 9 ⊢ 𝐶 = (Base‘𝑊)
23		eqid 2761	. . . . . . . . 9 ⊢ (0g‘𝑊) = (0g‘𝑊)
24	22, 23	mndidcl 18766	. . . . . . . 8 ⊢ (𝑊 ∈ Mnd → (0g‘𝑊) ∈ 𝐶)
25	17, 24	syl 17	. . . . . . 7 ⊢ (𝜑 → (0g‘𝑊) ∈ 𝐶)
26	25	adantr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐵) → (0g‘𝑊) ∈ 𝐶)
27		ovexd 7427	. . . . . 6 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴(0g‘𝑊)) ∈ V)
28	1, 21, 26, 27	fvmptd3 6995	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐵) → (𝐹‘(0g‘𝑊)) = (𝑝𝐴(0g‘𝑊)))
29	23, 23	mhm0 18811	. . . . . 6 ⊢ (𝐹 ∈ (𝑊 MndHom 𝑊) → (𝐹‘(0g‘𝑊)) = (0g‘𝑊))
30	6, 29	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐵) → (𝐹‘(0g‘𝑊)) = (0g‘𝑊))
31	28, 30	eqtr3d 2798	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴(0g‘𝑊)) = (0g‘𝑊))
32	31	ralrimiva 3153	. . 3 ⊢ (𝜑 → ∀𝑝 ∈ 𝐵 (𝑝𝐴(0g‘𝑊)) = (0g‘𝑊))
33	11, 8, 25	isfxp 33309	. . 3 ⊢ (𝜑 → ((0g‘𝑊) ∈ (𝐶FixPts𝐴) ↔ ∀𝑝 ∈ 𝐵 (𝑝𝐴(0g‘𝑊)) = (0g‘𝑊)))
34	32, 33	mpbird 259	. 2 ⊢ (𝜑 → (0g‘𝑊) ∈ (𝐶FixPts𝐴))
35	6	ad4ant14 762	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → 𝐹 ∈ (𝑊 MndHom 𝑊))
36	20	ad2antrr 736	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → (𝐶FixPts𝐴) ⊆ 𝐶)
37		simplr 778	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → 𝑧 ∈ (𝐶FixPts𝐴))
38	36, 37	sseldd 3937	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → 𝑧 ∈ 𝐶)
39	38	adantr 484	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → 𝑧 ∈ 𝐶)
40	20	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) → (𝐶FixPts𝐴) ⊆ 𝐶)
41	40	sselda 3936	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → 𝑦 ∈ 𝐶)
42	41	adantr 484	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → 𝑦 ∈ 𝐶)
43		eqid 2761	. . . . . . . . 9 ⊢ (+g‘𝑊) = (+g‘𝑊)
44	22, 43, 43	mhmlin 18810	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑊 MndHom 𝑊) ∧ 𝑧 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) → (𝐹‘(𝑧(+g‘𝑊)𝑦)) = ((𝐹‘𝑧)(+g‘𝑊)(𝐹‘𝑦)))
45	35, 39, 42, 44	syl3anc 1389	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝐹‘(𝑧(+g‘𝑊)𝑦)) = ((𝐹‘𝑧)(+g‘𝑊)(𝐹‘𝑦)))
46		oveq2 7400	. . . . . . . 8 ⊢ (𝑥 = (𝑧(+g‘𝑊)𝑦) → (𝑝𝐴𝑥) = (𝑝𝐴(𝑧(+g‘𝑊)𝑦)))
47	17	ad2antrr 736	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → 𝑊 ∈ Mnd)
48	22, 43, 47, 38, 41	mndcld 33161	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → (𝑧(+g‘𝑊)𝑦) ∈ 𝐶)
49	48	adantr 484	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝑧(+g‘𝑊)𝑦) ∈ 𝐶)
50		ovexd 7427	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴(𝑧(+g‘𝑊)𝑦)) ∈ V)
51	1, 46, 49, 50	fvmptd3 6995	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝐹‘(𝑧(+g‘𝑊)𝑦)) = (𝑝𝐴(𝑧(+g‘𝑊)𝑦)))
52		oveq2 7400	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑝𝐴𝑥) = (𝑝𝐴𝑧))
53		ovexd 7427	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴𝑧) ∈ V)
54	1, 52, 39, 53	fvmptd3 6995	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝐹‘𝑧) = (𝑝𝐴𝑧))
55	8	ad2antrr 736	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → 𝐴 ∈ (𝐺 GrpAct 𝐶))
56	55	adantr 484	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → 𝐴 ∈ (𝐺 GrpAct 𝐶))
57	37	adantr 484	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → 𝑧 ∈ (𝐶FixPts𝐴))
58		simpr 488	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → 𝑝 ∈ 𝐵)
59	11, 56, 57, 58	fxpgaeq 33310	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴𝑧) = 𝑧)
60	54, 59	eqtrd 2796	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝐹‘𝑧) = 𝑧)
61		oveq2 7400	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑝𝐴𝑥) = (𝑝𝐴𝑦))
62		ovexd 7427	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴𝑦) ∈ V)
63	1, 61, 42, 62	fvmptd3 6995	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝐹‘𝑦) = (𝑝𝐴𝑦))
64		simplr 778	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → 𝑦 ∈ (𝐶FixPts𝐴))
65	11, 56, 64, 58	fxpgaeq 33310	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴𝑦) = 𝑦)
66	63, 65	eqtrd 2796	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝐹‘𝑦) = 𝑦)
67	60, 66	oveq12d 7410	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → ((𝐹‘𝑧)(+g‘𝑊)(𝐹‘𝑦)) = (𝑧(+g‘𝑊)𝑦))
68	45, 51, 67	3eqtr3d 2804	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) ∧ 𝑝 ∈ 𝐵) → (𝑝𝐴(𝑧(+g‘𝑊)𝑦)) = (𝑧(+g‘𝑊)𝑦))
69	68	ralrimiva 3153	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → ∀𝑝 ∈ 𝐵 (𝑝𝐴(𝑧(+g‘𝑊)𝑦)) = (𝑧(+g‘𝑊)𝑦))
70	11, 55, 48	isfxp 33309	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → ((𝑧(+g‘𝑊)𝑦) ∈ (𝐶FixPts𝐴) ↔ ∀𝑝 ∈ 𝐵 (𝑝𝐴(𝑧(+g‘𝑊)𝑦)) = (𝑧(+g‘𝑊)𝑦)))
71	69, 70	mpbird 259	. . . 4 ⊢ (((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) ∧ 𝑦 ∈ (𝐶FixPts𝐴)) → (𝑧(+g‘𝑊)𝑦) ∈ (𝐶FixPts𝐴))
72	71	ralrimiva 3153	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝐶FixPts𝐴)) → ∀𝑦 ∈ (𝐶FixPts𝐴)(𝑧(+g‘𝑊)𝑦) ∈ (𝐶FixPts𝐴))
73	72	ralrimiva 3153	. 2 ⊢ (𝜑 → ∀𝑧 ∈ (𝐶FixPts𝐴)∀𝑦 ∈ (𝐶FixPts𝐴)(𝑧(+g‘𝑊)𝑦) ∈ (𝐶FixPts𝐴))
74	22, 23, 43	issubm 18820	. . 3 ⊢ (𝑊 ∈ Mnd → ((𝐶FixPts𝐴) ∈ (SubMnd‘𝑊) ↔ ((𝐶FixPts𝐴) ⊆ 𝐶 ∧ (0g‘𝑊) ∈ (𝐶FixPts𝐴) ∧ ∀𝑧 ∈ (𝐶FixPts𝐴)∀𝑦 ∈ (𝐶FixPts𝐴)(𝑧(+g‘𝑊)𝑦) ∈ (𝐶FixPts𝐴))))
75	74	biimpar 481	. 2 ⊢ ((𝑊 ∈ Mnd ∧ ((𝐶FixPts𝐴) ⊆ 𝐶 ∧ (0g‘𝑊) ∈ (𝐶FixPts𝐴) ∧ ∀𝑧 ∈ (𝐶FixPts𝐴)∀𝑦 ∈ (𝐶FixPts𝐴)(𝑧(+g‘𝑊)𝑦) ∈ (𝐶FixPts𝐴))) → (𝐶FixPts𝐴) ∈ (SubMnd‘𝑊))
76	17, 20, 34, 73, 75	syl13anc 1390	1 ⊢ (𝜑 → (𝐶FixPts𝐴) ∈ (SubMnd‘𝑊))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  Vcvv 3453   ⊆ wss 3904   ↦ cmpt 5180  ‘cfv 6517  (class class class)co 7392  Basecbs 17228  +_gcplusg 17269  0_gc0g 17451  Mndcmnd 18751   MndHom cmhm 18798  SubMndcsubmnd 18799  Grpcgrp 18958   GrpAct cga 19312  FixPtscfxp 33304

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-fv 6525  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-map 8805  df-0g 17453  df-mgm 18657  df-sgrp 18736  df-mnd 18752  df-mhm 18800  df-submnd 18801  df-grp 18961  df-ga 19313  df-fxp 33305

This theorem is referenced by:  fxpsubg  33314