| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dgrcl | Structured version Visualization version GIF version | ||
| Description: The degree of any polynomial is a nonnegative integer. (Contributed by Mario Carneiro, 22-Jul-2014.) |
| Ref | Expression |
|---|---|
| dgrcl | ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . 3 ⊢ (coeff‘𝐹) = (coeff‘𝐹) | |
| 2 | 1 | dgrval 26366 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) = sup((◡(coeff‘𝐹) “ (ℂ ∖ {0})), ℕ0, < )) |
| 3 | nn0ssre 12509 | . . . . 5 ⊢ ℕ0 ⊆ ℝ | |
| 4 | ltso 11291 | . . . . 5 ⊢ < Or ℝ | |
| 5 | soss 5591 | . . . . 5 ⊢ (ℕ0 ⊆ ℝ → ( < Or ℝ → < Or ℕ0)) | |
| 6 | 3, 4, 5 | mp2 9 | . . . 4 ⊢ < Or ℕ0 |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → < Or ℕ0) |
| 8 | 0zd 12604 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 0 ∈ ℤ) | |
| 9 | cnvimass 6086 | . . . . 5 ⊢ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ⊆ dom (coeff‘𝐹) | |
| 10 | 1 | coef 26368 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐹):ℕ0⟶(𝑆 ∪ {0})) |
| 11 | 9, 10 | fssdm 6727 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ⊆ ℕ0) |
| 12 | 1 | dgrlem 26367 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → ((coeff‘𝐹):ℕ0⟶(𝑆 ∪ {0}) ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)) |
| 13 | 12 | simprd 500 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) |
| 14 | nn0uz 12901 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 15 | 14 | uzsupss 12965 | . . . 4 ⊢ ((0 ∈ ℤ ∧ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ⊆ ℕ0 ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 16 | 8, 11, 13, 15 | syl3anc 1398 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 17 | 7, 16 | supcl 9419 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → sup((◡(coeff‘𝐹) “ (ℂ ∖ {0})), ℕ0, < ) ∈ ℕ0) |
| 18 | 2, 17 | eqeltrd 2863 | 1 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∈ wcel 2143 ∀wral 3079 ∃wrex 3089 ∖ cdif 3903 ∪ cun 3904 ⊆ wss 3906 {csn 4590 class class class wbr 5110 Or wor 5570 ◡ccnv 5662 “ cima 5666 ⟶wf 6534 ‘cfv 6538 supcsup 9401 ℂcc 11099 ℝcr 11100 0cc0 11101 < clt 11244 ≤ cle 11245 ℕ0cn0 12505 ℤcz 12592 Polycply 26322 coeffccoe 26324 degcdgr 26325 |
| 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 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-inf2 9611 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179 |
| 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 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7676 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-er 8695 df-map 8827 df-pm 8828 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-inf 9404 df-oi 9473 df-card 9926 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-n0 12506 df-z 12593 df-uz 12864 df-rp 13018 df-fz 13537 df-fzo 13685 df-fl 13827 df-seq 14040 df-exp 14100 df-hash 14369 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-clim 15541 df-rlim 15542 df-sum 15740 df-0p 25810 df-ply 26326 df-coe 26328 df-dgr 26329 |
| This theorem is referenced by: dgrub 26372 dgrub2 26373 dgrlb 26374 coeidlem 26375 plyco 26379 dgreq 26382 0dgr 26383 dgrnznn 26385 coefv0 26386 coeaddlem 26387 coemullem 26388 coemulhi 26392 dgreq0 26403 dgrlt 26404 dgradd2 26406 dgrmul 26408 dgrmulc 26409 dgrcolem2 26412 dgrco 26413 plycj 26415 coecj 26416 plycjOLD 26417 coecjOLD 26418 plymul0or 26420 dvply2g 26427 plydivlem3 26437 plydivlem4 26438 plydivex 26439 plydiveu 26440 plyrem 26447 fta1lem 26449 fta1 26450 quotcan 26451 vieta1lem1 26452 vieta1lem2 26453 elqaalem2 26462 elqaalem3 26463 aareccl 26470 aannenlem1 26472 aannenlem2 26473 aalioulem1 26476 aaliou2 26484 taylply2 26512 signsplypnf 34918 signsply0 34919 dgraa0p 43859 mpaaeu 43860 elaa2lem 46930 etransclem46 46977 etransclem47 46978 etransclem48 46979 cjnpoly 47609 |
| Copyright terms: Public domain | W3C validator |