| 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 22754 | . . . . . 6 ⊢ (𝑌 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
| 4 | 3 | adantl 487 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
| 5 | eqid 2763 | . . . . . 6 ⊢ (𝑅 freeLMod (𝑁 × 𝑁)) = (𝑅 freeLMod (𝑁 × 𝑁)) | |
| 6 | 1, 5 | matvsca 22758 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = ( ·𝑠 ‘𝐴)) |
| 7 | 4, 6 | syl 18 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = ( ·𝑠 ‘𝐴)) |
| 8 | matvsca2.v | . . . 4 ⊢ · = ( ·𝑠 ‘𝐴) | |
| 9 | 7, 8 | eqtr4di 2816 | . . 3 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = · ) |
| 10 | 9 | oveqd 7457 | . 2 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁)))𝑌) = (𝑋 · 𝑌)) |
| 11 | eqid 2763 | . . . 4 ⊢ (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) | |
| 12 | matvsca2.k | . . . 4 ⊢ 𝐾 = (Base‘𝑅) | |
| 13 | 4 | simpld 500 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑁 ∈ Fin) |
| 14 | xpfi 9336 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin) → (𝑁 × 𝑁) ∈ Fin) | |
| 15 | 13, 13, 14 | syl2anc 596 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑁 × 𝑁) ∈ Fin) |
| 16 | simpl 488 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐾) | |
| 17 | simpr 490 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 18 | 1, 5 | matbas 22755 | . . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘𝐴)) |
| 19 | 4, 18 | syl 18 | . . . . . 6 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = (Base‘𝐴)) |
| 20 | 19, 2 | eqtr4di 2816 | . . . . 5 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (Base‘(𝑅 freeLMod (𝑁 × 𝑁))) = 𝐵) |
| 21 | 17, 20 | eleqtrrd 2867 | . . . 4 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ (Base‘(𝑅 freeLMod (𝑁 × 𝑁)))) |
| 22 | eqid 2763 | . . . 4 ⊢ ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) = ( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁))) | |
| 23 | matvsca2.t | . . . 4 ⊢ × = (.r‘𝑅) | |
| 24 | 5, 11, 12, 15, 16, 21, 22, 23 | frlmvscafval 22099 | . . 3 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁)))𝑌) = (((𝑁 × 𝑁) × {𝑋}) ∘f × 𝑌)) |
| 25 | matvsca2.c | . . . . 5 ⊢ 𝐶 = (𝑁 × 𝑁) | |
| 26 | 25 | xpeq1i 5681 | . . . 4 ⊢ (𝐶 × {𝑋}) = ((𝑁 × 𝑁) × {𝑋}) |
| 27 | 26 | oveq1i 7450 | . . 3 ⊢ ((𝐶 × {𝑋}) ∘f × 𝑌) = (((𝑁 × 𝑁) × {𝑋}) ∘f × 𝑌) |
| 28 | 24, 27 | eqtr4di 2816 | . 2 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋( ·𝑠 ‘(𝑅 freeLMod (𝑁 × 𝑁)))𝑌) = ((𝐶 × {𝑋}) ∘f × 𝑌)) |
| 29 | 10, 28 | eqtr3d 2800 | 1 ⊢ ((𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) = ((𝐶 × {𝑋}) ∘f × 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 {csn 4588 × cxp 5653 ‘cfv 6555 (class class class)co 7440 ∘f cof 7712 Fincfn 8998 Basecbs 17413 .rcmulr 17455 ·𝑠 cvsca 17458 freeLMod cfrlm 22079 Mat cmat 22749 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-ot 4862 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-of 7714 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-er 8742 df-map 8874 df-ixp 8951 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-sup 9458 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-3 12430 df-4 12431 df-5 12432 df-6 12433 df-7 12434 df-8 12435 df-9 12436 df-n0 12631 df-z 12718 df-dec 12839 df-uz 12990 df-fz 13664 df-struct 17351 df-sets 17368 df-slot 17386 df-ndx 17398 df-base 17414 df-ress 17435 df-plusg 17467 df-mulr 17468 df-sca 17470 df-vsca 17471 df-ip 17472 df-tset 17473 df-ple 17474 df-ds 17476 df-hom 17478 df-cco 17479 df-prds 17644 df-pws 17646 df-sra 21475 df-rgmod 21476 df-dsmm 22065 df-frlm 22080 df-mat 22750 |
| This theorem is used by: matvscacell 22778 matassa 22786 matsc 22792 mattposvs 22797 mat1dimscm 22817 |
| Copyright terms: Public domain | W3C validator |