| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > matvsca2 | Structured version Visualization version GIF version | ||
| Description: Scalar multiplication in the matrix ring is cell-wise. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
| Ref | Expression |
|---|---|
| matvsca2.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| matvsca2.b | ⊢ 𝐵 = (Base‘𝐴) |
| matvsca2.k | ⊢ 𝐾 = (Base‘𝑅) |
| matvsca2.v | ⊢ · = ( ·𝑠 ‘𝐴) |
| matvsca2.t | ⊢ × = (.r‘𝑅) |
| matvsca2.c | ⊢ 𝐶 = (𝑁 × 𝑁) |
| Ref | Expression |
|---|---|
| matvsca2 | ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = ((𝐶 × {𝑋}) ∘f × 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | matvsca2.a | . . . . . . 7 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 2 | matvsca2.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐴) | |
| 3 | 1, 2 | matrcl 22727 | . . . . . 6 ⊢ (𝑌 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
| 4 | 3 | adantl 487 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
| 5 | eqid 2760 | . . . . . 6 ⊢ (𝑅 freeLMod (𝑁 × 𝑁)) = (𝑅 freeLMod (𝑁 × 𝑁)) | |
| 6 | 1, 5 | matvsca 22731 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = ( ·𝑠 ‘𝐴)) |
| 7 | 4, 6 | syl 18 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = ( ·𝑠 ‘𝐴)) |
| 8 | matvsca2.v | . . . 4 ⊢ · = ( ·𝑠 ‘𝐴) | |
| 9 | 7, 8 | eqtr4di 2813 | . . 3 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = · ) |
| 10 | 9 | oveqd 7437 | . 2 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁)))𝑌) = (𝑋 · 𝑌)) |
| 11 | eqid 2760 | . . . 4 ⊢ (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) | |
| 12 | matvsca2.k | . . . 4 ⊢ 𝐾 = (Base‘𝑅) | |
| 13 | 4 | simpld 500 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑁 ∈ Fin) |
| 14 | xpfi 9311 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑁 × 𝑁) ∈ Fin) | |
| 15 | 13, 13, 14 | syl2anc 596 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑁 × 𝑁) ∈ Fin) |
| 16 | simpl 488 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐾) | |
| 17 | simpr 490 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 18 | 1, 5 | matbas 22728 | . . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘𝐴)) |
| 19 | 4, 18 | syl 18 | . . . . . 6 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘𝐴)) |
| 20 | 19, 2 | eqtr4di 2813 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = 𝐵) |
| 21 | 17, 20 | eleqtrrd 2863 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ (Base‘(𝑅 freeLMod (𝑁 × 𝑁)))) |
| 22 | eqid 2760 | . . . 4 ⊢ ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) | |
| 23 | matvsca2.t | . . . 4 ⊢ × = (.r‘𝑅) | |
| 24 | 5, 11, 12, 15, 16, 21, 22, 23 | frlmvscafval 22072 | . . 3 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁)))𝑌) = (((𝑁 × 𝑁) × {𝑋}) ∘f × 𝑌)) |
| 25 | matvsca2.c | . . . . 5 ⊢ 𝐶 = (𝑁 × 𝑁) | |
| 26 | 25 | xpeq1i 5676 | . . . 4 ⊢ (𝐶 × {𝑋}) = ((𝑁 × 𝑁) × {𝑋}) |
| 27 | 26 | oveq1i 7430 | . . 3 ⊢ ((𝐶 × {𝑋}) ∘f × 𝑌) = (((𝑁 × 𝑁) × {𝑋}) ∘f × 𝑌) |
| 28 | 24, 27 | eqtr4di 2813 | . 2 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁)))𝑌) = ((𝐶 × {𝑋}) ∘f × 𝑌)) |
| 29 | 10, 28 | eqtr3d 2797 | 1 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = ((𝐶 × {𝑋}) ∘f × 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 {csn 4583 × cxp 5648 ‘cfv 6538 (class class class)co 7420 ∘f cof 7691 Fincfn 8973 Basecbs 17387 .rcmulr 17429 ·𝑠 cvsca 17432 freeLMod cfrlm 22052 Mat cmat 22722 |
| 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 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3062 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-pss 4014 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-tp 4588 df-op 4590 df-ot 4592 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 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-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 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-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-of 7693 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-map 8849 df-ixp 8926 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-fz 13640 df-struct 17325 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-ress 17409 df-plusg 17441 df-mulr 17442 df-sca 17444 df-vsca 17445 df-ip 17446 df-tset 17447 df-ple 17448 df-ds 17450 df-hom 17452 df-cco 17453 df-prds 17618 df-pws 17620 df-sra 21448 df-rgmod 21449 df-dsmm 22038 df-frlm 22053 df-mat 22723 |
| This theorem is used by: matvscacell 22751 matassa 22759 matsc 22765 mattposvs 22770 mat1dimscm 22790 |
| Copyright terms: Public domain | W3C validator |