| 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 22384. (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 22391 | . . . 4 ⊢ 𝑄 = (𝑅 evalSub1 𝐾) |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → 𝑄 = (𝑅 evalSub1 𝐾)) |
| 5 | 4 | fveq1d 6869 | . 2 ⊢ (𝜑 → (𝑄‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌)))) |
| 6 | evl1gsumadd.w | . . . . 5 ⊢ 𝑊 = (Poly1‘𝑅) | |
| 7 | evl1gsumadd.r | . . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 8 | 2 | ressid 17280 | . . . . . . . 8 ⊢ (𝑅 ∈ CRing → (𝑅 ↾s 𝐾) = 𝑅) |
| 9 | 7, 8 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (𝑅 ↾s 𝐾) = 𝑅) |
| 10 | 9 | eqcomd 2768 | . . . . . 6 ⊢ (𝜑 → 𝑅 = (𝑅 ↾s 𝐾)) |
| 11 | 10 | fveq2d 6871 | . . . . 5 ⊢ (𝜑 → (Poly1‘𝑅) = (Poly1‘(𝑅 ↾s 𝐾))) |
| 12 | 6, 11 | eqtrid 2809 | . . . 4 ⊢ (𝜑 → 𝑊 = (Poly1‘(𝑅 ↾s 𝐾))) |
| 13 | 12 | fvoveq1d 7418 | . . 3 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = ((𝑅 evalSub1 𝐾)‘((Poly1‘(𝑅 ↾s 𝐾)) Σg (𝑥 ∈ 𝑁 ↦ 𝑌)))) |
| 14 | eqid 2762 | . . . 4 ⊢ (𝑅 evalSub1 𝐾) = (𝑅 evalSub1 𝐾) | |
| 15 | eqid 2762 | . . . 4 ⊢ (Poly1‘(𝑅 ↾s 𝐾)) = (Poly1‘(𝑅 ↾s 𝐾)) | |
| 16 | eqid 2762 | . . . 4 ⊢ (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = (0g‘(Poly1‘(𝑅 ↾s 𝐾))) | |
| 17 | eqid 2762 | . . . 4 ⊢ (𝑅 ↾s 𝐾) = (𝑅 ↾s 𝐾) | |
| 18 | evl1gsumadd.p | . . . 4 ⊢ 𝑃 = (𝑅 ↑s 𝐾) | |
| 19 | eqid 2762 | . . . 4 ⊢ (Base‘(Poly1‘(𝑅 ↾s 𝐾))) = (Base‘(Poly1‘(𝑅 ↾s 𝐾))) | |
| 20 | crngring 20291 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 21 | 2 | subrgid 20619 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝐾 ∈ (SubRing‘𝑅)) |
| 22 | 7, 20, 21 | 3syl 18 | . . . 4 ⊢ (𝜑 → 𝐾 ∈ (SubRing‘𝑅)) |
| 23 | evl1gsumadd.y | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑌 ∈ 𝐵) | |
| 24 | evl1gsumadd.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑊) | |
| 25 | 12 | adantr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑊 = (Poly1‘(𝑅 ↾s 𝐾))) |
| 26 | 25 | fveq2d 6871 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (Base‘𝑊) = (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 27 | 24, 26 | eqtrid 2809 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐵 = (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 28 | 23, 27 | eleqtrd 2864 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑌 ∈ (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 29 | evl1gsumadd.n | . . . 4 ⊢ (𝜑 → 𝑁 ⊆ ℕ0) | |
| 30 | evl1gsumadd.f | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ 𝑌) finSupp 0 ) | |
| 31 | 12 | eqcomd 2768 | . . . . . . 7 ⊢ (𝜑 → (Poly1‘(𝑅 ↾s 𝐾)) = 𝑊) |
| 32 | 31 | fveq2d 6871 | . . . . . 6 ⊢ (𝜑 → (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = (0g‘𝑊)) |
| 33 | evl1gsumadd.0 | . . . . . 6 ⊢ 0 = (0g‘𝑊) | |
| 34 | 32, 33 | eqtr4di 2815 | . . . . 5 ⊢ (𝜑 → (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = 0 ) |
| 35 | 30, 34 | breqtrrd 5128 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ 𝑌) finSupp (0g‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 36 | 14, 2, 15, 16, 17, 18, 19, 7, 22, 28, 29, 35 | evls1gsumadd 22384 | . . 3 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘((Poly1‘(𝑅 ↾s 𝐾)) Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)))) |
| 37 | 13, 36 | eqtrd 2797 | . 2 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)))) |
| 38 | 4 | fveq1d 6869 | . . . . 5 ⊢ (𝜑 → (𝑄‘𝑌) = ((𝑅 evalSub1 𝐾)‘𝑌)) |
| 39 | 38 | eqcomd 2768 | . . . 4 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘𝑌) = (𝑄‘𝑌)) |
| 40 | 39 | mpteq2dv 5194 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)) = (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌))) |
| 41 | 40 | oveq2d 7412 | . 2 ⊢ (𝜑 → (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌)))) |
| 42 | 5, 37, 41 | 3eqtrd 2801 | 1 ⊢ (𝜑 → (𝑄‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ⊆ wss 3904 class class class wbr 5100 ↦ cmpt 5181 ‘cfv 6521 (class class class)co 7396 finSupp cfsupp 9307 ℕ0cn0 12481 Basecbs 17245 ↾s cress 17266 0gc0g 17468 Σg cgsu 17469 ↑s cpws 17475 Ringcrg 20279 CRingccrg 20280 SubRingcsubrg 20615 Poly1cpl1 22236 evalSub1 ces1 22373 eval1ce1 22374 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-iin 4952 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-isom 6530 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-of 7660 df-ofr 7661 df-om 7847 df-1st 7970 df-2nd 7971 df-supp 8141 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-2o 8438 df-er 8678 df-map 8810 df-pm 8811 df-ixp 8880 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-fsupp 9308 df-sup 9388 df-oi 9458 df-card 9897 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-n0 12482 df-z 12569 df-dec 12689 df-uz 12840 df-fz 13513 df-fzo 13660 df-seq 14015 df-hash 14344 df-struct 17183 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-mulr 17300 df-sca 17302 df-vsca 17303 df-ip 17304 df-tset 17305 df-ple 17306 df-ds 17308 df-hom 17310 df-cco 17311 df-0g 17470 df-gsum 17471 df-prds 17476 df-pws 17478 df-mre 17614 df-mrc 17615 df-acs 17617 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-mhm 18817 df-submnd 18818 df-grp 18978 df-minusg 18979 df-sbg 18980 df-mulg 19110 df-subg 19165 df-ghm 19254 df-cntz 19357 df-cmn 19822 df-abl 19823 df-mgp 20187 df-rng 20199 df-ur 20228 df-srg 20233 df-ring 20281 df-cring 20282 df-rhm 20517 df-subrng 20592 df-subrg 20616 df-lmod 20926 df-lss 20996 df-lsp 21036 df-assa 21902 df-asp 21903 df-ascl 21904 df-psr 21958 df-mvr 21959 df-mpl 21960 df-opsr 21962 df-evls 22124 df-evl 22125 df-psr1 22239 df-ply1 22241 df-evls1 22375 df-evl1 22376 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |