Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mplvsca | Structured version Visualization version GIF version |
Description: The scalar multiplication operation on multivariate polynomials. (Contributed by Mario Carneiro, 9-Jan-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) |
Ref | Expression |
---|---|
mplvsca.p | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
mplvsca.n | ⊢ ∙ = ( ·𝑠 ‘𝑃) |
mplvsca.k | ⊢ 𝐾 = (Base‘𝑅) |
mplvsca.b | ⊢ 𝐵 = (Base‘𝑃) |
mplvsca.m | ⊢ · = (.r‘𝑅) |
mplvsca.d | ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} |
mplvsca.x | ⊢ (𝜑 → 𝑋 ∈ 𝐾) |
mplvsca.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
Ref | Expression |
---|---|
mplvsca | ⊢ (𝜑 → (𝑋 ∙ 𝐹) = ((𝐷 × {𝑋}) ∘f · 𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2821 | . 2 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
2 | mplvsca.p | . . 3 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
3 | mplvsca.n | . . 3 ⊢ ∙ = ( ·𝑠 ‘𝑃) | |
4 | 2, 1, 3 | mplvsca2 20225 | . 2 ⊢ ∙ = ( ·𝑠 ‘(𝐼 mPwSer 𝑅)) |
5 | mplvsca.k | . 2 ⊢ 𝐾 = (Base‘𝑅) | |
6 | eqid 2821 | . 2 ⊢ (Base‘(𝐼 mPwSer 𝑅)) = (Base‘(𝐼 mPwSer 𝑅)) | |
7 | mplvsca.m | . 2 ⊢ · = (.r‘𝑅) | |
8 | mplvsca.d | . 2 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} | |
9 | mplvsca.x | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐾) | |
10 | mplvsca.b | . . . 4 ⊢ 𝐵 = (Base‘𝑃) | |
11 | 2, 1, 10, 6 | mplbasss 20211 | . . 3 ⊢ 𝐵 ⊆ (Base‘(𝐼 mPwSer 𝑅)) |
12 | mplvsca.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
13 | 11, 12 | sseldi 3964 | . 2 ⊢ (𝜑 → 𝐹 ∈ (Base‘(𝐼 mPwSer 𝑅))) |
14 | 1, 4, 5, 6, 7, 8, 9, 13 | psrvsca 20170 | 1 ⊢ (𝜑 → (𝑋 ∙ 𝐹) = ((𝐷 × {𝑋}) ∘f · 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 {crab 3142 {csn 4566 × cxp 5552 ◡ccnv 5553 “ cima 5557 ‘cfv 6354 (class class class)co 7155 ∘f cof 7406 ↑m cmap 8405 Fincfn 8508 ℕcn 11637 ℕ0cn0 11896 Basecbs 16482 .rcmulr 16565 ·𝑠 cvsca 16568 mPwSer cmps 20130 mPoly cmpl 20132 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-of 7408 df-om 7580 df-1st 7688 df-2nd 7689 df-supp 7830 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-map 8407 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-fsupp 8833 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-3 11700 df-4 11701 df-5 11702 df-6 11703 df-7 11704 df-8 11705 df-9 11706 df-n0 11897 df-z 11981 df-uz 12243 df-fz 12892 df-struct 16484 df-ndx 16485 df-slot 16486 df-base 16488 df-sets 16489 df-ress 16490 df-plusg 16577 df-mulr 16578 df-sca 16580 df-vsca 16581 df-tset 16583 df-psr 20135 df-mpl 20137 |
This theorem is referenced by: mplvscaval 20227 mplcoe1 20245 mplmon2 20272 mdegvsca 24669 |
Copyright terms: Public domain | W3C validator |