| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cntzmhm2 | Structured version Visualization version GIF version | ||
| Description: Centralizers in a monoid are preserved by monoid homomorphisms. (Contributed by Mario Carneiro, 24-Apr-2016.) |
| Ref | Expression |
|---|---|
| cntzmhm.z | ⊢ 𝑍 = (Cntz‘𝐺) |
| cntzmhm.y | ⊢ 𝑌 = (Cntz‘𝐻) |
| Ref | Expression |
|---|---|
| cntzmhm2 | ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → (𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cntzmhm.z | . . . . 5 ⊢ 𝑍 = (Cntz‘𝐺) | |
| 2 | cntzmhm.y | . . . . 5 ⊢ 𝑌 = (Cntz‘𝐻) | |
| 3 | 1, 2 | cntzmhm 19608 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (𝑍‘𝑇)) → (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 4 | 3 | ralrimiva 3161 | . . 3 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → ∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 5 | ssralv 3981 | . . 3 ⊢ (𝑆 ⊆ (𝑍‘𝑇) → (∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))) | |
| 6 | 4, 5 | mpan9 516 | . 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 7 | eqid 2766 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 8 | eqid 2766 | . . . . . 6 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 9 | 7, 8 | mhmf 19036 | . . . . 5 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 11 | 10 | ffund 6743 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → Fun 𝐹) |
| 12 | simpr 490 | . . . . 5 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (𝑍‘𝑇)) | |
| 13 | 7, 1 | cntzssv 19595 | . . . . 5 ⊢ (𝑍‘𝑇) ⊆ (Base‘𝐺) |
| 14 | 12, 13 | sstrdi 3924 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (Base‘𝐺)) |
| 15 | 10 | fdmd 6749 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → dom 𝐹 = (Base‘𝐺)) |
| 16 | 14, 15 | sseqtrrd 3949 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ dom 𝐹) |
| 17 | funimass4 6979 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝑆 ⊆ dom 𝐹) → ((𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇)) ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))) | |
| 18 | 11, 16, 17 | syl2anc 596 | . 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → ((𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇)) ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))) |
| 19 | 6, 18 | mpbird 260 | 1 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → (𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∀wral 3083 ⊆ wss 3899 dom cdm 5657 “ cima 5660 Fun wfun 6559 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 MndHom cmhm 19028 Cntzccntz 19582 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-map 8886 df-mhm 19030 df-cntz 19584 |
| This theorem is used by: gsumzmhm 20204 gsumzinv 20212 |
| Copyright terms: Public domain | W3C validator |