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

Theorem elplyr 14976
Description: Sufficient condition for elementhood in the set of polynomials. (Contributed by Mario Carneiro, 17-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
Assertion
Ref Expression
elplyr  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  e.  (Poly `  S ) )
Distinct variable groups:    z, k, S    A, k, z    k, N, z

Proof of Theorem elplyr
Dummy variables  a  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 999 . 2  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  S  C_  CC )
2 simp2 1000 . . 3  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  N  e.  NN0 )
3 simp3 1001 . . . . 5  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  A : NN0 --> S )
4 ssun1 3326 . . . . 5  |-  S  C_  ( S  u.  { 0 } )
5 fss 5419 . . . . 5  |-  ( ( A : NN0 --> S  /\  S  C_  ( S  u.  { 0 } ) )  ->  A : NN0 --> ( S  u.  { 0 } ) )
63, 4, 5sylancl 413 . . . 4  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  A : NN0 --> ( S  u.  { 0 } ) )
7 0cnd 8019 . . . . . . . 8  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  0  e.  CC )
87snssd 3767 . . . . . . 7  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  { 0 }  C_  CC )
91, 8unssd 3339 . . . . . 6  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  ( S  u.  { 0 } )  C_  CC )
10 cnex 8003 . . . . . 6  |-  CC  e.  _V
11 ssexg 4172 . . . . . 6  |-  ( ( ( S  u.  {
0 } )  C_  CC  /\  CC  e.  _V )  ->  ( S  u.  { 0 } )  e. 
_V )
129, 10, 11sylancl 413 . . . . 5  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  ( S  u.  { 0 } )  e.  _V )
13 nn0ex 9255 . . . . 5  |-  NN0  e.  _V
14 elmapg 6720 . . . . 5  |-  ( ( ( S  u.  {
0 } )  e. 
_V  /\  NN0  e.  _V )  ->  ( A  e.  ( ( S  u.  { 0 } )  ^m  NN0 )  <->  A : NN0 --> ( S  u.  { 0 } ) ) )
1512, 13, 14sylancl 413 . . . 4  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  ( A  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) 
<->  A : NN0 --> ( S  u.  { 0 } ) ) )
166, 15mpbird 167 . . 3  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  A  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) )
17 eqidd 2197 . . 3  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( A `
 k )  x.  ( z ^ k
) ) ) )
18 oveq2 5930 . . . . . . 7  |-  ( n  =  N  ->  (
0 ... n )  =  ( 0 ... N
) )
1918sumeq1d 11531 . . . . . 6  |-  ( n  =  N  ->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) )  =  sum_ k  e.  ( 0 ... N ) ( ( a `  k
)  x.  ( z ^ k ) ) )
2019mpteq2dv 4124 . . . . 5  |-  ( n  =  N  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( a `
 k )  x.  ( z ^ k
) ) ) )
2120eqeq2d 2208 . . . 4  |-  ( n  =  N  ->  (
( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n
) ( ( a `
 k )  x.  ( z ^ k
) ) )  <->  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
22 fveq1 5557 . . . . . . . 8  |-  ( a  =  A  ->  (
a `  k )  =  ( A `  k ) )
2322oveq1d 5937 . . . . . . 7  |-  ( a  =  A  ->  (
( a `  k
)  x.  ( z ^ k ) )  =  ( ( A `
 k )  x.  ( z ^ k
) ) )
2423sumeq2sdv 11535 . . . . . 6  |-  ( a  =  A  ->  sum_ k  e.  ( 0 ... N
) ( ( a `
 k )  x.  ( z ^ k
) )  =  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )
2524mpteq2dv 4124 . . . . 5  |-  ( a  =  A  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( a `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( A `
 k )  x.  ( z ^ k
) ) ) )
2625eqeq2d 2208 . . . 4  |-  ( a  =  A  ->  (
( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N
) ( ( a `
 k )  x.  ( z ^ k
) ) )  <->  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) ) ) )
2721, 26rspc2ev 2883 . . 3  |-  ( ( N  e.  NN0  /\  A  e.  ( ( S  u.  { 0 } )  ^m  NN0 )  /\  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( 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 ) ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) )
282, 16, 17, 27syl3anc 1249 . 2  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) )
29 elply 14970 . 2  |-  ( ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  e.  (Poly `  S )  <->  ( S  C_  CC  /\  E. n  e.  NN0  E. a  e.  ( ( S  u.  { 0 } )  ^m  NN0 ) ( z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k )  x.  (
z ^ k ) ) )  =  ( z  e.  CC  |->  sum_ k  e.  ( 0 ... n ) ( ( a `  k
)  x.  ( z ^ k ) ) ) ) )
301, 28, 29sylanbrc 417 1  |-  ( ( S  C_  CC  /\  N  e.  NN0  /\  A : NN0
--> S )  ->  (
z  e.  CC  |->  sum_ k  e.  ( 0 ... N ) ( ( A `  k
)  x.  ( z ^ k ) ) )  e.  (Poly `  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2167   E.wrex 2476   _Vcvv 2763    u. cun 3155    C_ wss 3157   {csn 3622    |-> cmpt 4094   -->wf 5254   ` cfv 5258  (class class class)co 5922    ^m cmap 6707   CCcc 7877   0cc0 7879    x. cmul 7884   NN0cn0 9249   ...cfz 10083   ^cexp 10630   sum_csu 11518  Polycply 14964
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-in1 615  ax-in2 616  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 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-addcom 7979  ax-addass 7981  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-0id 7987  ax-rnegex 7988  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-ltadd 7995
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  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-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-if 3562  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-recs 6363  df-frec 6449  df-map 6709  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-inn 8991  df-n0 9250  df-z 9327  df-uz 9602  df-fz 10084  df-seqfrec 10540  df-sumdc 11519  df-ply 14966
This theorem is referenced by:  elplyd  14977
  Copyright terms: Public domain W3C validator