| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pwspjmhm | Structured version Visualization version GIF version | ||
| Description: A projection from a structure power of a monoid to the monoid itself is a monoid homomorphism. (Contributed by Mario Carneiro, 15-Jun-2015.) |
| Ref | Expression |
|---|---|
| pwspjmhm.y | ⊢ 𝑌 = (𝑅 ↑s 𝐼) |
| pwspjmhm.b | ⊢ 𝐵 = (Base‘𝑌) |
| Ref | Expression |
|---|---|
| pwspjmhm | ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2761 | . . 3 ⊢ ((Scalar‘𝑅)Xs(𝐼 × {𝑅})) = ((Scalar‘𝑅)Xs(𝐼 × {𝑅})) | |
| 2 | eqid 2761 | . . 3 ⊢ (Base‘((Scalar‘𝑅)Xs(𝐼 × {𝑅}))) = (Base‘((Scalar‘𝑅)Xs(𝐼 × {𝑅}))) | |
| 3 | simp2 1155 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → 𝐼 ∈ 𝑉) | |
| 4 | fvexd 6898 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (Scalar‘𝑅) ∈ V) | |
| 5 | fconst6g 6769 | . . . 4 ⊢ (𝑅 ∈ Mnd → (𝐼 × {𝑅}):𝐼⟶Mnd) | |
| 6 | 5 | 3ad2ant1 1151 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝐼 × {𝑅}):𝐼⟶Mnd) |
| 7 | simp3 1156 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → 𝐴 ∈ 𝐼) | |
| 8 | 1, 2, 3, 4, 6, 7 | prdspjmhm 19018 | . 2 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑥 ∈ (Base‘((Scalar‘𝑅)Xs(𝐼 × {𝑅}))) ↦ (𝑥‘𝐴)) ∈ (((Scalar‘𝑅)Xs(𝐼 × {𝑅})) MndHom ((𝐼 × {𝑅})‘𝐴))) |
| 9 | pwspjmhm.b | . . . 4 ⊢ 𝐵 = (Base‘𝑌) | |
| 10 | pwspjmhm.y | . . . . . . 7 ⊢ 𝑌 = (𝑅 ↑s 𝐼) | |
| 11 | eqid 2761 | . . . . . . 7 ⊢ (Scalar‘𝑅) = (Scalar‘𝑅) | |
| 12 | 10, 11 | pwsval 17650 | . . . . . 6 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉) → 𝑌 = ((Scalar‘𝑅)Xs(𝐼 × {𝑅}))) |
| 13 | 12 | 3adant3 1150 | . . . . 5 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → 𝑌 = ((Scalar‘𝑅)Xs(𝐼 × {𝑅}))) |
| 14 | 13 | fveq2d 6887 | . . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (Base‘𝑌) = (Base‘((Scalar‘𝑅)Xs(𝐼 × {𝑅})))) |
| 15 | 9, 14 | eqtrid 2808 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → 𝐵 = (Base‘((Scalar‘𝑅)Xs(𝐼 × {𝑅})))) |
| 16 | 15 | mpteq1d 5195 | . 2 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) = (𝑥 ∈ (Base‘((Scalar‘𝑅)Xs(𝐼 × {𝑅}))) ↦ (𝑥‘𝐴))) |
| 17 | fvconst2g 7206 | . . . . 5 ⊢ ((𝑅 ∈ Mnd ∧ 𝐴 ∈ 𝐼) → ((𝐼 × {𝑅})‘𝐴) = 𝑅) | |
| 18 | 17 | 3adant2 1149 | . . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → ((𝐼 × {𝑅})‘𝐴) = 𝑅) |
| 19 | 18 | eqcomd 2767 | . . 3 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → 𝑅 = ((𝐼 × {𝑅})‘𝐴)) |
| 20 | 13, 19 | oveq12d 7436 | . 2 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑌 MndHom 𝑅) = (((Scalar‘𝑅)Xs(𝐼 × {𝑅})) MndHom ((𝐼 × {𝑅})‘𝐴))) |
| 21 | 8, 16, 20 | 3eltr4d 2876 | 1 ⊢ ((𝑅 ∈ Mnd ∧ 𝐼 ∈ 𝑉 ∧ 𝐴 ∈ 𝐼) → (𝑥 ∈ 𝐵 ↦ (𝑥‘𝐴)) ∈ (𝑌 MndHom 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3451 {csn 4584 ↦ cmpt 5186 × cxp 5649 ⟶wf 6533 ‘cfv 6537 (class class class)co 7418 Basecbs 17380 Scalarcsca 17424 Xscprds 17609 ↑s cpws 17610 Mndcmnd 18916 MndHom cmhm 18969 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-1st 7999 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-1o 8469 df-er 8710 df-map 8842 df-ixp 8919 df-en 8967 df-dom 8968 df-sdom 8969 df-fin 8970 df-sup 9427 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-5 12401 df-6 12402 df-7 12403 df-8 12404 df-9 12405 df-n0 12600 df-z 12687 df-dec 12808 df-uz 12959 df-fz 13633 df-struct 17318 df-slot 17353 df-ndx 17365 df-base 17381 df-plusg 17434 df-mulr 17435 df-sca 17437 df-vsca 17438 df-ip 17439 df-tset 17440 df-ple 17441 df-ds 17443 df-hom 17445 df-cco 17446 df-0g 17605 df-prds 17611 df-pws 17613 df-mgm 18809 df-sgrp 18901 df-mnd 18917 df-mhm 18971 |
| This theorem is used by: pwsmulg 19322 |
| Copyright terms: Public domain | W3C validator |