| 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 12584 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑀 ∈ ℝ) |
| 3 | simp1 1154 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝐹 ∈ (Poly‘𝑆)) | |
| 4 | dgrub.2 | . . . . 5 ⊢ 𝑁 = (deg‘𝐹) | |
| 5 | dgrcl 26427 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) | |
| 6 | 4, 5 | eqeltrid 2870 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ0) |
| 7 | 3, 6 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 ∈ ℕ0) |
| 8 | 7 | nn0red 12584 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 ∈ ℝ) |
| 9 | dgrub.1 | . . . . . 6 ⊢ 𝐴 = (coeff‘𝐹) | |
| 10 | 9 | dgrval 26422 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 11 | 4, 10 | eqtrid 2813 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 12 | 3, 11 | syl 18 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝑁 = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < )) |
| 13 | 9 | coef3 26426 | . . . . . . . 8 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶ℂ) |
| 14 | 3, 13 | syl 18 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → 𝐴:ℕ0⟶ℂ) |
| 15 | 14, 1 | ffvelcdmd 7087 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ∈ ℂ) |
| 16 | simp3 1156 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ≠ 0) | |
| 17 | eldifsn 4758 | . . . . . 6 ⊢ ((𝐴‘𝑀) ∈ (ℂ ∖ {0}) ↔ ((𝐴‘𝑀) ∈ ℂ ∧ (𝐴‘𝑀) ≠ 0)) | |
| 18 | 15, 16, 17 | sylanbrc 595 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → (𝐴‘𝑀) ∈ (ℂ ∖ {0})) |
| 19 | 9 | coef 26424 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶(𝑆 ∪ {0})) |
| 20 | ffn 6712 | . . . . . 6 ⊢ (𝐴:ℕ0⟶(𝑆 ∪ {0}) → 𝐴 Fn ℕ0) | |
| 21 | elpreima 7060 | . . . . . 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 12526 | . . . . . . 7 ⊢ ℕ0 ⊆ ℝ | |
| 25 | ltso 11308 | . . . . . . 7 ⊢ < Or ℝ | |
| 26 | soss 5594 | . . . . . . 7 ⊢ (ℕ0 ⊆ ℝ → ( < Or ℝ → < Or ℕ0)) | |
| 27 | 24, 25, 26 | mp2 9 | . . . . . 6 ⊢ < Or ℕ0 |
| 28 | 27 | a1i 11 | . . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → < Or ℕ0) |
| 29 | 0zd 12621 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 0 ∈ ℤ) | |
| 30 | cnvimass 6089 | . . . . . . 7 ⊢ (◡𝐴 “ (ℂ ∖ {0})) ⊆ dom 𝐴 | |
| 31 | 30, 19 | fssdm 6732 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → (◡𝐴 “ (ℂ ∖ {0})) ⊆ ℕ0) |
| 32 | 9 | dgrlem 26423 | . . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴:ℕ0⟶(𝑆 ∪ {0}) ∧ ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛)) |
| 33 | 32 | simprd 501 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℤ ∀𝑥 ∈ (◡𝐴 “ (ℂ ∖ {0}))𝑥 ≤ 𝑛) |
| 34 | nn0uz 12918 | . . . . . . 7 ⊢ ℕ0 = (ℤ≥‘0) | |
| 35 | 34 | uzsupss 12982 | . . . . . 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 9429 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝑀 ∈ (◡𝐴 “ (ℂ ∖ {0})) → ¬ sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ) < 𝑀)) |
| 38 | 3, 23, 37 | sylc 66 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → ¬ sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ) < 𝑀) |
| 39 | 12, 38 | eqnbrtrd 5134 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑀 ∈ ℕ0 ∧ (𝐴‘𝑀) ≠ 0) → ¬ 𝑁 < 𝑀) |
| 40 | 2, 8, 39 | nltled 11378 | 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 1570 ∈ wcel 2146 ≠ wne 2961 ∀wral 3082 ∃wrex 3092 ∖ cdif 3905 ∪ cun 3906 ⊆ wss 3908 {csn 4594 class class class wbr 5114 Or wor 5573 ◡ccnv 5665 “ cima 5669 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 supcsup 9410 ℂcc 11116 ℝcr 11117 0cc0 11118 < clt 11261 ≤ cle 11262 ℕ0cn0 12522 ℤcz 12609 Polycply 26378 coeffccoe 26380 degcdgr 26381 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-inf2 9620 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-se 5620 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-of 7687 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8703 df-map 8835 df-pm 8836 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-oi 9482 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-3 12322 df-n0 12523 df-z 12610 df-uz 12881 df-rp 13035 df-fz 13554 df-fzo 13702 df-fl 13845 df-seq 14058 df-exp 14118 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-rlim 15566 df-sum 15764 df-0p 25866 df-ply 26382 df-coe 26384 df-dgr 26385 |
| This theorem is used by: dgrub2 26429 coeidlem 26431 coeid3 26434 dgreq 26438 coemullem 26444 coemulhi 26448 coemulc 26449 dgreq0 26459 dgrlt 26460 dgradd2 26462 dgrmul 26464 vieta1lem2 26509 aannenlem2 26529 |
| Copyright terms: Public domain | W3C validator |