| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > evl1gsumadd | Structured version Visualization version GIF version | ||
| Description: Univariate polynomial evaluation maps (additive) group sums to group sums. Remark: the proof would be shorter if the theorem is proved directly instead of using evls1gsumadd 22452. (Contributed by AV, 15-Sep-2019.) |
| Ref | Expression |
|---|---|
| evl1gsumadd.q | ⊢ 𝑄 = (eval1‘𝑅) |
| evl1gsumadd.k | ⊢ 𝐾 = (Base‘𝑅) |
| evl1gsumadd.w | ⊢ 𝑊 = (Poly1‘𝑅) |
| evl1gsumadd.p | ⊢ 𝑃 = (𝑅 ↑s 𝐾) |
| evl1gsumadd.b | ⊢ 𝐵 = (Base‘𝑊) |
| evl1gsumadd.r | ⊢ (𝜑 → 𝑅 ∈ CRing) |
| evl1gsumadd.y | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑌 ∈ 𝐵) |
| evl1gsumadd.n | ⊢ (𝜑 → 𝑁 ⊆ ℕ0) |
| evl1gsumadd.0 | ⊢ 0 = (0g‘𝑊) |
| evl1gsumadd.f | ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ 𝑌) finSupp 0 ) |
| Ref | Expression |
|---|---|
| evl1gsumadd | ⊢ (𝜑 → (𝑄‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | evl1gsumadd.q | . . . . 5 ⊢ 𝑄 = (eval1‘𝑅) | |
| 2 | evl1gsumadd.k | . . . . 5 ⊢ 𝐾 = (Base‘𝑅) | |
| 3 | 1, 2 | evl1fval1 22459 | . . . 4 ⊢ 𝑄 = (𝑅 evalSub1 𝐾) |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → 𝑄 = (𝑅 evalSub1 𝐾)) |
| 5 | 4 | fveq1d 6884 | . 2 ⊢ (𝜑 → (𝑄‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌)))) |
| 6 | evl1gsumadd.w | . . . . 5 ⊢ 𝑊 = (Poly1‘𝑅) | |
| 7 | evl1gsumadd.r | . . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 8 | 2 | ressid 17303 | . . . . . . . 8 ⊢ (𝑅 ∈ CRing → (𝑅 ↾s 𝐾) = 𝑅) |
| 9 | 7, 8 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (𝑅 ↾s 𝐾) = 𝑅) |
| 10 | 9 | eqcomd 2775 | . . . . . 6 ⊢ (𝜑 → 𝑅 = (𝑅 ↾s 𝐾)) |
| 11 | 10 | fveq2d 6886 | . . . . 5 ⊢ (𝜑 → (Poly1‘𝑅) = (Poly1‘(𝑅 ↾s 𝐾))) |
| 12 | 6, 11 | eqtrid 2816 | . . . 4 ⊢ (𝜑 → 𝑊 = (Poly1‘(𝑅 ↾s 𝐾))) |
| 13 | 12 | fvoveq1d 7433 | . . 3 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = ((𝑅 evalSub1 𝐾)‘((Poly1‘(𝑅 ↾s 𝐾)) Σg (𝑥 ∈ 𝑁 ↦ 𝑌)))) |
| 14 | eqid 2769 | . . . 4 ⊢ (𝑅 evalSub1 𝐾) = (𝑅 evalSub1 𝐾) | |
| 15 | eqid 2769 | . . . 4 ⊢ (Poly1‘(𝑅 ↾s 𝐾)) = (Poly1‘(𝑅 ↾s 𝐾)) | |
| 16 | eqid 2769 | . . . 4 ⊢ (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = (0g‘(Poly1‘(𝑅 ↾s 𝐾))) | |
| 17 | eqid 2769 | . . . 4 ⊢ (𝑅 ↾s 𝐾) = (𝑅 ↾s 𝐾) | |
| 18 | evl1gsumadd.p | . . . 4 ⊢ 𝑃 = (𝑅 ↑s 𝐾) | |
| 19 | eqid 2769 | . . . 4 ⊢ (Base‘(Poly1‘(𝑅 ↾s 𝐾))) = (Base‘(Poly1‘(𝑅 ↾s 𝐾))) | |
| 20 | crngring 20326 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 21 | 2 | subrgid 20657 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝐾 ∈ (SubRing‘𝑅)) |
| 22 | 7, 20, 21 | 3syl 19 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ (SubRing‘𝑅)) |
| 23 | evl1gsumadd.y | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑌 ∈ 𝐵) | |
| 24 | evl1gsumadd.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑊) | |
| 25 | 12 | adantr 485 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑊 = (Poly1‘(𝑅 ↾s 𝐾))) |
| 26 | 25 | fveq2d 6886 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (Base‘𝑊) = (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 27 | 24, 26 | eqtrid 2816 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐵 = (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 28 | 23, 27 | eleqtrd 2871 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑌 ∈ (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 29 | evl1gsumadd.n | . . . 4 ⊢ (𝜑 → 𝑁 ⊆ ℕ0) | |
| 30 | evl1gsumadd.f | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ 𝑌) finSupp 0 ) | |
| 31 | 12 | eqcomd 2775 | . . . . . . 7 ⊢ (𝜑 → (Poly1‘(𝑅 ↾s 𝐾)) = 𝑊) |
| 32 | 31 | fveq2d 6886 | . . . . . 6 ⊢ (𝜑 → (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = (0g‘𝑊)) |
| 33 | evl1gsumadd.0 | . . . . . 6 ⊢ 0 = (0g‘𝑊) | |
| 34 | 32, 33 | eqtr4di 2822 | . . . . 5 ⊢ (𝜑 → (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = 0 ) |
| 35 | 30, 34 | breqtrrd 5143 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ 𝑌) finSupp (0g‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 36 | 14, 2, 15, 16, 17, 18, 19, 7, 22, 28, 29, 35 | evls1gsumadd 22452 | . . 3 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘((Poly1‘(𝑅 ↾s 𝐾)) Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)))) |
| 37 | 13, 36 | eqtrd 2804 | . 2 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)))) |
| 38 | 4 | fveq1d 6884 | . . . . 5 ⊢ (𝜑 → (𝑄‘𝑌) = ((𝑅 evalSub1 𝐾)‘𝑌)) |
| 39 | 38 | eqcomd 2775 | . . . 4 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘𝑌) = (𝑄‘𝑌)) |
| 40 | 39 | mpteq2dv 5209 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)) = (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌))) |
| 41 | 40 | oveq2d 7427 | . 2 ⊢ (𝜑 → (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌)))) |
| 42 | 5, 37, 41 | 3eqtrd 2808 | 1 ⊢ (𝜑 → (𝑄‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 class class class wbr 5113 ↦ cmpt 5196 ‘cfv 6537 (class class class)co 7411 finSupp cfsupp 9320 ℕ0cn0 12503 Basecbs 17268 ↾s cress 17289 0gc0g 17491 Σg cgsu 17492 ↑s cpws 17498 Ringcrg 20314 CRingccrg 20315 SubRingcsubrg 20653 Poly1cpl1 22305 evalSub1 ces1 22441 eval1ce1 22442 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-ofr 7676 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-map 8825 df-pm 8826 df-ixp 8895 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-sup 9401 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-9 12309 df-n0 12504 df-z 12591 df-dec 12711 df-uz 12862 df-fz 13535 df-fzo 13682 df-seq 14037 df-hash 14366 df-struct 17206 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-mulr 17323 df-sca 17325 df-vsca 17326 df-ip 17327 df-tset 17328 df-ple 17329 df-ds 17331 df-hom 17333 df-cco 17334 df-0g 17493 df-gsum 17494 df-prds 17499 df-pws 17501 df-mre 17637 df-mrc 17638 df-acs 17640 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-mhm 18840 df-submnd 18841 df-grp 19002 df-minusg 19003 df-sbg 19004 df-mulg 19133 df-subg 19188 df-ghm 19283 df-cntz 19386 df-cmn 19851 df-abl 19852 df-mgp 20216 df-rng 20230 df-ur 20263 df-srg 20268 df-ring 20316 df-cring 20317 df-rhm 20553 df-subrng 20630 df-subrg 20654 df-lmod 20960 df-lss 21030 df-lsp 21070 df-assa 21971 df-asp 21972 df-ascl 21973 df-psr 22027 df-mvr 22028 df-mpl 22029 df-opsr 22031 df-evls 22193 df-evl 22194 df-psr1 22308 df-ply1 22310 df-evls1 22443 df-evl1 22444 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |