| 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 22484. (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 22491 | . . . 4 ⊢ 𝑄 = (𝑅 evalSub1 𝐾) |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → 𝑄 = (𝑅 evalSub1 𝐾)) |
| 5 | 4 | fveq1d 6883 | . 2 ⊢ (𝜑 → (𝑄‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌)))) |
| 6 | evl1gsumadd.w | . . . . 5 ⊢ 𝑊 = (Poly1‘𝑅) | |
| 7 | evl1gsumadd.r | . . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ CRing) | |
| 8 | 2 | ressid 17299 | . . . . . . . 8 ⊢ (𝑅 ∈ CRing → (𝑅 ↾s 𝐾) = 𝑅) |
| 9 | 7, 8 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (𝑅 ↾s 𝐾) = 𝑅) |
| 10 | 9 | eqcomd 2769 | . . . . . 6 ⊢ (𝜑 → 𝑅 = (𝑅 ↾s 𝐾)) |
| 11 | 10 | fveq2d 6885 | . . . . 5 ⊢ (𝜑 → (Poly1‘𝑅) = (Poly1‘(𝑅 ↾s 𝐾))) |
| 12 | 6, 11 | eqtrid 2810 | . . . 4 ⊢ (𝜑 → 𝑊 = (Poly1‘(𝑅 ↾s 𝐾))) |
| 13 | 12 | fvoveq1d 7432 | . . 3 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = ((𝑅 evalSub1 𝐾)‘((Poly1‘(𝑅 ↾s 𝐾)) Σg (𝑥 ∈ 𝑁 ↦ 𝑌)))) |
| 14 | eqid 2763 | . . . 4 ⊢ (𝑅 evalSub1 𝐾) = (𝑅 evalSub1 𝐾) | |
| 15 | eqid 2763 | . . . 4 ⊢ (Poly1‘(𝑅 ↾s 𝐾)) = (Poly1‘(𝑅 ↾s 𝐾)) | |
| 16 | eqid 2763 | . . . 4 ⊢ (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = (0g‘(Poly1‘(𝑅 ↾s 𝐾))) | |
| 17 | eqid 2763 | . . . 4 ⊢ (𝑅 ↾s 𝐾) = (𝑅 ↾s 𝐾) | |
| 18 | evl1gsumadd.p | . . . 4 ⊢ 𝑃 = (𝑅 ↑s 𝐾) | |
| 19 | eqid 2763 | . . . 4 ⊢ (Base‘(Poly1‘(𝑅 ↾s 𝐾))) = (Base‘(Poly1‘(𝑅 ↾s 𝐾))) | |
| 20 | crngring 20322 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 21 | 2 | subrgid 20672 | . . . . 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 6885 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (Base‘𝑊) = (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 27 | 24, 26 | eqtrid 2810 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐵 = (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 28 | 23, 27 | eleqtrd 2865 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑌 ∈ (Base‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 29 | evl1gsumadd.n | . . . 4 ⊢ (𝜑 → 𝑁 ⊆ ℕ0) | |
| 30 | evl1gsumadd.f | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ 𝑌) finSupp 0 ) | |
| 31 | 12 | eqcomd 2769 | . . . . . . 7 ⊢ (𝜑 → (Poly1‘(𝑅 ↾s 𝐾)) = 𝑊) |
| 32 | 31 | fveq2d 6885 | . . . . . 6 ⊢ (𝜑 → (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = (0g‘𝑊)) |
| 33 | evl1gsumadd.0 | . . . . . 6 ⊢ 0 = (0g‘𝑊) | |
| 34 | 32, 33 | eqtr4di 2816 | . . . . 5 ⊢ (𝜑 → (0g‘(Poly1‘(𝑅 ↾s 𝐾))) = 0 ) |
| 35 | 30, 34 | breqtrrd 5139 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ 𝑌) finSupp (0g‘(Poly1‘(𝑅 ↾s 𝐾)))) |
| 36 | 14, 2, 15, 16, 17, 18, 19, 7, 22, 28, 29, 35 | evls1gsumadd 22484 | . . 3 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘((Poly1‘(𝑅 ↾s 𝐾)) Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)))) |
| 37 | 13, 36 | eqtrd 2798 | . 2 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)))) |
| 38 | 4 | fveq1d 6883 | . . . . 5 ⊢ (𝜑 → (𝑄‘𝑌) = ((𝑅 evalSub1 𝐾)‘𝑌)) |
| 39 | 38 | eqcomd 2769 | . . . 4 ⊢ (𝜑 → ((𝑅 evalSub1 𝐾)‘𝑌) = (𝑄‘𝑌)) |
| 40 | 39 | mpteq2dv 5205 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌)) = (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌))) |
| 41 | 40 | oveq2d 7426 | . 2 ⊢ (𝜑 → (𝑃 Σg (𝑥 ∈ 𝑁 ↦ ((𝑅 evalSub1 𝐾)‘𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌)))) |
| 42 | 5, 37, 41 | 3eqtrd 2802 | 1 ⊢ (𝜑 → (𝑄‘(𝑊 Σg (𝑥 ∈ 𝑁 ↦ 𝑌))) = (𝑃 Σg (𝑥 ∈ 𝑁 ↦ (𝑄‘𝑌)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ⊆ wss 3905 class class class wbr 5109 ↦ cmpt 5192 ‘cfv 6536 (class class class)co 7410 finSupp cfsupp 9317 ℕ0cn0 12499 Basecbs 17264 ↾s cress 17285 0gc0g 17487 Σg cgsu 17488 ↑s cpws 17494 Ringcrg 20310 CRingccrg 20311 SubRingcsubrg 20668 Poly1cpl1 22337 evalSub1 ces1 22473 eval1ce1 22474 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-ofr 7675 df-om 7859 df-1st 7982 df-2nd 7983 df-supp 8153 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-map 8822 df-pm 8823 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9318 df-sup 9398 df-oi 9468 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-2 12298 df-3 12299 df-4 12300 df-5 12301 df-6 12302 df-7 12303 df-8 12304 df-9 12305 df-n0 12500 df-z 12587 df-dec 12707 df-uz 12858 df-fz 13531 df-fzo 13679 df-seq 14034 df-hash 14363 df-struct 17202 df-sets 17219 df-slot 17237 df-ndx 17249 df-base 17265 df-ress 17286 df-plusg 17318 df-mulr 17319 df-sca 17321 df-vsca 17322 df-ip 17323 df-tset 17324 df-ple 17325 df-ds 17327 df-hom 17329 df-cco 17330 df-0g 17489 df-gsum 17490 df-prds 17495 df-pws 17497 df-mre 17633 df-mrc 17634 df-acs 17636 df-mgm 18693 df-sgrp 18772 df-mnd 18788 df-mhm 18836 df-submnd 18837 df-grp 18998 df-minusg 18999 df-sbg 19000 df-mulg 19129 df-subg 19184 df-ghm 19279 df-cntz 19382 df-cmn 19847 df-abl 19848 df-mgp 20212 df-rng 20226 df-ur 20259 df-srg 20264 df-ring 20312 df-cring 20313 df-rhm 20550 df-subrng 20645 df-subrg 20669 df-lmod 20983 df-lss 21053 df-lsp 21093 df-assa 22003 df-asp 22004 df-ascl 22005 df-psr 22059 df-mvr 22060 df-mpl 22061 df-opsr 22063 df-evls 22225 df-evl 22226 df-psr1 22340 df-ply1 22342 df-evls1 22475 df-evl1 22476 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |