Theorem cntrval2 33136

Description: Express the center 𝑍 of a group 𝑀 as the set of fixed points of the conjugation operation ⊕. (Contributed by Thierry Arnoux, 18-Nov-2025.)

Hypotheses

Ref	Expression
cntrval2.1	⊢ 𝐵 = (Base‘𝑀)
cntrval2.2	⊢ + = (+g‘𝑀)
cntrval2.3	⊢ − = (-g‘𝑀)
cntrval2.4	⊢ ⊕ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥 + 𝑦) − 𝑥))
cntrval2.5	⊢ 𝑍 = (Cntr‘𝑀)

Assertion

Ref	Expression
cntrval2	⊢ (𝑀 ∈ Grp → 𝑍 = (𝐵FixPts ⊕ ))

Distinct variable groups:   𝑥, ⊕ ,𝑦   𝑥, + ,𝑦   𝑥, − ,𝑦   𝑥,𝐵,𝑦   𝑥,𝑀,𝑦

Allowed substitution hints:   𝑍(𝑥,𝑦)

Proof of Theorem cntrval2

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

Step	Hyp	Ref	Expression
1		simpll 766	. . . . . . . 8 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → 𝑀 ∈ Grp)
2		cntrval2.1	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑀)
3		cntrval2.3	. . . . . . . . 9 ⊢ − = (-g‘𝑀)
4		cntrval2.2	. . . . . . . . . 10 ⊢ + = (+g‘𝑀)
5		simpr 484	. . . . . . . . . 10 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → 𝑝 ∈ 𝐵)
6		simplr 768	. . . . . . . . . 10 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → 𝑧 ∈ 𝐵)
7	2, 4, 1, 5, 6	grpcld 18885	. . . . . . . . 9 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → (𝑝 + 𝑧) ∈ 𝐵)
8	2, 3, 1, 7, 5	grpsubcld 32989	. . . . . . . 8 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ((𝑝 + 𝑧) − 𝑝) ∈ 𝐵)
9	2, 4	grprcan 18911	. . . . . . . 8 ⊢ ((𝑀 ∈ Grp ∧ (((𝑝 + 𝑧) − 𝑝) ∈ 𝐵 ∧ 𝑧 ∈ 𝐵 ∧ 𝑝 ∈ 𝐵)) → ((((𝑝 + 𝑧) − 𝑝) + 𝑝) = (𝑧 + 𝑝) ↔ ((𝑝 + 𝑧) − 𝑝) = 𝑧))
10	1, 8, 6, 5, 9	syl13anc 1374	. . . . . . 7 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ((((𝑝 + 𝑧) − 𝑝) + 𝑝) = (𝑧 + 𝑝) ↔ ((𝑝 + 𝑧) − 𝑝) = 𝑧))
11	2, 4, 3	grpnpcan 18970	. . . . . . . . . 10 ⊢ ((𝑀 ∈ Grp ∧ (𝑝 + 𝑧) ∈ 𝐵 ∧ 𝑝 ∈ 𝐵) → (((𝑝 + 𝑧) − 𝑝) + 𝑝) = (𝑝 + 𝑧))
12	1, 7, 5, 11	syl3anc 1373	. . . . . . . . 9 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → (((𝑝 + 𝑧) − 𝑝) + 𝑝) = (𝑝 + 𝑧))
13	12	eqeq2d 2741	. . . . . . . 8 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ((𝑧 + 𝑝) = (((𝑝 + 𝑧) − 𝑝) + 𝑝) ↔ (𝑧 + 𝑝) = (𝑝 + 𝑧)))
14		eqcom 2737	. . . . . . . 8 ⊢ ((𝑧 + 𝑝) = (((𝑝 + 𝑧) − 𝑝) + 𝑝) ↔ (((𝑝 + 𝑧) − 𝑝) + 𝑝) = (𝑧 + 𝑝))
15	13, 14	bitr3di 286	. . . . . . 7 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ((𝑧 + 𝑝) = (𝑝 + 𝑧) ↔ (((𝑝 + 𝑧) − 𝑝) + 𝑝) = (𝑧 + 𝑝)))
16		cntrval2.4	. . . . . . . . . 10 ⊢ ⊕ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥 + 𝑦) − 𝑥))
17	16	a1i 11	. . . . . . . . 9 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ⊕ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ((𝑥 + 𝑦) − 𝑥)))
18		simprl 770	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) ∧ (𝑥 = 𝑝 ∧ 𝑦 = 𝑧)) → 𝑥 = 𝑝)
19		simprr 772	. . . . . . . . . . 11 ⊢ ((((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) ∧ (𝑥 = 𝑝 ∧ 𝑦 = 𝑧)) → 𝑦 = 𝑧)
20	18, 19	oveq12d 7412	. . . . . . . . . 10 ⊢ ((((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) ∧ (𝑥 = 𝑝 ∧ 𝑦 = 𝑧)) → (𝑥 + 𝑦) = (𝑝 + 𝑧))
21	20, 18	oveq12d 7412	. . . . . . . . 9 ⊢ ((((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) ∧ (𝑥 = 𝑝 ∧ 𝑦 = 𝑧)) → ((𝑥 + 𝑦) − 𝑥) = ((𝑝 + 𝑧) − 𝑝))
22		ovexd 7429	. . . . . . . . 9 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ((𝑝 + 𝑧) − 𝑝) ∈ V)
23	17, 21, 5, 6, 22	ovmpod 7548	. . . . . . . 8 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → (𝑝 ⊕ 𝑧) = ((𝑝 + 𝑧) − 𝑝))
24	23	eqeq1d 2732	. . . . . . 7 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ((𝑝 ⊕ 𝑧) = 𝑧 ↔ ((𝑝 + 𝑧) − 𝑝) = 𝑧))
25	10, 15, 24	3bitr4d 311	. . . . . 6 ⊢ (((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) ∧ 𝑝 ∈ 𝐵) → ((𝑧 + 𝑝) = (𝑝 + 𝑧) ↔ (𝑝 ⊕ 𝑧) = 𝑧))
26	25	ralbidva 3156	. . . . 5 ⊢ ((𝑀 ∈ Grp ∧ 𝑧 ∈ 𝐵) → (∀𝑝 ∈ 𝐵 (𝑧 + 𝑝) = (𝑝 + 𝑧) ↔ ∀𝑝 ∈ 𝐵 (𝑝 ⊕ 𝑧) = 𝑧))
27	26	pm5.32da 579	. . . 4 ⊢ (𝑀 ∈ Grp → ((𝑧 ∈ 𝐵 ∧ ∀𝑝 ∈ 𝐵 (𝑧 + 𝑝) = (𝑝 + 𝑧)) ↔ (𝑧 ∈ 𝐵 ∧ ∀𝑝 ∈ 𝐵 (𝑝 ⊕ 𝑧) = 𝑧)))
28		cntrval2.5	. . . . 5 ⊢ 𝑍 = (Cntr‘𝑀)
29	2, 4, 28	elcntr 19268	. . . 4 ⊢ (𝑧 ∈ 𝑍 ↔ (𝑧 ∈ 𝐵 ∧ ∀𝑝 ∈ 𝐵 (𝑧 + 𝑝) = (𝑝 + 𝑧)))
30		rabid 3433	. . . 4 ⊢ (𝑧 ∈ {𝑧 ∈ 𝐵 ∣ ∀𝑝 ∈ 𝐵 (𝑝 ⊕ 𝑧) = 𝑧} ↔ (𝑧 ∈ 𝐵 ∧ ∀𝑝 ∈ 𝐵 (𝑝 ⊕ 𝑧) = 𝑧))
31	27, 29, 30	3bitr4g 314	. . 3 ⊢ (𝑀 ∈ Grp → (𝑧 ∈ 𝑍 ↔ 𝑧 ∈ {𝑧 ∈ 𝐵 ∣ ∀𝑝 ∈ 𝐵 (𝑝 ⊕ 𝑧) = 𝑧}))
32	2, 4, 3, 16	conjga 33135	. . . . 5 ⊢ (𝑀 ∈ Grp → ⊕ ∈ (𝑀 GrpAct 𝐵))
33	2, 32	fxpgaval 33132	. . . 4 ⊢ (𝑀 ∈ Grp → (𝐵FixPts ⊕ ) = {𝑧 ∈ 𝐵 ∣ ∀𝑝 ∈ 𝐵 (𝑝 ⊕ 𝑧) = 𝑧})
34	33	eleq2d 2815	. . 3 ⊢ (𝑀 ∈ Grp → (𝑧 ∈ (𝐵FixPts ⊕ ) ↔ 𝑧 ∈ {𝑧 ∈ 𝐵 ∣ ∀𝑝 ∈ 𝐵 (𝑝 ⊕ 𝑧) = 𝑧}))
35	31, 34	bitr4d 282	. 2 ⊢ (𝑀 ∈ Grp → (𝑧 ∈ 𝑍 ↔ 𝑧 ∈ (𝐵FixPts ⊕ )))
36	35	eqrdv 2728	1 ⊢ (𝑀 ∈ Grp → 𝑍 = (𝐵FixPts ⊕ ))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3046  {crab 3411  Vcvv 3455  ‘cfv 6519  (class class class)co 7394   ∈ cmpo 7396  Basecbs 17185  +_gcplusg 17226  Grpcgrp 18871  -_gcsg 18873  Cntrccntr 19254  FixPtscfxp 33128

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-rep 5242  ax-sep 5259  ax-nul 5269  ax-pow 5328  ax-pr 5395  ax-un 7718

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 2880  df-ne 2928  df-ral 3047  df-rex 3056  df-rmo 3357  df-reu 3358  df-rab 3412  df-v 3457  df-sbc 3762  df-csb 3871  df-dif 3925  df-un 3927  df-in 3929  df-ss 3939  df-nul 4305  df-if 4497  df-pw 4573  df-sn 4598  df-pr 4600  df-op 4604  df-uni 4880  df-iun 4965  df-br 5116  df-opab 5178  df-mpt 5197  df-id 5541  df-xp 5652  df-rel 5653  df-cnv 5654  df-co 5655  df-dm 5656  df-rn 5657  df-res 5658  df-ima 5659  df-iota 6472  df-fun 6521  df-fn 6522  df-f 6523  df-f1 6524  df-fo 6525  df-f1o 6526  df-fv 6527  df-riota 7351  df-ov 7397  df-oprab 7398  df-mpo 7399  df-1st 7977  df-2nd 7978  df-map 8805  df-0g 17410  df-mgm 18573  df-sgrp 18652  df-mnd 18668  df-grp 18874  df-minusg 18875  df-sbg 18876  df-ga 19228  df-cntz 19255  df-cntr 19256  df-fxp 33129

This theorem is referenced by: (None)