| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mdegvsca | Structured version Visualization version GIF version | ||
| Description: The degree of a scalar multiple of a polynomial is exactly the degree of the original polynomial when the multiple is a nonzero-divisor. (Contributed by Stefan O'Rear, 28-Mar-2015.) (Proof shortened by AV, 27-Jul-2019.) |
| Ref | Expression |
|---|---|
| mdegaddle.y | ⊢ 𝑌 = (𝐼 mPoly 𝑅) |
| mdegaddle.d | ⊢ 𝐷 = (𝐼 mDeg 𝑅) |
| mdegaddle.i | ⊢ (𝜑 → 𝐼 ∈ 𝑉) |
| mdegaddle.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| mdegvsca.b | ⊢ 𝐵 = (Base‘𝑌) |
| mdegvsca.e | ⊢ 𝐸 = (RLReg‘𝑅) |
| mdegvsca.p | ⊢ · = ( ·𝑠 ‘𝑌) |
| mdegvsca.f | ⊢ (𝜑 → 𝐹 ∈ 𝐸) |
| mdegvsca.g | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| mdegvsca | ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = (𝐷‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mdegaddle.y | . . . . . . 7 ⊢ 𝑌 = (𝐼 mPoly 𝑅) | |
| 2 | mdegvsca.p | . . . . . . 7 ⊢ · = ( ·𝑠 ‘𝑌) | |
| 3 | eqid 2737 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | mdegvsca.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑌) | |
| 5 | eqid 2737 | . . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | eqid 2737 | . . . . . . 7 ⊢ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} = {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} | |
| 7 | mdegvsca.e | . . . . . . . . 9 ⊢ 𝐸 = (RLReg‘𝑅) | |
| 8 | 7, 3 | rrgss 20673 | . . . . . . . 8 ⊢ 𝐸 ⊆ (Base‘𝑅) |
| 9 | mdegvsca.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ 𝐸) | |
| 10 | 8, 9 | sselid 3920 | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (Base‘𝑅)) |
| 11 | mdegvsca.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 12 | 1, 2, 3, 4, 5, 6, 10, 11 | mplvsca 22006 | . . . . . 6 ⊢ (𝜑 → (𝐹 · 𝐺) = (({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺)) |
| 13 | 12 | oveq1d 7376 | . . . . 5 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅))) |
| 14 | eqid 2737 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 15 | ovex 7394 | . . . . . . . 8 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
| 16 | 15 | rabex 5277 | . . . . . . 7 ⊢ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ∈ V |
| 17 | 16 | a1i 11 | . . . . . 6 ⊢ (𝜑 → {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ∈ V) |
| 18 | mdegaddle.r | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 19 | 1, 3, 4, 6, 11 | mplelf 21989 | . . . . . 6 ⊢ (𝜑 → 𝐺:{𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
| 20 | 7, 3, 5, 14, 17, 18, 9, 19 | rrgsupp 20672 | . . . . 5 ⊢ (𝜑 → ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
| 21 | 13, 20 | eqtrd 2772 | . . . 4 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
| 22 | 21 | imaeq2d 6020 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))) = ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅)))) |
| 23 | 22 | supeq1d 9353 | . 2 ⊢ (𝜑 → sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < ) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
| 24 | mdegaddle.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
| 25 | 1, 24, 18 | mpllmodd 22015 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ LMod) |
| 26 | 1, 24, 18 | mplsca 22004 | . . . . . 6 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑌)) |
| 27 | 26 | fveq2d 6839 | . . . . 5 ⊢ (𝜑 → (Base‘𝑅) = (Base‘(Scalar‘𝑌))) |
| 28 | 10, 27 | eleqtrd 2839 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (Base‘(Scalar‘𝑌))) |
| 29 | eqid 2737 | . . . . 5 ⊢ (Scalar‘𝑌) = (Scalar‘𝑌) | |
| 30 | eqid 2737 | . . . . 5 ⊢ (Base‘(Scalar‘𝑌)) = (Base‘(Scalar‘𝑌)) | |
| 31 | 4, 29, 2, 30 | lmodvscl 20867 | . . . 4 ⊢ ((𝑌 ∈ LMod ∧ 𝐹 ∈ (Base‘(Scalar‘𝑌)) ∧ 𝐺 ∈ 𝐵) → (𝐹 · 𝐺) ∈ 𝐵) |
| 32 | 25, 28, 11, 31 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
| 33 | mdegaddle.d | . . . 4 ⊢ 𝐷 = (𝐼 mDeg 𝑅) | |
| 34 | eqid 2737 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) = (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) | |
| 35 | 33, 1, 4, 14, 6, 34 | mdegval 26041 | . . 3 ⊢ ((𝐹 · 𝐺) ∈ 𝐵 → (𝐷‘(𝐹 · 𝐺)) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < )) |
| 36 | 32, 35 | syl 17 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < )) |
| 37 | 33, 1, 4, 14, 6, 34 | mdegval 26041 | . . 3 ⊢ (𝐺 ∈ 𝐵 → (𝐷‘𝐺) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
| 38 | 11, 37 | syl 17 | . 2 ⊢ (𝜑 → (𝐷‘𝐺) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
| 39 | 23, 36, 38 | 3eqtr4d 2782 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = (𝐷‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {crab 3390 Vcvv 3430 {csn 4568 ↦ cmpt 5167 × cxp 5623 ◡ccnv 5624 “ cima 5628 ‘cfv 6493 (class class class)co 7361 ∘f cof 7623 supp csupp 8104 ↑m cmap 8767 Fincfn 8887 supcsup 9347 ℝ*cxr 11172 < clt 11173 ℕcn 12168 ℕ0cn0 12431 Basecbs 17173 .rcmulr 17215 Scalarcsca 17217 ·𝑠 cvsca 17218 0gc0g 17396 Σg cgsu 17397 Ringcrg 20208 RLRegcrlreg 20662 LModclmod 20849 ℂfldccnfld 21347 mPoly cmpl 21899 mDeg cmdg 26031 |
| 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 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| 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-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 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-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-of 7625 df-om 7812 df-1st 7936 df-2nd 7937 df-supp 8105 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-ixp 8840 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fsupp 9269 df-sup 9349 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-z 12519 df-dec 12639 df-uz 12783 df-fz 13456 df-struct 17111 df-sets 17128 df-slot 17146 df-ndx 17158 df-base 17174 df-ress 17195 df-plusg 17227 df-mulr 17228 df-sca 17230 df-vsca 17231 df-ip 17232 df-tset 17233 df-ple 17234 df-ds 17236 df-hom 17238 df-cco 17239 df-0g 17398 df-prds 17404 df-pws 17406 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-grp 18906 df-minusg 18907 df-sbg 18908 df-subg 19093 df-cmn 19751 df-abl 19752 df-mgp 20116 df-rng 20128 df-ur 20157 df-ring 20210 df-rlreg 20665 df-lmod 20851 df-lss 20921 df-psr 21902 df-mpl 21904 df-mdeg 26033 |
| This theorem is referenced by: deg1vsca 26083 |
| Copyright terms: Public domain | W3C validator |