![]() |
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 477 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → 𝑃 = (ℂ × {(𝑃‘0)})) | |
2 | 1 | fveq1d 6193 | . . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (𝑃‘𝐴) = ((ℂ × {(𝑃‘0)})‘𝐴)) |
3 | simplr 792 | . . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (𝑃‘𝐴) = 0) | |
4 | fvex 6201 | . . . . . . . . . . . . . 14 ⊢ (𝑃‘0) ∈ V | |
5 | 4 | fvconst2 6469 | . . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℂ → ((ℂ × {(𝑃‘0)})‘𝐴) = (𝑃‘0)) |
6 | 5 | ad2antrr 762 | . . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → ((ℂ × {(𝑃‘0)})‘𝐴) = (𝑃‘0)) |
7 | 2, 3, 6 | 3eqtr3rd 2665 | . . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (𝑃‘0) = 0) |
8 | 7 | sneqd 4189 | . . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → {(𝑃‘0)} = {0}) |
9 | 8 | xpeq2d 5139 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → (ℂ × {(𝑃‘0)}) = (ℂ × {0})) |
10 | 1, 9 | eqtrd 2656 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → 𝑃 = (ℂ × {0})) |
11 | df-0p 23437 | . . . . . . . 8 ⊢ 0𝑝 = (ℂ × {0}) | |
12 | 10, 11 | syl6eqr 2674 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) ∧ 𝑃 = (ℂ × {(𝑃‘0)})) → 𝑃 = 0𝑝) |
13 | 12 | ex 450 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) → (𝑃 = (ℂ × {(𝑃‘0)}) → 𝑃 = 0𝑝)) |
14 | 13 | necon3ad 2807 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0) → (𝑃 ≠ 0𝑝 → ¬ 𝑃 = (ℂ × {(𝑃‘0)}))) |
15 | 14 | impcom 446 | . . . 4 ⊢ ((𝑃 ≠ 0𝑝 ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ¬ 𝑃 = (ℂ × {(𝑃‘0)})) |
16 | 15 | adantll 750 | . . 3 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ¬ 𝑃 = (ℂ × {(𝑃‘0)})) |
17 | 0dgrb 24002 | . . . 4 ⊢ (𝑃 ∈ (Poly‘𝑆) → ((deg‘𝑃) = 0 ↔ 𝑃 = (ℂ × {(𝑃‘0)}))) | |
18 | 17 | ad2antrr 762 | . . 3 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ((deg‘𝑃) = 0 ↔ 𝑃 = (ℂ × {(𝑃‘0)}))) |
19 | 16, 18 | mtbird 315 | . 2 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ¬ (deg‘𝑃) = 0) |
20 | dgrcl 23989 | . . . 4 ⊢ (𝑃 ∈ (Poly‘𝑆) → (deg‘𝑃) ∈ ℕ0) | |
21 | 20 | ad2antrr 762 | . . 3 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → (deg‘𝑃) ∈ ℕ0) |
22 | elnn0 11294 | . . 3 ⊢ ((deg‘𝑃) ∈ ℕ0 ↔ ((deg‘𝑃) ∈ ℕ ∨ (deg‘𝑃) = 0)) | |
23 | 21, 22 | sylib 208 | . 2 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → ((deg‘𝑃) ∈ ℕ ∨ (deg‘𝑃) = 0)) |
24 | orel2 398 | . 2 ⊢ (¬ (deg‘𝑃) = 0 → (((deg‘𝑃) ∈ ℕ ∨ (deg‘𝑃) = 0) → (deg‘𝑃) ∈ ℕ)) | |
25 | 19, 23, 24 | sylc 65 | 1 ⊢ (((𝑃 ∈ (Poly‘𝑆) ∧ 𝑃 ≠ 0𝑝) ∧ (𝐴 ∈ ℂ ∧ (𝑃‘𝐴) = 0)) → (deg‘𝑃) ∈ ℕ) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∨ wo 383 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 {csn 4177 × cxp 5112 ‘cfv 5888 ℂcc 9934 0cc0 9936 ℕcn 11020 ℕ0cn0 11292 0𝑝c0p 23436 Polycply 23940 degcdgr 23943 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-fz 12327 df-fzo 12466 df-fl 12593 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-rlim 14220 df-sum 14417 df-0p 23437 df-ply 23944 df-coe 23946 df-dgr 23947 |
This theorem is referenced by: dgraalem 37715 dgraaub 37718 etransclem47 40498 |
Copyright terms: Public domain | W3C validator |