| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > c0snmhm | Structured version Visualization version GIF version | ||
| Description: The constant mapping to zero is a monoid homomorphism from the trivial monoid (consisting of the zero only) to any monoid. (Contributed by AV, 17-Apr-2020.) |
| Ref | Expression |
|---|---|
| zrrhm.b | ⊢ 𝐵 = (Base‘𝑇) |
| zrrhm.0 | ⊢ 0 = (0g‘𝑆) |
| zrrhm.h | ⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ) |
| c0snmhm.z | ⊢ 𝑍 = (0g‘𝑇) |
| Ref | Expression |
|---|---|
| c0snmhm | ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 𝐻 ∈ (𝑇 MndHom 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm3.22 464 | . . 3 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) → (𝑇 ∈ Mnd ∧ 𝑆 ∈ Mnd)) | |
| 2 | 1 | 3adant3 1148 | . 2 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → (𝑇 ∈ Mnd ∧ 𝑆 ∈ Mnd)) |
| 3 | simp1 1152 | . . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 𝑆 ∈ Mnd) | |
| 4 | mndmgm 18789 | . . . . 5 ⊢ (𝑇 ∈ Mnd → 𝑇 ∈ Mgm) | |
| 5 | 4 | 3ad2ant2 1150 | . . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 𝑇 ∈ Mgm) |
| 6 | fveq2 6871 | . . . . . 6 ⊢ (𝐵 = {𝑍} → (♯‘𝐵) = (♯‘{𝑍})) | |
| 7 | c0snmhm.z | . . . . . . . 8 ⊢ 𝑍 = (0g‘𝑇) | |
| 8 | 7 | fvexi 6885 | . . . . . . 7 ⊢ 𝑍 ∈ V |
| 9 | hashsng 14396 | . . . . . . 7 ⊢ (𝑍 ∈ V → (♯‘{𝑍}) = 1) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ (♯‘{𝑍}) = 1 |
| 11 | 6, 10 | eqtrdi 2816 | . . . . 5 ⊢ (𝐵 = {𝑍} → (♯‘𝐵) = 1) |
| 12 | 11 | 3ad2ant3 1151 | . . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → (♯‘𝐵) = 1) |
| 13 | zrrhm.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑇) | |
| 14 | zrrhm.0 | . . . . 5 ⊢ 0 = (0g‘𝑆) | |
| 15 | zrrhm.h | . . . . 5 ⊢ 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 ) | |
| 16 | 13, 14, 15 | c0snmgmhm 20535 | . . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mgm ∧ (♯‘𝐵) = 1) → 𝐻 ∈ (𝑇 MgmHom 𝑆)) |
| 17 | 3, 5, 12, 16 | syl3anc 1394 | . . 3 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 𝐻 ∈ (𝑇 MgmHom 𝑆)) |
| 18 | 15 | a1i 11 | . . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 𝐻 = (𝑥 ∈ 𝐵 ↦ 0 )) |
| 19 | eqidd 2766 | . . . 4 ⊢ (((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) ∧ 𝑥 = 𝑍) → 0 = 0 ) | |
| 20 | 8 | snid 4624 | . . . . . 6 ⊢ 𝑍 ∈ {𝑍} |
| 21 | eleq2 2854 | . . . . . 6 ⊢ (𝐵 = {𝑍} → (𝑍 ∈ 𝐵 ↔ 𝑍 ∈ {𝑍})) | |
| 22 | 20, 21 | mpbiri 261 | . . . . 5 ⊢ (𝐵 = {𝑍} → 𝑍 ∈ 𝐵) |
| 23 | 22 | 3ad2ant3 1151 | . . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 𝑍 ∈ 𝐵) |
| 24 | eqid 2765 | . . . . . 6 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 25 | 24, 14 | mndidcl 18797 | . . . . 5 ⊢ (𝑆 ∈ Mnd → 0 ∈ (Base‘𝑆)) |
| 26 | 25 | 3ad2ant1 1149 | . . . 4 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 0 ∈ (Base‘𝑆)) |
| 27 | 18, 19, 23, 26 | fvmptd 6987 | . . 3 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → (𝐻‘𝑍) = 0 ) |
| 28 | 17, 27 | jca 520 | . 2 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → (𝐻 ∈ (𝑇 MgmHom 𝑆) ∧ (𝐻‘𝑍) = 0 )) |
| 29 | eqid 2765 | . . 3 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 30 | eqid 2765 | . . 3 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 31 | 13, 24, 29, 30, 7, 14 | ismhm0 18838 | . 2 ⊢ (𝐻 ∈ (𝑇 MndHom 𝑆) ↔ ((𝑇 ∈ Mnd ∧ 𝑆 ∈ Mnd) ∧ (𝐻 ∈ (𝑇 MgmHom 𝑆) ∧ (𝐻‘𝑍) = 0 ))) |
| 32 | 2, 28, 31 | sylanbrc 594 | 1 ⊢ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd ∧ 𝐵 = {𝑍}) → 𝐻 ∈ (𝑇 MndHom 𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 Vcvv 3457 {csn 4585 ↦ cmpt 5186 ‘cfv 6525 (class class class)co 7400 1c1 11089 ♯chash 14357 Basecbs 17259 +gcplusg 17300 0gc0g 17482 Mgmcmgm 18686 MgmHom cmgmhm 18738 Mndcmnd 18782 MndHom cmhm 18829 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-oadd 8445 df-er 8682 df-map 8814 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-dju 9875 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-n0 12496 df-z 12583 df-uz 12854 df-fz 13527 df-hash 14358 df-0g 17484 df-mgm 18688 df-mgmhm 18740 df-sgrp 18767 df-mnd 18783 df-mhm 18831 |
| This theorem is referenced by: c0snghm 20537 |
| Copyright terms: Public domain | W3C validator |