ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elply Unicode version

Theorem elply 15528
Description: Definition of a polynomial with coefficients in  S. (Contributed by Mario Carneiro, 17-Jul-2014.)
Assertion
Ref Expression
elply  |-  ( F  e.  (Poly `  S
)  <->  ( S  C_  CC  /\  E. n  e. 
NN0  E. a  e.  ( ( S  u.  {
0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
Distinct variable groups:    S, a, n   
k, a, z, n    F, a, n
Allowed substitution hints:    S( z, k)    F( z, k)

Proof of Theorem elply
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 plybss 15527 . 2  |-  ( F  e.  (Poly `  S
)  ->  S  C_  CC )
2 plyval 15526 . . . 4  |-  ( S 
C_  CC  ->  (Poly `  S )  =  {
f  |  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) } )
32eleq2d 2301 . . 3  |-  ( S 
C_  CC  ->  ( F  e.  (Poly `  S
)  <->  F  e.  { f  |  E. n  e. 
NN0  E. a  e.  ( ( S  u.  {
0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) } ) )
4 id 19 . . . . . . 7  |-  ( F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) )  ->  F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) ) )
5 cnex 8199 . . . . . . . 8  |-  CC  e.  _V
65mptex 5890 . . . . . . 7  |-  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) ) )  e. 
_V
74, 6eqeltrdi 2322 . . . . . 6  |-  ( F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) )  ->  F  e.  _V )
87a1i 9 . . . . 5  |-  ( ( n  e.  NN0  /\  a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) )  ->  ( F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k )  x.  (
z ^ k ) ) )  ->  F  e.  _V ) )
98rexlimivv 2657 . . . 4  |-  ( E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) )  ->  F  e.  _V )
10 eqeq1 2238 . . . . 5  |-  ( f  =  F  ->  (
f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) ) )  <->  F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
11102rexbidv 2558 . . . 4  |-  ( f  =  F  ->  ( E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) )  <->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
129, 11elab3 2959 . . 3  |-  ( F  e.  { f  |  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) f  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) }  <->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) )
133, 12bitrdi 196 . 2  |-  ( S 
C_  CC  ->  ( F  e.  (Poly `  S
)  <->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) F  =  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
141, 13biadanii 617 1  |-  ( F  e.  (Poly `  S
)  <->  ( S  C_  CC  /\  E. n  e. 
NN0  E. a  e.  ( ( S  u.  {
0 } )  ^m  NN0 ) F  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   {cab 2217   E.wrex 2512   _Vcvv 2803    u. cun 3199    C_ wss 3201   {csn 3673    |-> cmpt 4155   ` cfv 5333  (class class class)co 6028    ^m cmap 6860   CCcc 8073   0cc0 8075    x. cmul 8080   NN0cn0 9444   ...cfz 10288   ^cexp 10846   sum_csu 11976  Polycply 15522
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-i2m1 8180
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-map 6862  df-inn 9186  df-n0 9445  df-ply 15524
This theorem is referenced by:  elply2  15529  plyun0  15530  plyf  15531  elplyr  15534  plycj  15555  plycn  15556  plyrecj  15557
  Copyright terms: Public domain W3C validator