| 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 2765 | . . 3 ⊢ (coeff‘𝐹) = (coeff‘𝐹) | |
| 2 | 1 | dgrval 26342 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) = sup((◡(coeff‘𝐹) “ (ℂ ∖ {0})), ℕ0, < )) |
| 3 | nn0ssre 12496 | . . . . 5 ⊢ ℕ0 ⊆ ℝ | |
| 4 | ltso 11278 | . . . . 5 ⊢ < Or ℝ | |
| 5 | soss 5579 | . . . . 5 ⊢ (ℕ0 ⊆ ℝ → ( < Or ℝ → < Or ℕ0)) | |
| 6 | 3, 4, 5 | mp2 9 | . . . 4 ⊢ < Or ℕ0 |
| 7 | 6 | a1i 11 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → < Or ℕ0) |
| 8 | 0zd 12591 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 0 ∈ ℤ) | |
| 9 | cnvimass 6074 | . . . . 5 ⊢ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ⊆ dom (coeff‘𝐹) | |
| 10 | 1 | coef 26344 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐹):ℕ0⟶(𝑆 ∪ {0})) |
| 11 | 9, 10 | fssdm 6715 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ⊆ ℕ0) |
| 12 | 1 | dgrlem 26343 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → ((coeff‘𝐹):ℕ0⟶(𝑆 ∪ {0}) ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)) |
| 13 | 12 | simprd 500 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) |
| 14 | nn0uz 12888 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 15 | 14 | uzsupss 12952 | . . . 4 ⊢ ((0 ∈ ℤ ∧ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ⊆ ℕ0 ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 16 | 8, 11, 13, 15 | syl3anc 1394 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡(coeff‘𝐹) “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 17 | 7, 16 | supcl 9406 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → sup((◡(coeff‘𝐹) “ (ℂ ∖ {0})), ℕ0, < ) ∈ ℕ0) |
| 18 | 2, 17 | eqeltrd 2865 | 1 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∈ wcel 2145 ∀wral 3079 ∃wrex 3089 ∖ cdif 3904 ∪ cun 3905 ⊆ wss 3907 {csn 4585 class class class wbr 5104 Or wor 5558 ◡ccnv 5650 “ cima 5654 ⟶wf 6521 ‘cfv 6525 supcsup 9388 ℂcc 11086 ℝcr 11087 0cc0 11088 < clt 11231 ≤ cle 11232 ℕ0cn0 12492 ℤcz 12579 Polycply 26298 coeffccoe 26300 degcdgr 26301 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-inf2 9598 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-of 7664 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-map 8814 df-pm 8815 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-inf 9391 df-oi 9460 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12222 df-2 12291 df-3 12292 df-n0 12493 df-z 12580 df-uz 12851 df-rp 13005 df-fz 13524 df-fzo 13671 df-fl 13813 df-seq 14026 df-exp 14086 df-hash 14355 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-clim 15527 df-rlim 15528 df-sum 15726 df-0p 25786 df-ply 26302 df-coe 26304 df-dgr 26305 |
| This theorem is referenced by: dgrub 26348 dgrub2 26349 dgrlb 26350 coeidlem 26351 plyco 26355 dgreq 26358 0dgr 26359 dgrnznn 26361 coefv0 26362 coeaddlem 26363 coemullem 26364 coemulhi 26368 dgreq0 26379 dgrlt 26380 dgradd2 26382 dgrmul 26384 dgrmulc 26385 dgrcolem2 26388 dgrco 26389 plycj 26391 coecj 26392 plycjOLD 26393 coecjOLD 26394 plymul0or 26396 dvply2g 26403 plydivlem3 26413 plydivlem4 26414 plydivex 26415 plydiveu 26416 plyrem 26423 fta1lem 26425 fta1 26426 quotcan 26427 vieta1lem1 26428 vieta1lem2 26429 elqaalem2 26438 elqaalem3 26439 aareccl 26444 aannenlem1 26446 aannenlem2 26447 aalioulem1 26450 aaliou2 26458 taylply2 26485 signsplypnf 34849 signsply0 34850 dgraa0p 43733 mpaaeu 43734 elaa2lem 46806 etransclem46 46853 etransclem47 46854 etransclem48 46855 cjnpoly 47482 |
| Copyright terms: Public domain | W3C validator |