| 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 33719 | . 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 4504 | . . . . 5 ⊢ (𝑦 = 𝑋 → if(𝑧 = 𝑦, 1 , 0 ) = if(𝑧 = 𝑋, 1 , 0 )) |
| 15 | 14 | mpteq2dv 5193 | . . . 4 ⊢ (𝑦 = 𝑋 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 )) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 ))) |
| 16 | ovex 7394 | . . . . . . 7 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
| 17 | 5, 16 | rabex2 5287 | . . . . . 6 ⊢ 𝐷 ∈ V |
| 18 | 17 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ V) |
| 19 | 18 | mptexd 7173 | . . . 4 ⊢ (𝜑 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 )) ∈ V) |
| 20 | 12, 15, 8, 19 | fvmptd3 6966 | . . 3 ⊢ (𝜑 → (𝐺‘𝑋) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 ))) |
| 21 | eqeq2 2749 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑧 = 𝑦 ↔ 𝑧 = 𝑌)) | |
| 22 | 21 | ifbid 4504 | . . . . 5 ⊢ (𝑦 = 𝑌 → if(𝑧 = 𝑦, 1 , 0 ) = if(𝑧 = 𝑌, 1 , 0 )) |
| 23 | 22 | mpteq2dv 5193 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 )) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 ))) |
| 24 | 18 | mptexd 7173 | . . . 4 ⊢ (𝜑 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 )) ∈ V) |
| 25 | 12, 23, 10, 24 | fvmptd3 6966 | . . 3 ⊢ (𝜑 → (𝐺‘𝑌) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 ))) |
| 26 | 20, 25 | oveq12d 7379 | . 2 ⊢ (𝜑 → ((𝐺‘𝑋) · (𝐺‘𝑌)) = ((𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑋, 1 , 0 )) · (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑌, 1 , 0 )))) |
| 27 | eqeq2 2749 | . . . . 5 ⊢ (𝑦 = (𝑋 ∘f + 𝑌) → (𝑧 = 𝑦 ↔ 𝑧 = (𝑋 ∘f + 𝑌))) | |
| 28 | 27 | ifbid 4504 | . . . 4 ⊢ (𝑦 = (𝑋 ∘f + 𝑌) → if(𝑧 = 𝑦, 1 , 0 ) = if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 )) |
| 29 | 28 | mpteq2dv 5193 | . . 3 ⊢ (𝑦 = (𝑋 ∘f + 𝑌) → (𝑧 ∈ 𝐷 ↦ if(𝑧 = 𝑦, 1 , 0 )) = (𝑧 ∈ 𝐷 ↦ if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 ))) |
| 30 | 5 | psrbasfsupp 33697 | . . . . 5 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} |
| 31 | 30 | psrbagaddcl 21885 | . . . 4 ⊢ ((𝑋 ∈ 𝐷 ∧ 𝑌 ∈ 𝐷) → (𝑋 ∘f + 𝑌) ∈ 𝐷) |
| 32 | 8, 10, 31 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑋 ∘f + 𝑌) ∈ 𝐷) |
| 33 | 18 | mptexd 7173 | . . 3 ⊢ (𝜑 → (𝑧 ∈ 𝐷 ↦ if(𝑧 = (𝑋 ∘f + 𝑌), 1 , 0 )) ∈ V) |
| 34 | 12, 29, 32, 33 | fvmptd3 6966 | . 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 3400 Vcvv 3441 ifcif 4480 class class class wbr 5099 ↦ cmpt 5180 ‘cfv 6493 (class class class)co 7361 ∘f cof 7623 ↑m cmap 8768 finSupp cfsupp 9269 0cc0 11031 + caddc 11034 ℕ0cn0 12406 Basecbs 17141 .rcmulr 17183 0gc0g 17364 1rcur 20121 Ringcrg 20173 mPwSer cmps 21865 |
| 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 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7683 ax-cnex 11087 ax-resscn 11088 ax-1cn 11089 ax-icn 11090 ax-addcl 11091 ax-addrcl 11092 ax-mulcl 11093 ax-mulrcl 11094 ax-mulcom 11095 ax-addass 11096 ax-mulass 11097 ax-distr 11098 ax-i2m1 11099 ax-1ne0 11100 ax-1rid 11101 ax-rnegex 11102 ax-rrecex 11103 ax-cnre 11104 ax-pre-lttri 11105 ax-pre-lttrn 11106 ax-pre-ltadd 11107 ax-pre-mulgt0 11108 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-of 7625 df-ofr 7626 df-om 7812 df-1st 7936 df-2nd 7937 df-supp 8106 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-er 8638 df-map 8770 df-pm 8771 df-ixp 8841 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-fsupp 9270 df-oi 9420 df-card 9856 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-nn 12151 df-2 12213 df-3 12214 df-4 12215 df-5 12216 df-6 12217 df-7 12218 df-8 12219 df-9 12220 df-n0 12407 df-z 12494 df-uz 12757 df-fz 13429 df-fzo 13576 df-seq 13930 df-hash 14259 df-struct 17079 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17142 df-plusg 17195 df-mulr 17196 df-sca 17198 df-vsca 17199 df-tset 17201 df-0g 17366 df-gsum 17367 df-mgm 18570 df-sgrp 18649 df-mnd 18665 df-grp 18871 df-minusg 18872 df-mulg 19003 df-cntz 19251 df-cmn 19716 df-abl 19717 df-mgp 20081 df-rng 20093 df-ur 20122 df-ring 20175 df-psr 21870 |
| This theorem is referenced by: psrmonprod 33721 |
| Copyright terms: Public domain | W3C validator |