| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dgrub | Structured version Visualization version GIF version | ||
| Description: If the 𝑀-th coefficient of 𝐹 is nonzero, then the degree of 𝐹 is at least 𝑀. (Contributed by Mario Carneiro, 22-Jul-2014.) |
| Ref | Expression |
|---|---|
| dgrub.1 | ⊢ 𝐴 = (coeff‘𝐹) |
| dgrub.2 | ⊢ 𝑁 = (deg‘𝐹) |
| Ref | Expression |
|---|---|
| dgrub | ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ≤ 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp2 1153 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ∈ ℕ0) | |
| 2 | 1 | nn0red 12566 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ∈ ℝ) |
| 3 | simp1 1152 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝐹 ∈ (Poly‘𝑆)) | |
| 4 | dgrub.2 | . . . . 5 ⊢ 𝑁 = (deg‘𝐹) | |
| 5 | dgrcl 26359 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) | |
| 6 | 4, 5 | eqeltrid 2873 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ0) |
| 7 | 3, 6 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 ∈ ℕ0) |
| 8 | 7 | nn0red 12566 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 ∈ ℝ) |
| 9 | dgrub.1 | . . . . . 6 ⊢ 𝐴 = (coeff‘𝐹) | |
| 10 | 9 | dgrval 26354 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 11 | 4, 10 | eqtrid 2816 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 12 | 3, 11 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 13 | 9 | coef3 26358 | . . . . . . . 8 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶ℂ) |
| 14 | 3, 13 | syl 18 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝐴:ℕ0⟶ℂ) |
| 15 | 14, 1 | ffvelcdmd 7081 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ∈ ℂ) |
| 16 | simp3 1154 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ≠ 0) | |
| 17 | eldifsn 4758 | . . . . . 6 ⊢ ((𝐴‘𝑀) ∈ (ℂ ∖ {0}) ↔ ((𝐴‘𝑀) ∈ ℂ ∧ (𝐴‘𝑀) ≠ 0)) | |
| 18 | 15, 16, 17 | sylanbrc 594 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ∈ (ℂ ∖ {0})) |
| 19 | 9 | coef 26356 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶(𝑆 ∪ {0})) |
| 20 | ffn 6706 | . . . . . 6 ⊢ (𝐴:ℕ0⟶(𝑆 ∪ {0}) → 𝐴 Fn ℕ0) | |
| 21 | elpreima 7054 | . . . . . 6 ⊢ (𝐴 Fn ℕ0 → (𝑀 ∈ (◡𝐴 “ (ℂ ∖ {0})) ↔ (𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ∈ (ℂ ∖ {0})))) | |
| 22 | 3, 19, 20, 21 | 4syl 20 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝑀 ∈ (◡𝐴 “ (ℂ ∖ {0})) ↔ (𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ∈ (ℂ ∖ {0})))) |
| 23 | 1, 18, 22 | mpbir2and 725 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ∈ (◡𝐴 “ (ℂ ∖ {0}))) |
| 24 | nn0ssre 12508 | . . . . . . 7 ⊢ ℕ0 ⊆ ℝ | |
| 25 | ltso 11290 | . . . . . . 7 ⊢ < Or ℝ | |
| 26 | soss 5590 | . . . . . . 7 ⊢ (ℕ0 ⊆ ℝ → ( < Or ℝ → < Or ℕ0)) | |
| 27 | 24, 25, 26 | mp2 9 | . . . . . 6 ⊢ < Or ℕ0 |
| 28 | 27 | a1i 11 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → < Or ℕ0) |
| 29 | 0zd 12603 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 0 ∈ ℤ) | |
| 30 | cnvimass 6085 | . . . . . . 7 ⊢ (◡𝐴 “ (ℂ ∖ {0})) ⊆ dom 𝐴 | |
| 31 | 30, 19 | fssdm 6726 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → (◡𝐴 “ (ℂ ∖ {0})) ⊆ ℕ0) |
| 32 | 9 | dgrlem 26355 | . . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴:ℕ0⟶(𝑆 ∪ {0}) ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)) |
| 33 | 32 | simprd 500 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) |
| 34 | nn0uz 12900 | . . . . . . 7 ⊢ ℕ0 = (ℤ≥‘0) | |
| 35 | 34 | uzsupss 12964 | . . . . . 6 ⊢ ((0 ∈ ℤ ∧ (◡𝐴 “ (ℂ ∖ {0})) ⊆ ℕ0 ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 36 | 29, 31, 33, 35 | syl3anc 1396 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 37 | 28, 36 | supub 9419 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝑀 ∈ (◡𝐴 “ (ℂ ∖ {0})) → ¬ sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ) < 𝑀)) |
| 38 | 3, 23, 37 | sylc 66 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → ¬ sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ) < 𝑀) |
| 39 | 12, 38 | eqnbrtrd 5133 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → ¬ 𝑁 < 𝑀) |
| 40 | 2, 8, 39 | nltled 11360 | 1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ≤ 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ∃wrex 3095 ∖ cdif 3910 ∪ cun 3911 ⊆ wss 3913 {csn 4594 class class class wbr 5113 Or wor 5569 ◡ccnv 5661 “ cima 5665 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 supcsup 9400 ℂcc 11098 ℝcr 11099 0cc0 11100 < clt 11243 ≤ cle 11244 ℕ0cn0 12504 ℤcz 12591 Polycply 26310 coeffccoe 26312 degcdgr 26313 |
| 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-inf2 9610 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 ax-pre-sup 11178 |
| 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-op 4601 df-uni 4877 df-int 4917 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-se 5616 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-isom 6546 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-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-er 8694 df-map 8826 df-pm 8827 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-sup 9402 df-inf 9403 df-oi 9472 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-n0 12505 df-z 12592 df-uz 12863 df-rp 13017 df-fz 13536 df-fzo 13683 df-fl 13825 df-seq 14038 df-exp 14098 df-hash 14367 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-clim 15539 df-rlim 15540 df-sum 15738 df-0p 25798 df-ply 26314 df-coe 26316 df-dgr 26317 |
| This theorem is referenced by: dgrub2 26361 coeidlem 26363 coeid3 26366 dgreq 26370 coemullem 26376 coemulhi 26380 coemulc 26381 dgreq0 26391 dgrlt 26392 dgradd2 26394 dgrmul 26396 vieta1lem2 26441 aannenlem2 26459 |
| Copyright terms: Public domain | W3C validator |