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

Theorem plyreres 15555
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 15524 . . 3  |-  ( F  e.  (Poly `  RR )  ->  RR  C_  CC )
2 plyf 15528 . . . 4  |-  ( F  e.  (Poly `  RR )  ->  F : CC --> CC )
3 ffn 5489 . . . 4  |-  ( F : CC --> CC  ->  F  Fn  CC )
4 fnssresb 5451 . . . 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 5672 . . . . . 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 8208 . . . . . . 7  |-  ( a  e.  RR  ->  a  e.  CC )
10 ffvelcdm 5788 . . . . . . 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 15554 . . . . . . . 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 11503 . . . . . . . . 9  |-  ( a  e.  RR  ->  (
* `  a )  =  a )
1514adantl 277 . . . . . . . 8  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
* `  a )  =  a )
1615fveq2d 5652 . . . . . . 7  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  ( F `  ( * `  a ) )  =  ( F `  a
) )
1713, 16eqtrd 2264 . . . . . 6  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
* `  ( F `  a ) )  =  ( F `  a
) )
1811, 17cjrebd 11567 . . . . 5  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  ( F `  a )  e.  RR )
198, 18eqeltrd 2308 . . . 4  |-  ( ( F  e.  (Poly `  RR )  /\  a  e.  RR )  ->  (
( F  |`  RR ) `
 a )  e.  RR )
2019ralrimiva 2606 . . 3  |-  ( F  e.  (Poly `  RR )  ->  A. a  e.  RR  ( ( F  |`  RR ) `  a )  e.  RR )
21 fnfvrnss 5815 . . 3  |-  ( ( ( F  |`  RR )  Fn  RR  /\  A. a  e.  RR  (
( F  |`  RR ) `
 a )  e.  RR )  ->  ran  ( F  |`  RR ) 
C_  RR )
226, 20, 21syl2anc 411 . 2  |-  ( F  e.  (Poly `  RR )  ->  ran  ( F  |`  RR )  C_  RR )
23 df-f 5337 . 2  |-  ( ( F  |`  RR ) : RR --> RR  <->  ( ( F  |`  RR )  Fn  RR  /\  ran  ( F  |`  RR )  C_  RR ) )
246, 22, 23sylanbrc 417 1  |-  ( F  e.  (Poly `  RR )  ->  ( F  |`  RR ) : RR --> RR )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   A.wral 2511    C_ wss 3201   ran crn 4732    |` cres 4733    Fn wfn 5328   -->wf 5329   ` cfv 5333   CCcc 8073   RRcr 8074   *ccj 11460  Polycply 15519
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 619  ax-in2 620  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-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  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-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193  ax-arch 8194  ax-caucvg 8195
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  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-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  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-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  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-isom 5342  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-frec 6600  df-1o 6625  df-oadd 6629  df-er 6745  df-map 6862  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8259  df-mnf 8260  df-xr 8261  df-ltxr 8262  df-le 8263  df-sub 8395  df-neg 8396  df-reap 8798  df-ap 8805  df-div 8896  df-inn 9187  df-2 9245  df-3 9246  df-4 9247  df-n0 9446  df-z 9523  df-uz 9799  df-q 9897  df-rp 9932  df-fz 10287  df-fzo 10421  df-seqfrec 10754  df-exp 10845  df-ihash 11082  df-cj 11463  df-re 11464  df-im 11465  df-rsqrt 11619  df-abs 11620  df-clim 11900  df-sumdc 11975  df-ply 15521
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator