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

Theorem plyreres 16002
Description: Real-coefficient polynomials restrict to real functions. (Contributed by Stefan O'Rear, 16-Nov-2014.)
Assertion
Ref Expression
plyreres  |-  ( F  e.  (Poly `  RR )  ->  ( F  |`  RR ) : RR --> RR )

Proof of Theorem plyreres
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 plybss 15971 . . 3  |-  ( F  e.  (Poly `  RR )  ->  RR  C_  CC )
2 plyf 15975 . . . 4  |-  ( F  e.  (Poly `  RR )  ->  F : CC --> CC )
3 ffn 5536 . . . 4  |-  ( F : CC --> CC  ->  F  Fn  CC )
4 fnssresb 5498 . . . 4  |-  ( F  Fn  CC  ->  (
( F  |`  RR )  Fn  RR  <->  RR  C_  CC ) )
52, 3, 43syl 17 . . 3  |-  ( F  e.  (Poly `  RR )  ->  ( ( F  |`  RR )  Fn  RR  <->  RR  C_  CC ) )
61, 5mpbird 167 . 2  |-  ( F  e.  (Poly `  RR )  ->  ( F  |`  RR )  Fn  RR )
7 fvres 5722 . . . . . 6  |-  ( a  e.  RR  ->  (
( F  |`  RR ) `
 a )  =  ( F `  a
) )
87adantl 277 . . . . 5  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
( F  |`  RR ) `
 a )  =  ( F `  a
) )
9 recn 8319 . . . . . . 7  |-  ( a  e.  RR  ->  a  e.  CC )
10 ffvelcdm 5844 . . . . . . 7  |-  ( ( F : CC --> CC  /\  a  e.  CC )  ->  ( F `  a
)  e.  CC )
112, 9, 10syl2an 289 . . . . . 6  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  ( F `  a )  e.  CC )
12 plyrecj 16001 . . . . . . . 8  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  CC )  ->  (
* `  ( F `  a ) )  =  ( F `  (
* `  a )
) )
139, 12sylan2 286 . . . . . . 7  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
* `  ( F `  a ) )  =  ( F `  (
* `  a )
) )
14 cjre 11670 . . . . . . . . 9  |-  ( a  e.  RR  ->  (
* `  a )  =  a )
1514adantl 277 . . . . . . . 8  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
* `  a )  =  a )
1615fveq2d 5702 . . . . . . 7  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  ( F `  ( * `  a ) )  =  ( F `  a
) )
1713, 16eqtrd 2271 . . . . . 6  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
* `  ( F `  a ) )  =  ( F `  a
) )
1811, 17cjrebd 11735 . . . . 5  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  ( F `  a )  e.  RR )
198, 18eqeltrd 2315 . . . 4  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
( F  |`  RR ) `
 a )  e.  RR )
2019ralrimiva 2623 . . 3  |-  ( F  e.  (Poly `  RR )  ->  A. a  e.  RR  ( ( F  |`  RR ) `  a )  e.  RR )
21 fnfvrnss 5871 . . 3  |-  ( ( ( F  |`  RR )  Fn  RR  /\  A. a  e.  RR  (
( F  |`  RR ) `
 a )  e.  RR )  ->  ran  ( F  |`  RR ) 
C_  RR )
226, 20, 21syl2anc 415 . 2  |-  ( F  e.  (Poly `  RR )  ->  ran  ( F  |`  RR )  C_  RR )
23 df-f 5384 . 2  |-  ( ( F  |`  RR ) : RR --> RR  <->  ( ( F  |`  RR )  Fn  RR  /\  ran  ( F  |`  RR )  C_  RR ) )
246, 22, 23sylanbrc 421 1  |-  ( F  e.  (Poly `  RR )  ->  ( F  |`  RR ) : RR --> RR )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528    C_ wss 3220   ran crn 4777    |` cres 4778    Fn wfn 5375   -->wf 5376   ` cfv 5380   CCcc 8184   RRcr 8185   *ccj 11627  Polycply 15966
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304  ax-arch 8305  ax-caucvg 8306
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-oadd 6695  df-er 6811  df-map 6928  df-en 7028  df-dom 7029  df-fin 7030  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-n0 9576  df-z 9657  df-uz 9939  df-q 10037  df-rp 10073  df-fz 10430  df-fzo 10568  df-seqfrec 10907  df-exp 10998  df-ihash 11238  df-cj 11630  df-re 11631  df-im 11632  df-rsqrt 11787  df-abs 11788  df-clim 12071  df-sumdc 12146  df-ply 15968
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator