| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dgrnznn | Structured version Visualization version GIF version | ||
| Description: A nonzero polynomial with a root has positive degree. (Contributed by Stefan O'Rear, 25-Nov-2014.) |
| Ref | Expression |
|---|---|
| dgrnznn | ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → (deg‘𝑃) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 489 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → 𝑃 = (ℂ × {(𝑃‘0)})) | |
| 2 | 1 | fveq1d 6884 | . . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (𝑃‘𝐴) = ((ℂ × {(𝑃‘0)})‘𝐴)) |
| 3 | simplr 780 | . . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (𝑃‘𝐴) = 0) | |
| 4 | fvex 6895 | . . . . . . . . . . . . . 14 ⊢ (𝑃‘0) ∈ V | |
| 5 | 4 | fvconst2 7203 | . . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℂ → ((ℂ × {(𝑃‘0)})‘𝐴) = (𝑃‘0)) |
| 6 | 5 | ad2antrr 738 | . . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → ((ℂ × {(𝑃‘0)})‘𝐴) = (𝑃‘0)) |
| 7 | 2, 3, 6 | 3eqtr3rd 2813 | . . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (𝑃‘0) = 0) |
| 8 | 7 | sneqd 4606 | . . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → {(𝑃‘0)} = {0}) |
| 9 | 8 | xpeq2d 5692 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (ℂ × {(𝑃‘0)}) = (ℂ × {0})) |
| 10 | 1, 9 | eqtrd 2804 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → 𝑃 = (ℂ × {0})) |
| 11 | df-0p 25797 | . . . . . . . 8 ⊢ 0𝑝 = (ℂ × {0}) | |
| 12 | 10, 11 | eqtr4di 2822 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → 𝑃 = 0𝑝) |
| 13 | 12 | ex 417 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) → (𝑃 = (ℂ × {(𝑃‘0)}) → 𝑃 = 0𝑝)) |
| 14 | 13 | necon3ad 2977 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) → (𝑃 ≠ 0𝑝 → ¬ 𝑃 = (ℂ × {(𝑃‘0)}))) |
| 15 | 14 | impcom 412 | . . . 4 ⊢ ((𝑃 ≠ 0𝑝 ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ¬ 𝑃 = (ℂ × {(𝑃‘0)})) |
| 16 | 15 | adantll 726 | . . 3 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ¬ 𝑃 = (ℂ × {(𝑃‘0)})) |
| 17 | 0dgrb 26371 | . . . 4 ⊢ (𝑃 ∈ (Poly‘𝑆) → ((deg‘𝑃) = 0 ↔ 𝑃 = (ℂ × {(𝑃‘0)}))) | |
| 18 | 17 | ad2antrr 738 | . . 3 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ((deg‘𝑃) = 0 ↔ 𝑃 = (ℂ × {(𝑃‘0)}))) |
| 19 | 16, 18 | mtbird 328 | . 2 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ¬ (deg‘𝑃) = 0) |
| 20 | dgrcl 26358 | . . . 4 ⊢ (𝑃 ∈ (Poly‘𝑆) → (deg‘𝑃) ∈ ℕ0) | |
| 21 | 20 | ad2antrr 738 | . . 3 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → (deg‘𝑃) ∈ ℕ0) |
| 22 | elnn0 12505 | . . 3 ⊢ ((deg‘𝑃) ∈ ℕ0 ↔ ((deg‘𝑃) ∈ ℕ ∨ (deg‘𝑃) = 0)) | |
| 23 | 21, 22 | sylib 221 | . 2 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ((deg‘𝑃) ∈ ℕ ∨ (deg‘𝑃) = 0)) |
| 24 | orel2 903 | . 2 ⊢ (¬ (deg‘𝑃) = 0 → (((deg‘𝑃) ∈ ℕ ∨ (deg‘𝑃) = 0) → (deg‘𝑃) ∈ ℕ)) | |
| 25 | 19, 23, 24 | sylc 66 | 1 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → (deg‘𝑃) ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 {csn 4594 × cxp 5660 ‘cfv 6537 ℂcc 11097 0cc0 11099 ℕcn 12232 ℕ0cn0 12503 0𝑝c0p 25796 Polycply 26309 degcdgr 26312 |
| 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 9609 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| 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 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-er 8693 df-map 8825 df-pm 8826 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-sup 9401 df-inf 9402 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-n0 12504 df-z 12591 df-uz 12862 df-rp 13016 df-fz 13535 df-fzo 13682 df-fl 13824 df-seq 14037 df-exp 14097 df-hash 14366 df-cj 15149 df-re 15150 df-im 15151 df-sqrt 15285 df-abs 15286 df-clim 15538 df-rlim 15539 df-sum 15737 df-0p 25797 df-ply 26313 df-coe 26315 df-dgr 26316 |
| This theorem is referenced by: dgraalem 43763 dgraaub 43766 etransclem47 46886 |
| Copyright terms: Public domain | W3C validator |