![]() |
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 19368 | . . 3 ⊢ (𝑍‘𝑆) ⊆ 𝐵 |
4 | 3 | a1i 11 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) ⊆ 𝐵) |
5 | simpl1 1191 | . . . . . . 7 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → 𝐺 ∈ CMnd) | |
6 | simpl3 1193 | . . . . . . 7 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → 𝑥 ∈ 𝐵) | |
7 | simp2 1137 | . . . . . . . 8 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → 𝑆 ⊆ 𝐵) | |
8 | 7 | sselda 4008 | . . . . . . 7 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → 𝑦 ∈ 𝐵) |
9 | eqid 2740 | . . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
10 | 1, 9 | cmncom 19840 | . . . . . . 7 ⊢ ((𝐺 ∈ CMnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
11 | 5, 6, 8, 10 | syl3anc 1371 | . . . . . 6 ⊢ (((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
12 | 11 | ralrimiva 3152 | . . . . 5 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥)) |
13 | 1, 9, 2 | cntzel 19363 | . . . . . 6 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝑍‘𝑆) ↔ ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))) |
14 | 13 | 3adant1 1130 | . . . . 5 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ (𝑍‘𝑆) ↔ ∀𝑦 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) = (𝑦(+g‘𝐺)𝑥))) |
15 | 12, 14 | mpbird 257 | . . . 4 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝑍‘𝑆)) |
16 | 15 | 3expia 1121 | . . 3 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝑍‘𝑆))) |
17 | 16 | ssrdv 4014 | . 2 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → 𝐵 ⊆ (𝑍‘𝑆)) |
18 | 4, 17 | eqssd 4026 | 1 ⊢ ((𝐺 ∈ CMnd ∧ 𝑆 ⊆ 𝐵) → (𝑍‘𝑆) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ⊆ wss 3976 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 +gcplusg 17311 Cntzccntz 19355 CMndccmn 19822 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-cntz 19357 df-cmn 19824 |
This theorem is referenced by: cntzcmnss 19883 cntzcmnf 19887 ablcntzd 19899 gsumadd 19965 rprmdvdsprod 33527 |
Copyright terms: Public domain | W3C validator |