| 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 19582 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (𝑍‘𝑇)) → (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 4 | 3 | ralrimiva 3158 | . . 3 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → ∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 5 | ssralv 3982 | . . 3 ⊢ (𝑆 ⊆ (𝑍‘𝑇) → (∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))) | |
| 6 | 4, 5 | mpan9 516 | . 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 7 | eqid 2763 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 8 | eqid 2763 | . . . . . 6 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 9 | 7, 8 | mhmf 19010 | . . . . 5 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 11 | 10 | ffund 6733 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → Fun 𝐹) |
| 12 | simpr 490 | . . . . 5 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (𝑍‘𝑇)) | |
| 13 | 7, 1 | cntzssv 19569 | . . . . 5 ⊢ (𝑍‘𝑇) ⊆ (Base‘𝐺) |
| 14 | 12, 13 | sstrdi 3925 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (Base‘𝐺)) |
| 15 | 10 | fdmd 6739 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → dom 𝐹 = (Base‘𝐺)) |
| 16 | 14, 15 | sseqtrrd 3950 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ dom 𝐹) |
| 17 | funimass4 6969 | . . 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 1570 ∈ wcel 2147 ∀wral 3080 ⊆ wss 3900 dom cdm 5655 “ cima 5658 Fun wfun 6549 ⟶wf 6551 ‘cfv 6555 (class class class)co 7440 Basecbs 17413 MndHom cmhm 19002 Cntzccntz 19556 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-ov 7443 df-oprab 7444 df-mpo 7445 df-map 8874 df-mhm 19004 df-cntz 19558 |
| This theorem is used by: gsumzmhm 20178 gsumzinv 20186 |
| Copyright terms: Public domain | W3C validator |