![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cntzcmn | Structured version Visualization version GIF version |
Description: The centralizer of any subset in a commutative monoid is the whole monoid. (Contributed by Mario Carneiro, 3-Oct-2015.) |
Ref | Expression |
---|---|
cntzcmn.b | ⊢ 𝐵 = (Base‘𝐺) |
cntzcmn.z | ⊢ 𝑍 = (Cntz‘𝐺) |
Ref | Expression |
---|---|
cntzcmn | ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cntzcmn.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
2 | cntzcmn.z | . . . 4 ⊢ 𝑍 = (Cntz‘𝐺) | |
3 | 1, 2 | cntzssv 19358 | . . 3 ⊢ (𝑍‘𝑆) ⊆ 𝐵 |
4 | 3 | a1i 11 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) ⊆ 𝐵) |
5 | simpl1 1190 | . . . . . . 7 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → 𝐺 ∈ CMnd) | |
6 | simpl3 1192 | . . . . . . 7 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝐵) | |
7 | simp2 1136 | . . . . . . . 8 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → 𝑆 ⊆ 𝐵) | |
8 | 7 | sselda 3994 | . . . . . . 7 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ 𝐵) |
9 | eqid 2734 | . . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
10 | 1, 9 | cmncom 19830 | . . . . . . 7 ⊢ ((𝐺 ∈ CMnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
11 | 5, 6, 8, 10 | syl3anc 1370 | . . . . . 6 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
12 | 11 | ralrimiva 3143 | . . . . 5 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
13 | 1, 9, 2 | cntzel 19353 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝑍‘𝑆) ↔ ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))) |
14 | 13 | 3adant1 1129 | . . . . 5 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝑍‘𝑆) ↔ ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))) |
15 | 12, 14 | mpbird 257 | . . . 4 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝑍‘𝑆)) |
16 | 15 | 3expia 1120 | . . 3 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝑍‘𝑆))) |
17 | 16 | ssrdv 4000 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → 𝐵 ⊆ (𝑍‘𝑆)) |
18 | 4, 17 | eqssd 4012 | 1 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1536 ∈ wcel 2105 ∀wral 3058 ⊆ wss 3962 ‘cfv 6562 (class class class)co 7430 Basecbs 17244 +gcplusg 17297 Cntzccntz 19345 CMndccmn 19812 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-ral 3059 df-rex 3068 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5582 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-ov 7433 df-cntz 19347 df-cmn 19814 |
This theorem is referenced by: cntzcmnss 19873 cntzcmnf 19877 ablcntzd 19889 gsumadd 19955 rprmdvdsprod 33541 |
Copyright terms: Public domain | W3C validator |