| 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 2736 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 4 | mdegvsca.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑌) | |
| 5 | eqid 2736 | . . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 6 | eqid 2736 | . . . . . . 7 ⊢ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} = {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} | |
| 7 | mdegvsca.e | . . . . . . . . 9 ⊢ 𝐸 = (RLReg‘𝑅) | |
| 8 | 7, 3 | rrgss 20635 | . . . . . . . 8 ⊢ 𝐸 ⊆ (Base‘𝑅) |
| 9 | mdegvsca.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ 𝐸) | |
| 10 | 8, 9 | sselid 3931 | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (Base‘𝑅)) |
| 11 | mdegvsca.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 12 | 1, 2, 3, 4, 5, 6, 10, 11 | mplvsca 21970 | . . . . . 6 ⊢ (𝜑 → (𝐹 · 𝐺) = (({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺)) |
| 13 | 12 | oveq1d 7373 | . . . . 5 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅))) |
| 14 | eqid 2736 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 15 | ovex 7391 | . . . . . . . 8 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
| 16 | 15 | rabex 5284 | . . . . . . 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 21953 | . . . . . 6 ⊢ (𝜑 → 𝐺:{𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
| 20 | 7, 3, 5, 14, 17, 18, 9, 19 | rrgsupp 20634 | . . . . 5 ⊢ (𝜑 → ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
| 21 | 13, 20 | eqtrd 2771 | . . . 4 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
| 22 | 21 | imaeq2d 6019 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))) = ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅)))) |
| 23 | 22 | supeq1d 9349 | . 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 21979 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ LMod) |
| 26 | 1, 24, 18 | mplsca 21968 | . . . . . 6 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑌)) |
| 27 | 26 | fveq2d 6838 | . . . . 5 ⊢ (𝜑 → (Base‘𝑅) = (Base‘(Scalar‘𝑌))) |
| 28 | 10, 27 | eleqtrd 2838 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (Base‘(Scalar‘𝑌))) |
| 29 | eqid 2736 | . . . . 5 ⊢ (Scalar‘𝑌) = (Scalar‘𝑌) | |
| 30 | eqid 2736 | . . . . 5 ⊢ (Base‘(Scalar‘𝑌)) = (Base‘(Scalar‘𝑌)) | |
| 31 | 4, 29, 2, 30 | lmodvscl 20829 | . . . 4 ⊢ ((𝑌 ∈ LMod ∧ 𝐹 ∈ (Base‘(Scalar‘𝑌)) ∧ 𝐺 ∈ 𝐵) → (𝐹 · 𝐺) ∈ 𝐵) |
| 32 | 25, 28, 11, 31 | syl3anc 1373 | . . 3 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
| 33 | mdegaddle.d | . . . 4 ⊢ 𝐷 = (𝐼 mDeg 𝑅) | |
| 34 | eqid 2736 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) = (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) | |
| 35 | 33, 1, 4, 14, 6, 34 | mdegval 26024 | . . 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 26024 | . . 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 2781 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = (𝐷‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 {crab 3399 Vcvv 3440 {csn 4580 ↦ cmpt 5179 × cxp 5622 ◡ccnv 5623 “ cima 5627 ‘cfv 6492 (class class class)co 7358 ∘f cof 7620 supp csupp 8102 ↑m cmap 8763 Fincfn 8883 supcsup 9343 ℝ*cxr 11165 < clt 11166 ℕcn 12145 ℕ0cn0 12401 Basecbs 17136 .rcmulr 17178 Scalarcsca 17180 ·𝑠 cvsca 17181 0gc0g 17359 Σg cgsu 17360 Ringcrg 20168 RLRegcrlreg 20624 LModclmod 20811 ℂfldccnfld 21309 mPoly cmpl 21862 mDeg cmdg 26014 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8103 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8765 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-sup 9345 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-9 12215 df-n0 12402 df-z 12489 df-dec 12608 df-uz 12752 df-fz 13424 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-sca 17193 df-vsca 17194 df-ip 17195 df-tset 17196 df-ple 17197 df-ds 17199 df-hom 17201 df-cco 17202 df-0g 17361 df-prds 17367 df-pws 17369 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-sbg 18868 df-subg 19053 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-rlreg 20627 df-lmod 20813 df-lss 20883 df-psr 21865 df-mpl 21867 df-mdeg 26016 |
| This theorem is referenced by: deg1vsca 26066 |
| Copyright terms: Public domain | W3C validator |