Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > psrmulval | Structured version Visualization version GIF version |
Description: The multiplication operation of the multivariate power series structure. (Contributed by Mario Carneiro, 28-Dec-2014.) |
Ref | Expression |
---|---|
psrmulr.s | ⊢ 𝑆 = (𝐼 mPwSer 𝑅) |
psrmulr.b | ⊢ 𝐵 = (Base‘𝑆) |
psrmulr.m | ⊢ · = (.r‘𝑅) |
psrmulr.t | ⊢ ∙ = (.r‘𝑆) |
psrmulr.d | ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} |
psrmulfval.i | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
psrmulfval.r | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
psrmulval.r | ⊢ (𝜑 → 𝑋 ∈ 𝐷) |
Ref | Expression |
---|---|
psrmulval | ⊢ (𝜑 → ((𝐹 ∙ 𝐺)‘𝑋) = (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | psrmulr.s | . . . 4 ⊢ 𝑆 = (𝐼 mPwSer 𝑅) | |
2 | psrmulr.b | . . . 4 ⊢ 𝐵 = (Base‘𝑆) | |
3 | psrmulr.m | . . . 4 ⊢ · = (.r‘𝑅) | |
4 | psrmulr.t | . . . 4 ⊢ ∙ = (.r‘𝑆) | |
5 | psrmulr.d | . . . 4 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} | |
6 | psrmulfval.i | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
7 | psrmulfval.r | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
8 | 1, 2, 3, 4, 5, 6, 7 | psrmulfval 20093 | . . 3 ⊢ (𝜑 → (𝐹 ∙ 𝐺) = (𝑥 ∈ 𝐷 ↦ (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘))))))) |
9 | 8 | fveq1d 6665 | . 2 ⊢ (𝜑 → ((𝐹 ∙ 𝐺)‘𝑋) = ((𝑥 ∈ 𝐷 ↦ (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘))))))‘𝑋)) |
10 | psrmulval.r | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐷) | |
11 | breq2 5061 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑦 ∘r ≤ 𝑥 ↔ 𝑦 ∘r ≤ 𝑋)) | |
12 | 11 | rabbidv 3478 | . . . . . 6 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋}) |
13 | fvoveq1 7168 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐺‘(𝑥 ∘f − 𝑘)) = (𝐺‘(𝑋 ∘f − 𝑘))) | |
14 | 13 | oveq2d 7161 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘))) = ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘)))) |
15 | 12, 14 | mpteq12dv 5142 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘)))) = (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘))))) |
16 | 15 | oveq2d 7161 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘))))) = (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘)))))) |
17 | eqid 2818 | . . . 4 ⊢ (𝑥 ∈ 𝐷 ↦ (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘)))))) = (𝑥 ∈ 𝐷 ↦ (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘)))))) | |
18 | ovex 7178 | . . . 4 ⊢ (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘))))) ∈ V | |
19 | 16, 17, 18 | fvmpt 6761 | . . 3 ⊢ (𝑋 ∈ 𝐷 → ((𝑥 ∈ 𝐷 ↦ (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘))))))‘𝑋) = (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘)))))) |
20 | 10, 19 | syl 17 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑥} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑥 ∘f − 𝑘))))))‘𝑋) = (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘)))))) |
21 | 9, 20 | eqtrd 2853 | 1 ⊢ (𝜑 → ((𝐹 ∙ 𝐺)‘𝑋) = (𝑅 Σg (𝑘 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝑋} ↦ ((𝐹‘𝑘) · (𝐺‘(𝑋 ∘f − 𝑘)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1528 ∈ wcel 2105 {crab 3139 class class class wbr 5057 ↦ cmpt 5137 ◡ccnv 5547 “ cima 5551 ‘cfv 6348 (class class class)co 7145 ∘f cof 7396 ∘r cofr 7397 ↑m cmap 8395 Fincfn 8497 ≤ cle 10664 − cmin 10858 ℕcn 11626 ℕ0cn0 11885 Basecbs 16471 .rcmulr 16554 Σg cgsu 16702 mPwSer cmps 20059 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-of 7398 df-om 7570 df-1st 7678 df-2nd 7679 df-supp 7820 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-map 8397 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-fsupp 8822 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-plusg 16566 df-mulr 16567 df-sca 16569 df-vsca 16570 df-tset 16572 df-psr 20064 |
This theorem is referenced by: psrlidm 20111 psrridm 20112 psrass1 20113 mplsubrglem 20147 |
Copyright terms: Public domain | W3C validator |