| 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 2769 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | mdegvsca.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑌) | |
| 5 | eqid 2769 | . . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | eqid 2769 | . . . . . . 7 ⊢ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} = {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} | |
| 7 | mdegvsca.e | . . . . . . . . 9 ⊢ 𝐸 = (RLReg‘𝑅) | |
| 8 | 7, 3 | rrgss 20787 | . . . . . . . 8 ⊢ 𝐸 ⊆ (Base‘𝑅) |
| 9 | mdegvsca.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ 𝐸) | |
| 10 | 8, 9 | sselid 3943 | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (Base‘𝑅)) |
| 11 | mdegvsca.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 12 | 1, 2, 3, 4, 5, 6, 10, 11 | mplvsca 22133 | . . . . . 6 ⊢ (𝜑 → (𝐹 · 𝐺) = (({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺)) |
| 13 | 12 | oveq1d 7426 | . . . . 5 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅))) |
| 14 | eqid 2769 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 15 | ovex 7444 | . . . . . . . 8 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
| 16 | 15 | rabex 5310 | . . . . . . 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 22116 | . . . . . 6 ⊢ (𝜑 → 𝐺:{𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
| 20 | 7, 3, 5, 14, 17, 18, 9, 19 | rrgsupp 20786 | . . . . 5 ⊢ (𝜑 → ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
| 21 | 13, 20 | eqtrd 2804 | . . . 4 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
| 22 | 21 | imaeq2d 6063 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))) = ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅)))) |
| 23 | 22 | supeq1d 9406 | . 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 22143 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ LMod) |
| 26 | 1, 24, 18 | mplsca 22131 | . . . . . 6 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑌)) |
| 27 | 26 | fveq2d 6886 | . . . . 5 ⊢ (𝜑 → (Base‘𝑅) = (Base‘(Scalar‘𝑌))) |
| 28 | 10, 27 | eleqtrd 2871 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (Base‘(Scalar‘𝑌))) |
| 29 | eqid 2769 | . . . . 5 ⊢ (Scalar‘𝑌) = (Scalar‘𝑌) | |
| 30 | eqid 2769 | . . . . 5 ⊢ (Base‘(Scalar‘𝑌)) = (Base‘(Scalar‘𝑌)) | |
| 31 | 4, 29, 2, 30 | lmodvscl 20977 | . . . 4 ⊢ ((𝑌 ∈ LMod ∧ 𝐹 ∈ (Base‘(Scalar‘𝑌)) ∧ 𝐺 ∈ 𝐵) → (𝐹 · 𝐺) ∈ 𝐵) |
| 32 | 25, 28, 11, 31 | syl3anc 1396 | . . 3 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
| 33 | mdegaddle.d | . . . 4 ⊢ 𝐷 = (𝐼 mDeg 𝑅) | |
| 34 | eqid 2769 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) = (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) | |
| 35 | 33, 1, 4, 14, 6, 34 | mdegval 26189 | . . 3 ⊢ ((𝐹 · 𝐺) ∈ 𝐵 → (𝐷‘(𝐹 · 𝐺)) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < )) |
| 36 | 32, 35 | syl 18 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < )) |
| 37 | 33, 1, 4, 14, 6, 34 | mdegval 26189 | . . 3 ⊢ (𝐺 ∈ 𝐵 → (𝐷‘𝐺) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
| 38 | 11, 37 | syl 18 | . 2 ⊢ (𝜑 → (𝐷‘𝐺) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
| 39 | 23, 36, 38 | 3eqtr4d 2814 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = (𝐷‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 {crab 3423 Vcvv 3463 {csn 4594 ↦ cmpt 5196 × cxp 5660 ◡ccnv 5661 “ cima 5665 ‘cfv 6537 (class class class)co 7411 ∘f cof 7673 supp csupp 8156 ↑m cmap 8824 Fincfn 8943 supcsup 9400 ℝ*cxr 11242 < clt 11243 ℕcn 12233 ℕ0cn0 12504 Basecbs 17269 .rcmulr 17311 Scalarcsca 17313 ·𝑠 cvsca 17314 0gc0g 17492 Σg cgsu 17493 Ringcrg 20315 RLRegcrlreg 20776 LModclmod 20959 ℂfldccnfld 21491 mPoly cmpl 22025 mDeg cmdg 26179 |
| 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 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| 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-iun 4962 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-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-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8157 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-er 8694 df-map 8826 df-ixp 8896 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fsupp 9322 df-sup 9402 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-fz 13536 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-sca 17326 df-vsca 17327 df-ip 17328 df-tset 17329 df-ple 17330 df-ds 17332 df-hom 17334 df-cco 17335 df-0g 17494 df-prds 17500 df-pws 17502 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-grp 19003 df-minusg 19004 df-sbg 19005 df-subg 19189 df-cmn 19852 df-abl 19853 df-mgp 20217 df-rng 20231 df-ur 20264 df-ring 20317 df-rlreg 20779 df-lmod 20961 df-lss 21031 df-psr 22028 df-mpl 22030 df-mdeg 26181 |
| This theorem is referenced by: deg1vsca 26231 |
| Copyright terms: Public domain | W3C validator |