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

Theorem elply 15054
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 15053 . 2  |-  ( F  e.  (Poly `  S
)  ->  S  C_  CC )
2 plyval 15052 . . . 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 2266 . . 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 8020 . . . . . . . 8  |-  CC  e.  _V
65mptex 5791 . . . . . . 7  |-  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) ) )  e. 
_V
74, 6eqeltrdi 2287 . . . . . 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 2620 . . . 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 2203 . . . . 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 2522 . . . 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 2916 . . 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 613 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 1364    e. wcel 2167   {cab 2182   E.wrex 2476   _Vcvv 2763    u. cun 3155    C_ wss 3157   {csn 3623    |-> cmpt 4095   ` cfv 5259  (class class class)co 5925    ^m cmap 6716   CCcc 7894   0cc0 7896    x. cmul 7901   NN0cn0 9266   ...cfz 10100   ^cexp 10647   sum_csu 11535  Polycply 15048
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-i2m1 8001
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-inn 9008  df-n0 9267  df-ply 15050
This theorem is referenced by:  elply2  15055  plyun0  15056  plyf  15057  elplyr  15060  plycj  15081  plycn  15082  plyrecj  15083
  Copyright terms: Public domain W3C validator