| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > psrmonmul2 | Structured version Visualization version GIF version | ||
| Description: The product of two power series monomials adds the exponent vectors together. Here, the function 𝐺 is a monomial builder, which maps a bag of variables with the monic monomial with only those variables. (Contributed by Thierry Arnoux, 16-Mar-2026.) |
| Ref | Expression |
|---|---|
| psrmon.s | ⊢ 𝑆 = (𝐼 mPwSer 𝑅) |
| psrmon.b | ⊢ 𝐵 = (Base‘𝑆) |
| psrmon.z | ⊢ 0 = (0g‘𝑅) |
| psrmon.o | ⊢ 1 = (1r‘𝑅) |
| psrmon.d | ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ ℎ finSupp 0} |
| psrmon.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| psrmon.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| psrmon.x | ⊢ (𝜑 → 𝑋 ∈ 𝐷) |
| psrmonmul.t | ⊢ · = (.r‘𝑆) |
| psrmonmul.y | ⊢ (𝜑 → 𝑌 ∈ 𝐷) |
| psrmonmul.g | ⊢ 𝐺 = (𝑦 ∈ 𝐷 ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 ))) |
| Ref | Expression |
|---|---|
| psrmonmul2 | ⊢ (𝜑 → ((𝐺‘𝑋) · (𝐺‘𝑌)) = (𝐺‘(𝑋 ∘f + 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | psrmon.s | . . 3 ⊢ 𝑆 = (𝐼 mPwSer 𝑅) | |
| 2 | psrmon.b | . . 3 ⊢ 𝐵 = (Base‘𝑆) | |
| 3 | psrmon.z | . . 3 ⊢ 0 = (0g‘𝑅) | |
| 4 | psrmon.o | . . 3 ⊢ 1 = (1r‘𝑅) | |
| 5 | psrmon.d | . . 3 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ ℎ finSupp 0} | |
| 6 | psrmon.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 7 | psrmon.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 8 | psrmon.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐷) | |
| 9 | psrmonmul.t | . . 3 ⊢ · = (.r‘𝑆) | |
| 10 | psrmonmul.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐷) | |
| 11 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | psrmonmul 33699 | . 2 ⊢ (𝜑 → ((𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 )) · (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 ))) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 ))) |
| 12 | psrmonmul.g | . . . 4 ⊢ 𝐺 = (𝑦 ∈ 𝐷 ↦ (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 ))) | |
| 13 | eqeq2 2749 | . . . . . 6 ⊢ (𝑦 = 𝑋 → (𝑧 = 𝑦 ↔ 𝑧 = 𝑋)) | |
| 14 | 13 | ifbid 4491 | . . . . 5 ⊢ (𝑦 = 𝑋 → if(𝑧 = 𝑦, 1 , 0 ) = if(𝑧 = 𝑋, 1 , 0 )) |
| 15 | 14 | mpteq2dv 5180 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 )) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 ))) |
| 16 | ovex 7391 | . . . . . . 7 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
| 17 | 5, 16 | rabex2 5276 | . . . . . 6 ⊢ 𝐷 ∈ V |
| 18 | 17 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ V) |
| 19 | 18 | mptexd 7170 | . . . 4 ⊢ (𝜑 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 )) ∈ V) |
| 20 | 12, 15, 8, 19 | fvmptd3 6963 | . . 3 ⊢ (𝜑 → (𝐺‘𝑋) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 ))) |
| 21 | eqeq2 2749 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑧 = 𝑦 ↔ 𝑧 = 𝑌)) | |
| 22 | 21 | ifbid 4491 | . . . . 5 ⊢ (𝑦 = 𝑌 → if(𝑧 = 𝑦, 1 , 0 ) = if(𝑧 = 𝑌, 1 , 0 )) |
| 23 | 22 | mpteq2dv 5180 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 )) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 ))) |
| 24 | 18 | mptexd 7170 | . . . 4 ⊢ (𝜑 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 )) ∈ V) |
| 25 | 12, 23, 10, 24 | fvmptd3 6963 | . . 3 ⊢ (𝜑 → (𝐺‘𝑌) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 ))) |
| 26 | 20, 25 | oveq12d 7376 | . 2 ⊢ (𝜑 → ((𝐺‘𝑋) · (𝐺‘𝑌)) = ((𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 )) · (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 )))) |
| 27 | eqeq2 2749 | . . . . 5 ⊢ (𝑦 = (𝑋 ∘f + 𝑌) → (𝑧 = 𝑦 ↔ 𝑧 = (𝑋 ∘f + 𝑌))) | |
| 28 | 27 | ifbid 4491 | . . . 4 ⊢ (𝑦 = (𝑋 ∘f + 𝑌) → if(𝑧 = 𝑦, 1 , 0 ) = if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 )) |
| 29 | 28 | mpteq2dv 5180 | . . 3 ⊢ (𝑦 = (𝑋 ∘f + 𝑌) → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 )) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 ))) |
| 30 | 5 | psrbasfsupp 33677 | . . . . 5 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} |
| 31 | 30 | psrbagaddcl 21881 | . . . 4 ⊢ ((𝑋 ∈ 𝐷 ∧ 𝑌 ∈ 𝐷) → (𝑋 ∘f + 𝑌) ∈ 𝐷) |
| 32 | 8, 10, 31 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑋 ∘f + 𝑌) ∈ 𝐷) |
| 33 | 18 | mptexd 7170 | . . 3 ⊢ (𝜑 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 )) ∈ V) |
| 34 | 12, 29, 32, 33 | fvmptd3 6963 | . 2 ⊢ (𝜑 → (𝐺‘(𝑋 ∘f + 𝑌)) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 ))) |
| 35 | 11, 26, 34 | 3eqtr4d 2782 | 1 ⊢ (𝜑 → ((𝐺‘𝑋) · (𝐺‘𝑌)) = (𝐺‘(𝑋 ∘f + 𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {crab 3390 Vcvv 3430 ifcif 4467 class class class wbr 5086 ↦ cmpt 5167 ‘cfv 6490 (class class class)co 7358 ∘f cof 7620 ↑m cmap 8764 finSupp cfsupp 9265 0cc0 11027 + caddc 11030 ℕ0cn0 12402 Basecbs 17137 .rcmulr 17179 0gc0g 17360 1rcur 20120 Ringcrg 20172 mPwSer cmps 21861 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-isom 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-ofr 7623 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8102 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-er 8634 df-map 8766 df-pm 8767 df-ixp 8837 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-fsupp 9266 df-oi 9416 df-card 9852 df-pnf 11169 df-mnf 11170 df-xr 11171 df-ltxr 11172 df-le 11173 df-sub 11367 df-neg 11368 df-nn 12147 df-2 12209 df-3 12210 df-4 12211 df-5 12212 df-6 12213 df-7 12214 df-8 12215 df-9 12216 df-n0 12403 df-z 12490 df-uz 12753 df-fz 13425 df-fzo 13572 df-seq 13926 df-hash 14255 df-struct 17075 df-sets 17092 df-slot 17110 df-ndx 17122 df-base 17138 df-plusg 17191 df-mulr 17192 df-sca 17194 df-vsca 17195 df-tset 17197 df-0g 17362 df-gsum 17363 df-mgm 18566 df-sgrp 18645 df-mnd 18661 df-grp 18870 df-minusg 18871 df-mulg 19002 df-cntz 19250 df-cmn 19715 df-abl 19716 df-mgp 20080 df-rng 20092 df-ur 20121 df-ring 20174 df-psr 21866 |
| This theorem is referenced by: psrmonprod 33701 |
| Copyright terms: Public domain | W3C validator |