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 2821 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
4 | mdegvsca.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑌) | |
5 | eqid 2821 | . . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
6 | eqid 2821 | . . . . . . 7 ⊢ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} = {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} | |
7 | mdegvsca.e | . . . . . . . . 9 ⊢ 𝐸 = (RLReg‘𝑅) | |
8 | 7, 3 | rrgss 20059 | . . . . . . . 8 ⊢ 𝐸 ⊆ (Base‘𝑅) |
9 | mdegvsca.f | . . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ 𝐸) | |
10 | 8, 9 | sseldi 3964 | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ (Base‘𝑅)) |
11 | mdegvsca.g | . . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
12 | 1, 2, 3, 4, 5, 6, 10, 11 | mplvsca 20221 | . . . . . 6 ⊢ (𝜑 → (𝐹 · 𝐺) = (({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺)) |
13 | 12 | oveq1d 7165 | . . . . 5 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅))) |
14 | eqid 2821 | . . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
15 | ovex 7183 | . . . . . . . 8 ⊢ (ℕ0 ↑m 𝐼) ∈ V | |
16 | 15 | rabex 5227 | . . . . . . 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 20207 | . . . . . 6 ⊢ (𝜑 → 𝐺:{𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin}⟶(Base‘𝑅)) |
20 | 7, 3, 5, 14, 17, 18, 9, 19 | rrgsupp 20058 | . . . . 5 ⊢ (𝜑 → ((({𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} × {𝐹}) ∘f (.r‘𝑅)𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
21 | 13, 20 | eqtrd 2856 | . . . 4 ⊢ (𝜑 → ((𝐹 · 𝐺) supp (0g‘𝑅)) = (𝐺 supp (0g‘𝑅))) |
22 | 21 | imaeq2d 5923 | . . 3 ⊢ (𝜑 → ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))) = ((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅)))) |
23 | 22 | supeq1d 8904 | . 2 ⊢ (𝜑 → sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < ) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
24 | mdegaddle.i | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑉) | |
25 | 1 | mpllmod 20225 | . . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ Ring) → 𝑌 ∈ LMod) |
26 | 24, 18, 25 | syl2anc 586 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ LMod) |
27 | 1, 24, 18 | mplsca 20219 | . . . . . 6 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑌)) |
28 | 27 | fveq2d 6668 | . . . . 5 ⊢ (𝜑 → (Base‘𝑅) = (Base‘(Scalar‘𝑌))) |
29 | 10, 28 | eleqtrd 2915 | . . . 4 ⊢ (𝜑 → 𝐹 ∈ (Base‘(Scalar‘𝑌))) |
30 | eqid 2821 | . . . . 5 ⊢ (Scalar‘𝑌) = (Scalar‘𝑌) | |
31 | eqid 2821 | . . . . 5 ⊢ (Base‘(Scalar‘𝑌)) = (Base‘(Scalar‘𝑌)) | |
32 | 4, 30, 2, 31 | lmodvscl 19645 | . . . 4 ⊢ ((𝑌 ∈ LMod ∧ 𝐹 ∈ (Base‘(Scalar‘𝑌)) ∧ 𝐺 ∈ 𝐵) → (𝐹 · 𝐺) ∈ 𝐵) |
33 | 26, 29, 11, 32 | syl3anc 1367 | . . 3 ⊢ (𝜑 → (𝐹 · 𝐺) ∈ 𝐵) |
34 | mdegaddle.d | . . . 4 ⊢ 𝐷 = (𝐼 mDeg 𝑅) | |
35 | eqid 2821 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) = (𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) | |
36 | 34, 1, 4, 14, 6, 35 | mdegval 24651 | . . 3 ⊢ ((𝐹 · 𝐺) ∈ 𝐵 → (𝐷‘(𝐹 · 𝐺)) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < )) |
37 | 33, 36 | syl 17 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ ((𝐹 · 𝐺) supp (0g‘𝑅))), ℝ*, < )) |
38 | 34, 1, 4, 14, 6, 35 | mdegval 24651 | . . 3 ⊢ (𝐺 ∈ 𝐵 → (𝐷‘𝐺) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
39 | 11, 38 | syl 17 | . 2 ⊢ (𝜑 → (𝐷‘𝐺) = sup(((𝑦 ∈ {𝑥 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} ↦ (ℂfld Σg 𝑦)) “ (𝐺 supp (0g‘𝑅))), ℝ*, < )) |
40 | 23, 37, 39 | 3eqtr4d 2866 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 · 𝐺)) = (𝐷‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 {crab 3142 Vcvv 3494 {csn 4560 ↦ cmpt 5138 × cxp 5547 ◡ccnv 5548 “ cima 5552 ‘cfv 6349 (class class class)co 7150 ∘f cof 7401 supp csupp 7824 ↑m cmap 8400 Fincfn 8503 supcsup 8898 ℝ*cxr 10668 < clt 10669 ℕcn 11632 ℕ0cn0 11891 Basecbs 16477 .rcmulr 16560 Scalarcsca 16562 ·𝑠 cvsca 16563 0gc0g 16707 Σg cgsu 16708 Ringcrg 19291 LModclmod 19628 RLRegcrlreg 20046 mPoly cmpl 20127 ℂfldccnfld 20539 mDeg cmdg 24641 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-of 7403 df-om 7575 df-1st 7683 df-2nd 7684 df-supp 7825 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-map 8402 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-fsupp 8828 df-sup 8900 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 df-8 11700 df-9 11701 df-n0 11892 df-z 11976 df-uz 12238 df-fz 12887 df-struct 16479 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 df-plusg 16572 df-mulr 16573 df-sca 16575 df-vsca 16576 df-tset 16578 df-0g 16709 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-grp 18100 df-minusg 18101 df-sbg 18102 df-subg 18270 df-mgp 19234 df-ur 19246 df-ring 19293 df-lmod 19630 df-lss 19698 df-rlreg 20050 df-psr 20130 df-mpl 20132 df-mdeg 24643 |
This theorem is referenced by: deg1vsca 24693 |
Copyright terms: Public domain | W3C validator |