| 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 19516 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (𝑍‘𝑇)) → (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 4 | 3 | ralrimiva 3154 | . . 3 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → ∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 5 | ssralv 3999 | . . 3 ⊢ (𝑆 ⊆ (𝑍‘𝑇) → (∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))) | |
| 6 | 4, 5 | mpan9 516 | . 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 7 | eqid 2760 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 8 | eqid 2760 | . . . . . 6 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 9 | 7, 8 | mhmf 18945 | . . . . 5 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 11 | 10 | ffund 6702 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → Fun 𝐹) |
| 12 | simpr 490 | . . . . 5 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (𝑍‘𝑇)) | |
| 13 | 7, 1 | cntzssv 19503 | . . . . 5 ⊢ (𝑍‘𝑇) ⊆ (Base‘𝐺) |
| 14 | 12, 13 | sstrdi 3942 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (Base‘𝐺)) |
| 15 | 10 | fdmd 6708 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → dom 𝐹 = (Base‘𝐺)) |
| 16 | 14, 15 | sseqtrrd 3967 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ dom 𝐹) |
| 17 | funimass4 6937 | . . 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 2145 ∀wral 3076 ⊆ wss 3898 dom cdm 5647 “ cima 5650 Fun wfun 6521 ⟶wf 6523 ‘cfv 6527 (class class class)co 7408 Basecbs 17348 MndHom cmhm 18937 Cntzccntz 19490 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-map 8827 df-mhm 18939 df-cntz 19492 |
| This theorem is used by: gsumzmhm 20112 gsumzinv 20120 |
| Copyright terms: Public domain | W3C validator |