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

Theorem coeid3 21593
Description: Reconstruct a polynomial as an explicit sum of the coefficient function up to at least the degree of the polynomial. (Contributed by Mario Carneiro, 22-Jul-2014.)
Hypotheses
Ref Expression
dgrub.1  |-  A  =  (coeff `  F )
dgrub.2  |-  N  =  (deg `  F )
Assertion
Ref Expression
coeid3  |-  ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  ->  ( F `  X )  =  sum_ k  e.  ( 0 ... M ) ( ( A `  k
)  x.  ( X ^ k ) ) )
Distinct variable groups:    A, k    k, F    S, k    k, M   
k, N    k, X

Proof of Theorem coeid3
StepHypRef Expression
1 dgrub.1 . . . 4  |-  A  =  (coeff `  F )
2 dgrub.2 . . . 4  |-  N  =  (deg `  F )
31, 2coeid2 21592 . . 3  |-  ( ( F  e.  (Poly `  S )  /\  X  e.  CC )  ->  ( F `  X )  =  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  ( X ^ k ) ) )
433adant2 1000 . 2  |-  ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  ->  ( F `  X )  =  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( X ^ k ) ) )
5 fzss2 11485 . . . 4  |-  ( M  e.  ( ZZ>= `  N
)  ->  ( 0 ... N )  C_  ( 0 ... M
) )
653ad2ant2 1003 . . 3  |-  ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  ->  ( 0 ... N )  C_  (
0 ... M ) )
7 elfznn0 11468 . . . 4  |-  ( k  e.  ( 0 ... N )  ->  k  e.  NN0 )
81coef3 21585 . . . . . . 7  |-  ( F  e.  (Poly `  S
)  ->  A : NN0
--> CC )
983ad2ant1 1002 . . . . . 6  |-  ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  ->  A : NN0 --> CC )
109ffvelrnda 5831 . . . . 5  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  NN0 )  ->  ( A `  k )  e.  CC )
11 expcl 11867 . . . . . 6  |-  ( ( X  e.  CC  /\  k  e.  NN0 )  -> 
( X ^ k
)  e.  CC )
12113ad2antl3 1145 . . . . 5  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  NN0 )  ->  ( X ^
k )  e.  CC )
1310, 12mulcld 9394 . . . 4  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  NN0 )  ->  ( ( A `
 k )  x.  ( X ^ k
) )  e.  CC )
147, 13sylan2 471 . . 3  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( 0 ... N ) )  ->  ( ( A `  k )  x.  ( X ^ k
) )  e.  CC )
15 eldifn 3467 . . . . . . 7  |-  ( k  e.  ( ( 0 ... M )  \ 
( 0 ... N
) )  ->  -.  k  e.  ( 0 ... N ) )
1615adantl 463 . . . . . 6  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  -.  k  e.  ( 0 ... N
) )
17 simpl1 984 . . . . . . . . 9  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  F  e.  (Poly `  S ) )
18 eldifi 3466 . . . . . . . . . . . 12  |-  ( k  e.  ( ( 0 ... M )  \ 
( 0 ... N
) )  ->  k  e.  ( 0 ... M
) )
19 elfzuz 11436 . . . . . . . . . . . 12  |-  ( k  e.  ( 0 ... M )  ->  k  e.  ( ZZ>= `  0 )
)
2018, 19syl 16 . . . . . . . . . . 11  |-  ( k  e.  ( ( 0 ... M )  \ 
( 0 ... N
) )  ->  k  e.  ( ZZ>= `  0 )
)
2120adantl 463 . . . . . . . . . 10  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  k  e.  ( ZZ>= `  0 )
)
22 nn0uz 10883 . . . . . . . . . 10  |-  NN0  =  ( ZZ>= `  0 )
2321, 22syl6eleqr 2524 . . . . . . . . 9  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  k  e.  NN0 )
241, 2dgrub 21587 . . . . . . . . . 10  |-  ( ( F  e.  (Poly `  S )  /\  k  e.  NN0  /\  ( A `
 k )  =/=  0 )  ->  k  <_  N )
25243expia 1182 . . . . . . . . 9  |-  ( ( F  e.  (Poly `  S )  /\  k  e.  NN0 )  ->  (
( A `  k
)  =/=  0  -> 
k  <_  N )
)
2617, 23, 25syl2anc 654 . . . . . . . 8  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( ( A `  k )  =/=  0  ->  k  <_  N ) )
27 simpl2 985 . . . . . . . . . 10  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  M  e.  ( ZZ>= `  N )
)
28 eluzel2 10854 . . . . . . . . . 10  |-  ( M  e.  ( ZZ>= `  N
)  ->  N  e.  ZZ )
2927, 28syl 16 . . . . . . . . 9  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  N  e.  ZZ )
30 elfz5 11432 . . . . . . . . 9  |-  ( ( k  e.  ( ZZ>= ` 
0 )  /\  N  e.  ZZ )  ->  (
k  e.  ( 0 ... N )  <->  k  <_  N ) )
3121, 29, 30syl2anc 654 . . . . . . . 8  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( k  e.  ( 0 ... N
)  <->  k  <_  N
) )
3226, 31sylibrd 234 . . . . . . 7  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( ( A `  k )  =/=  0  ->  k  e.  ( 0 ... N
) ) )
3332necon1bd 2669 . . . . . 6  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( -.  k  e.  ( 0 ... N )  -> 
( A `  k
)  =  0 ) )
3416, 33mpd 15 . . . . 5  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( A `  k )  =  0 )
3534oveq1d 6095 . . . 4  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( ( A `  k )  x.  ( X ^ k
) )  =  ( 0  x.  ( X ^ k ) ) )
36 elfznn0 11468 . . . . . . 7  |-  ( k  e.  ( 0 ... M )  ->  k  e.  NN0 )
3718, 36syl 16 . . . . . 6  |-  ( k  e.  ( ( 0 ... M )  \ 
( 0 ... N
) )  ->  k  e.  NN0 )
3837, 12sylan2 471 . . . . 5  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( X ^ k )  e.  CC )
3938mul02d 9555 . . . 4  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( 0  x.  ( X ^
k ) )  =  0 )
4035, 39eqtrd 2465 . . 3  |-  ( ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  /\  k  e.  ( ( 0 ... M
)  \  ( 0 ... N ) ) )  ->  ( ( A `  k )  x.  ( X ^ k
) )  =  0 )
41 fzfid 11779 . . 3  |-  ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  ->  ( 0 ... M )  e.  Fin )
426, 14, 40, 41fsumss 13186 . 2  |-  ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  ->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  ( X ^ k ) )  =  sum_ k  e.  ( 0 ... M ) ( ( A `  k )  x.  ( X ^ k ) ) )
434, 42eqtrd 2465 1  |-  ( ( F  e.  (Poly `  S )  /\  M  e.  ( ZZ>= `  N )  /\  X  e.  CC )  ->  ( F `  X )  =  sum_ k  e.  ( 0 ... M ) ( ( A `  k
)  x.  ( X ^ k ) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 958    = wceq 1362    e. wcel 1755    =/= wne 2596    \ cdif 3313    C_ wss 3316   class class class wbr 4280   -->wf 5402   ` cfv 5406  (class class class)co 6080   CCcc 9268   0cc0 9270    x. cmul 9275    <_ cle 9407   NN0cn0 10567   ZZcz 10634   ZZ>=cuz 10849   ...cfz 11424   ^cexp 11849   sum_csu 13147  Polycply 21537  coeffccoe 21539  degcdgr 21540
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1594  ax-4 1605  ax-5 1669  ax-6 1707  ax-7 1727  ax-8 1757  ax-9 1759  ax-10 1774  ax-11 1779  ax-12 1791  ax-13 1942  ax-ext 2414  ax-rep 4391  ax-sep 4401  ax-nul 4409  ax-pow 4458  ax-pr 4519  ax-un 6361  ax-inf2 7835  ax-cnex 9326  ax-resscn 9327  ax-1cn 9328  ax-icn 9329  ax-addcl 9330  ax-addrcl 9331  ax-mulcl 9332  ax-mulrcl 9333  ax-mulcom 9334  ax-addass 9335  ax-mulass 9336  ax-distr 9337  ax-i2m1 9338  ax-1ne0 9339  ax-1rid 9340  ax-rnegex 9341  ax-rrecex 9342  ax-cnre 9343  ax-pre-lttri 9344  ax-pre-lttrn 9345  ax-pre-ltadd 9346  ax-pre-mulgt0 9347  ax-pre-sup 9348  ax-addf 9349
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 959  df-3an 960  df-tru 1365  df-fal 1368  df-ex 1590  df-nf 1593  df-sb 1700  df-eu 2258  df-mo 2259  df-clab 2420  df-cleq 2426  df-clel 2429  df-nfc 2558  df-ne 2598  df-nel 2599  df-ral 2710  df-rex 2711  df-reu 2712  df-rmo 2713  df-rab 2714  df-v 2964  df-sbc 3176  df-csb 3277  df-dif 3319  df-un 3321  df-in 3323  df-ss 3330  df-pss 3332  df-nul 3626  df-if 3780  df-pw 3850  df-sn 3866  df-pr 3868  df-tp 3870  df-op 3872  df-uni 4080  df-int 4117  df-iun 4161  df-br 4281  df-opab 4339  df-mpt 4340  df-tr 4374  df-eprel 4619  df-id 4623  df-po 4628  df-so 4629  df-fr 4666  df-se 4667  df-we 4668  df-ord 4709  df-on 4710  df-lim 4711  df-suc 4712  df-xp 4833  df-rel 4834  df-cnv 4835  df-co 4836  df-dm 4837  df-rn 4838  df-res 4839  df-ima 4840  df-iota 5369  df-fun 5408  df-fn 5409  df-f 5410  df-f1 5411  df-fo 5412  df-f1o 5413  df-fv 5414  df-isom 5415  df-riota 6039  df-ov 6083  df-oprab 6084  df-mpt2 6085  df-of 6309  df-om 6466  df-1st 6566  df-2nd 6567  df-recs 6818  df-rdg 6852  df-1o 6908  df-oadd 6912  df-er 7089  df-map 7204  df-pm 7205  df-en 7299  df-dom 7300  df-sdom 7301  df-fin 7302  df-sup 7679  df-oi 7712  df-card 8097  df-pnf 9408  df-mnf 9409  df-xr 9410  df-ltxr 9411  df-le 9412  df-sub 9585  df-neg 9586  df-div 9982  df-nn 10311  df-2 10368  df-3 10369  df-n0 10568  df-z 10635  df-uz 10850  df-rp 10980  df-fz 11425  df-fzo 11533  df-fl 11626  df-seq 11791  df-exp 11850  df-hash 12088  df-cj 12572  df-re 12573  df-im 12574  df-sqr 12708  df-abs 12709  df-clim 12950  df-rlim 12951  df-sum 13148  df-0p 20990  df-ply 21541  df-coe 21543  df-dgr 21544
This theorem is referenced by:  dvply2g  21636  aannenlem1  21679
  Copyright terms: Public domain W3C validator