| 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 19555 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (𝑍‘𝑇)) → (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 4 | 3 | ralrimiva 3154 | . . 3 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → ∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 5 | ssralv 3977 | . . 3 ⊢ (𝑆 ⊆ (𝑍‘𝑇) → (∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))) | |
| 6 | 4, 5 | mpan9 516 | . 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))) |
| 7 | eqid 2760 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 8 | eqid 2760 | . . . . . 6 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 9 | 7, 8 | mhmf 18984 | . . . . 5 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻)) |
| 11 | 10 | ffund 6714 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → Fun 𝐹) |
| 12 | simpr 490 | . . . . 5 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (𝑍‘𝑇)) | |
| 13 | 7, 1 | cntzssv 19542 | . . . . 5 ⊢ (𝑍‘𝑇) ⊆ (Base‘𝐺) |
| 14 | 12, 13 | sstrdi 3920 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (Base‘𝐺)) |
| 15 | 10 | fdmd 6720 | . . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → dom 𝐹 = (Base‘𝐺)) |
| 16 | 14, 15 | sseqtrrd 3945 | . . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ dom 𝐹) |
| 17 | funimass4 6949 | . . 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 1569 ∈ wcel 2144 ∀wral 3076 ⊆ wss 3895 dom cdm 5650 “ cima 5653 Fun wfun 6532 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 Basecbs 17387 MndHom cmhm 18976 Cntzccntz 19529 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-ss 3896 df-dif 4047 df-in 4091 df-un 4151 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 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-map 8849 df-mhm 18978 df-cntz 19531 |
| This theorem is used by: gsumzmhm 20151 gsumzinv 20159 |
| Copyright terms: Public domain | W3C validator |