MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  plyeq0 Structured version   Visualization version   Unicode version

Theorem plyeq0 23967
Description: If a polynomial is zero at every point (or even just zero at the positive integers), then all the coefficients must be zero. This is the basis for the method of equating coefficients of equal polynomials, and ensures that df-coe 23946 is well-defined. (Contributed by Mario Carneiro, 22-Jul-2014.)
Hypotheses
Ref Expression
plyeq0.1  |-  ( ph  ->  S  C_  CC )
plyeq0.2  |-  ( ph  ->  N  e.  NN0 )
plyeq0.3  |-  ( ph  ->  A  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) )
plyeq0.4  |-  ( ph  ->  ( A " ( ZZ>=
`  ( N  + 
1 ) ) )  =  { 0 } )
plyeq0.5  |-  ( ph  ->  0p  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) ) )
Assertion
Ref Expression
plyeq0  |-  ( ph  ->  A  =  ( NN0 
X.  { 0 } ) )
Distinct variable groups:    z, k, A    k, N, z    ph, k,
z    S, k, z

Proof of Theorem plyeq0
StepHypRef Expression
1 plyeq0.3 . . . . 5  |-  ( ph  ->  A  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) )
2 plyeq0.1 . . . . . . . 8  |-  ( ph  ->  S  C_  CC )
3 0cnd 10033 . . . . . . . . 9  |-  ( ph  ->  0  e.  CC )
43snssd 4340 . . . . . . . 8  |-  ( ph  ->  { 0 }  C_  CC )
52, 4unssd 3789 . . . . . . 7  |-  ( ph  ->  ( S  u.  {
0 } )  C_  CC )
6 cnex 10017 . . . . . . 7  |-  CC  e.  _V
7 ssexg 4804 . . . . . . 7  |-  ( ( ( S  u.  {
0 } )  C_  CC  /\  CC  e.  _V )  ->  ( S  u.  { 0 } )  e. 
_V )
85, 6, 7sylancl 694 . . . . . 6  |-  ( ph  ->  ( S  u.  {
0 } )  e. 
_V )
9 nn0ex 11298 . . . . . 6  |-  NN0  e.  _V
10 elmapg 7870 . . . . . 6  |-  ( ( ( S  u.  {
0 } )  e. 
_V  /\  NN0  e.  _V )  ->  ( A  e.  ( ( S  u.  { 0 } )  ^m  NN0 )  <->  A : NN0 --> ( S  u.  { 0 } ) ) )
118, 9, 10sylancl 694 . . . . 5  |-  ( ph  ->  ( A  e.  ( ( S  u.  {
0 } )  ^m  NN0 )  <->  A : NN0 --> ( S  u.  { 0 } ) ) )
121, 11mpbid 222 . . . 4  |-  ( ph  ->  A : NN0 --> ( S  u.  { 0 } ) )
13 ffn 6045 . . . 4  |-  ( A : NN0 --> ( S  u.  { 0 } )  ->  A  Fn  NN0 )
1412, 13syl 17 . . 3  |-  ( ph  ->  A  Fn  NN0 )
15 imadmrn 5476 . . . 4  |-  ( A
" dom  A )  =  ran  A
16 fdm 6051 . . . . . . . . 9  |-  ( A : NN0 --> ( S  u.  { 0 } )  ->  dom  A  = 
NN0 )
17 fimacnv 6347 . . . . . . . . 9  |-  ( A : NN0 --> ( S  u.  { 0 } )  ->  ( `' A " ( S  u.  { 0 } ) )  =  NN0 )
1816, 17eqtr4d 2659 . . . . . . . 8  |-  ( A : NN0 --> ( S  u.  { 0 } )  ->  dom  A  =  ( `' A "
( S  u.  {
0 } ) ) )
1912, 18syl 17 . . . . . . 7  |-  ( ph  ->  dom  A  =  ( `' A " ( S  u.  { 0 } ) ) )
20 simpr 477 . . . . . . . . . 10  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =  (/) )  -> 
( `' A "
( S  \  {
0 } ) )  =  (/) )
212adantr 481 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =/=  (/) )  ->  S  C_  CC )
22 plyeq0.2 . . . . . . . . . . . . 13  |-  ( ph  ->  N  e.  NN0 )
2322adantr 481 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =/=  (/) )  ->  N  e.  NN0 )
241adantr 481 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =/=  (/) )  ->  A  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) )
25 plyeq0.4 . . . . . . . . . . . . 13  |-  ( ph  ->  ( A " ( ZZ>=
`  ( N  + 
1 ) ) )  =  { 0 } )
2625adantr 481 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =/=  (/) )  -> 
( A " ( ZZ>=
`  ( N  + 
1 ) ) )  =  { 0 } )
27 plyeq0.5 . . . . . . . . . . . . 13  |-  ( ph  ->  0p  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) ) )
2827adantr 481 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =/=  (/) )  -> 
0p  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) ) )
29 eqid 2622 . . . . . . . . . . . 12  |-  sup (
( `' A "
( S  \  {
0 } ) ) ,  RR ,  <  )  =  sup ( ( `' A " ( S 
\  { 0 } ) ) ,  RR ,  <  )
30 simpr 477 . . . . . . . . . . . 12  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =/=  (/) )  -> 
( `' A "
( S  \  {
0 } ) )  =/=  (/) )
3121, 23, 24, 26, 28, 29, 30plyeq0lem 23966 . . . . . . . . . . 11  |-  -.  ( ph  /\  ( `' A " ( S  \  {
0 } ) )  =/=  (/) )
3231pm2.21i 116 . . . . . . . . . 10  |-  ( (
ph  /\  ( `' A " ( S  \  { 0 } ) )  =/=  (/) )  -> 
( `' A "
( S  \  {
0 } ) )  =  (/) )
3320, 32pm2.61dane 2881 . . . . . . . . 9  |-  ( ph  ->  ( `' A "
( S  \  {
0 } ) )  =  (/) )
3433uneq1d 3766 . . . . . . . 8  |-  ( ph  ->  ( ( `' A " ( S  \  {
0 } ) )  u.  ( `' A " { 0 } ) )  =  ( (/)  u.  ( `' A " { 0 } ) ) )
35 undif1 4043 . . . . . . . . . 10  |-  ( ( S  \  { 0 } )  u.  {
0 } )  =  ( S  u.  {
0 } )
3635imaeq2i 5464 . . . . . . . . 9  |-  ( `' A " ( ( S  \  { 0 } )  u.  {
0 } ) )  =  ( `' A " ( S  u.  {
0 } ) )
37 imaundi 5545 . . . . . . . . 9  |-  ( `' A " ( ( S  \  { 0 } )  u.  {
0 } ) )  =  ( ( `' A " ( S 
\  { 0 } ) )  u.  ( `' A " { 0 } ) )
3836, 37eqtr3i 2646 . . . . . . . 8  |-  ( `' A " ( S  u.  { 0 } ) )  =  ( ( `' A "
( S  \  {
0 } ) )  u.  ( `' A " { 0 } ) )
39 un0 3967 . . . . . . . . 9  |-  ( ( `' A " { 0 } )  u.  (/) )  =  ( `' A " { 0 } )
40 uncom 3757 . . . . . . . . 9  |-  ( ( `' A " { 0 } )  u.  (/) )  =  ( (/)  u.  ( `' A " { 0 } ) )
4139, 40eqtr3i 2646 . . . . . . . 8  |-  ( `' A " { 0 } )  =  (
(/)  u.  ( `' A " { 0 } ) )
4234, 38, 413eqtr4g 2681 . . . . . . 7  |-  ( ph  ->  ( `' A "
( S  u.  {
0 } ) )  =  ( `' A " { 0 } ) )
4319, 42eqtrd 2656 . . . . . 6  |-  ( ph  ->  dom  A  =  ( `' A " { 0 } ) )
44 eqimss 3657 . . . . . 6  |-  ( dom 
A  =  ( `' A " { 0 } )  ->  dom  A 
C_  ( `' A " { 0 } ) )
4543, 44syl 17 . . . . 5  |-  ( ph  ->  dom  A  C_  ( `' A " { 0 } ) )
46 ffun 6048 . . . . . . 7  |-  ( A : NN0 --> ( S  u.  { 0 } )  ->  Fun  A )
4712, 46syl 17 . . . . . 6  |-  ( ph  ->  Fun  A )
48 ssid 3624 . . . . . 6  |-  dom  A  C_ 
dom  A
49 funimass3 6333 . . . . . 6  |-  ( ( Fun  A  /\  dom  A 
C_  dom  A )  ->  ( ( A " dom  A )  C_  { 0 }  <->  dom  A  C_  ( `' A " { 0 } ) ) )
5047, 48, 49sylancl 694 . . . . 5  |-  ( ph  ->  ( ( A " dom  A )  C_  { 0 }  <->  dom  A  C_  ( `' A " { 0 } ) ) )
5145, 50mpbird 247 . . . 4  |-  ( ph  ->  ( A " dom  A )  C_  { 0 } )
5215, 51syl5eqssr 3650 . . 3  |-  ( ph  ->  ran  A  C_  { 0 } )
53 df-f 5892 . . 3  |-  ( A : NN0 --> { 0 }  <->  ( A  Fn  NN0 
/\  ran  A  C_  { 0 } ) )
5414, 52, 53sylanbrc 698 . 2  |-  ( ph  ->  A : NN0 --> { 0 } )
55 c0ex 10034 . . 3  |-  0  e.  _V
5655fconst2 6470 . 2  |-  ( A : NN0 --> { 0 }  <->  A  =  ( NN0  X.  { 0 } ) )
5754, 56sylib 208 1  |-  ( ph  ->  A  =  ( NN0 
X.  { 0 } ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990    =/= wne 2794   _Vcvv 3200    \ cdif 3571    u. cun 3572    C_ wss 3574   (/)c0 3915   {csn 4177    |-> cmpt 4729    X. cxp 5112   `'ccnv 5113   dom cdm 5114   ran crn 5115   "cima 5117   Fun wfun 5882    Fn wfn 5883   -->wf 5884   ` cfv 5888  (class class class)co 6650    ^m cmap 7857   supcsup 8346   CCcc 9934   RRcr 9935   0cc0 9936   1c1 9937    + caddc 9939    x. cmul 9941    < clt 10074   NN0cn0 11292   ZZ>=cuz 11687   ...cfz 12326   ^cexp 12860   sum_csu 14416   0pc0p 23436
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-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
This theorem is referenced by:  coeeulem  23980
  Copyright terms: Public domain W3C validator