| 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 1155 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ∈ ℕ0) | |
| 2 | 1 | nn0red 12671 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ∈ ℝ) |
| 3 | simp1 1154 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝐹 ∈ (Poly‘𝑆)) | |
| 4 | dgrub.2 | . . . . 5 ⊢ 𝑁 = (deg‘𝐹) | |
| 5 | dgrcl 26557 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) | |
| 6 | 4, 5 | eqeltrid 2864 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ0) |
| 7 | 3, 6 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 ∈ ℕ0) |
| 8 | 7 | nn0red 12671 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 ∈ ℝ) |
| 9 | dgrub.1 | . . . . . 6 ⊢ 𝐴 = (coeff‘𝐹) | |
| 10 | 9 | dgrval 26552 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 11 | 4, 10 | eqtrid 2807 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 12 | 3, 11 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 13 | 9 | coef3 26556 | . . . . . . . 8 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶ℂ) |
| 14 | 3, 13 | syl 18 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝐴:ℕ0⟶ℂ) |
| 15 | 14, 1 | ffvelcdmd 7085 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ∈ ℂ) |
| 16 | simp3 1156 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ≠ 0) | |
| 17 | eldifsn 4744 | . . . . . 6 ⊢ ((𝐴‘𝑀) ∈ (ℂ ∖ {0}) ↔ ((𝐴‘𝑀) ∈ ℂ ∧ (𝐴‘𝑀) ≠ 0)) | |
| 18 | 15, 16, 17 | sylanbrc 595 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ∈ (ℂ ∖ {0})) |
| 19 | 9 | coef 26554 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶(𝑆 ∪ {0})) |
| 20 | ffn 6709 | . . . . . 6 ⊢ (𝐴:ℕ0⟶(𝑆 ∪ {0}) → 𝐴 Fn ℕ0) | |
| 21 | elpreima 7057 | . . . . . 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 726 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ∈ (◡𝐴 “ (ℂ ∖ {0}))) |
| 24 | nn0ssre 12613 | . . . . . . 7 ⊢ ℕ0 ⊆ ℝ | |
| 25 | ltso 11393 | . . . . . . 7 ⊢ < Or ℝ | |
| 26 | soss 5578 | . . . . . . 7 ⊢ (ℕ0 ⊆ ℝ → ( < Or ℝ → < Or ℕ0)) | |
| 27 | 24, 25, 26 | mp2 9 | . . . . . 6 ⊢ < Or ℕ0 |
| 28 | 27 | a1i 11 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → < Or ℕ0) |
| 29 | 0zd 12708 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 0 ∈ ℤ) | |
| 30 | cnvimass 6198 | . . . . . . 7 ⊢ (◡𝐴 “ (ℂ ∖ {0})) ⊆ dom 𝐴 | |
| 31 | 30, 19 | fssdm 6729 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → (◡𝐴 “ (ℂ ∖ {0})) ⊆ ℕ0) |
| 32 | 9 | dgrlem 26553 | . . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴:ℕ0⟶(𝑆 ∪ {0}) ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)) |
| 33 | 32 | simprd 501 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) |
| 34 | nn0uz 13006 | . . . . . . 7 ⊢ ℕ0 = (ℤ≥‘0) | |
| 35 | 34 | uzsupss 13070 | . . . . . 6 ⊢ ((0 ∈ ℤ ∧ (◡𝐴 “ (ℂ ∖ {0})) ⊆ ℕ0 ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 36 | 29, 31, 33, 35 | syl3anc 1398 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 (∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0})) ¬ 𝑛 < 𝑥 ∧ ∀𝑥 ∈ ℕ0 (𝑥 < 𝑛 → ∃𝑦 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 < 𝑦))) |
| 37 | 28, 36 | supub 9454 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝑀 ∈ (◡𝐴 “ (ℂ ∖ {0})) → ¬ sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ) < 𝑀)) |
| 38 | 3, 23, 37 | sylc 66 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → ¬ sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ) < 𝑀) |
| 39 | 12, 38 | eqnbrtrd 5122 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → ¬ 𝑁 < 𝑀) |
| 40 | 2, 8, 39 | nltled 11463 | 1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ≤ 𝑁) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 ⊆ wss 3895 ∖ cdif 4045 ∪ cun 4149 {csn 4584 class class class wbr 5102 Or wor 5557 ◡ccnv 5649 “ cima 5653 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 supcsup 9435 ℂcc 11201 ℝcr 11202 0cc0 11203 < clt 11346 ≤ cle 11347 ℕ0cn0 12609 ℤcz 12696 Polycply 26507 coeffccoe 26509 degcdgr 26510 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9645 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 ax-pre-sup 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 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 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-of 7693 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-map 8852 df-pm 8853 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-sup 9437 df-inf 9438 df-oi 9507 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-nn 12339 df-2 12408 df-3 12409 df-n0 12610 df-z 12697 df-uz 12969 df-rp 13124 df-fz 13643 df-fzo 13792 df-fl 13935 df-seq 14148 df-exp 14208 df-hash 14478 df-cj 15271 df-re 15272 df-im 15273 df-sqrt 15407 df-abs 15408 df-clim 15660 df-rlim 15661 df-sum 15859 df-0p 25996 df-ply 26511 df-coe 26513 df-dgr 26514 |
| This theorem is used by: dgrub2 26559 coeidlem 26561 coeid3 26564 dgreq 26568 coemullem 26574 coemulhi 26578 coemulc 26579 dgreq0 26589 dgrlt 26590 dgradd2 26592 dgrmul 26594 vieta1lem2 26639 aannenlem2 26661 |
| Copyright terms: Public domain | W3C validator |