MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rpnnen1lem4 Unicode version

Theorem rpnnen1lem4 10345
Description: Lemma for rpnnen1 10347. (Contributed by Mario Carneiro, 12-May-2013.)
Hypotheses
Ref Expression
rpnnen1.1  |-  T  =  { n  e.  ZZ  |  ( n  / 
k )  <  x }
rpnnen1.2  |-  F  =  ( x  e.  RR  |->  ( k  e.  NN  |->  ( sup ( T ,  RR ,  <  )  / 
k ) ) )
Assertion
Ref Expression
rpnnen1lem4  |-  ( x  e.  RR  ->  sup ( ran  ( F `  x ) ,  RR ,  <  )  e.  RR )
Distinct variable groups:    k, F, n, x    T, n
Allowed substitution hints:    T( x, k)

Proof of Theorem rpnnen1lem4
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 rpnnen1.1 . . . . 5  |-  T  =  { n  e.  ZZ  |  ( n  / 
k )  <  x }
2 rpnnen1.2 . . . . 5  |-  F  =  ( x  e.  RR  |->  ( k  e.  NN  |->  ( sup ( T ,  RR ,  <  )  / 
k ) ) )
31, 2rpnnen1lem1 10342 . . . 4  |-  ( x  e.  RR  ->  ( F `  x )  e.  ( QQ  ^m  NN ) )
4 qexALT 10331 . . . . 5  |-  QQ  e.  _V
5 nnexALT 9748 . . . . 5  |-  NN  e.  _V
64, 5elmap 6796 . . . 4  |-  ( ( F `  x )  e.  ( QQ  ^m  NN )  <->  ( F `  x ) : NN --> QQ )
73, 6sylib 188 . . 3  |-  ( x  e.  RR  ->  ( F `  x ) : NN --> QQ )
8 frn 5395 . . . 4  |-  ( ( F `  x ) : NN --> QQ  ->  ran  ( F `  x
)  C_  QQ )
9 qssre 10326 . . . 4  |-  QQ  C_  RR
108, 9syl6ss 3191 . . 3  |-  ( ( F `  x ) : NN --> QQ  ->  ran  ( F `  x
)  C_  RR )
117, 10syl 15 . 2  |-  ( x  e.  RR  ->  ran  ( F `  x ) 
C_  RR )
12 1nn 9757 . . . . . 6  |-  1  e.  NN
13 ne0i 3461 . . . . . 6  |-  ( 1  e.  NN  ->  NN  =/=  (/) )
1412, 13ax-mp 8 . . . . 5  |-  NN  =/=  (/)
15 fdm 5393 . . . . . 6  |-  ( ( F `  x ) : NN --> QQ  ->  dom  ( F `  x
)  =  NN )
1615neeq1d 2459 . . . . 5  |-  ( ( F `  x ) : NN --> QQ  ->  ( dom  ( F `  x )  =/=  (/)  <->  NN  =/=  (/) ) )
1714, 16mpbiri 224 . . . 4  |-  ( ( F `  x ) : NN --> QQ  ->  dom  ( F `  x
)  =/=  (/) )
18 dm0rn0 4895 . . . . 5  |-  ( dom  ( F `  x
)  =  (/)  <->  ran  ( F `
 x )  =  (/) )
1918necon3bii 2478 . . . 4  |-  ( dom  ( F `  x
)  =/=  (/)  <->  ran  ( F `
 x )  =/=  (/) )
2017, 19sylib 188 . . 3  |-  ( ( F `  x ) : NN --> QQ  ->  ran  ( F `  x
)  =/=  (/) )
217, 20syl 15 . 2  |-  ( x  e.  RR  ->  ran  ( F `  x )  =/=  (/) )
221, 2rpnnen1lem3 10344 . . 3  |-  ( x  e.  RR  ->  A. n  e.  ran  ( F `  x ) n  <_  x )
23 breq2 4027 . . . . 5  |-  ( y  =  x  ->  (
n  <_  y  <->  n  <_  x ) )
2423ralbidv 2563 . . . 4  |-  ( y  =  x  ->  ( A. n  e.  ran  ( F `  x ) n  <_  y  <->  A. n  e.  ran  ( F `  x ) n  <_  x ) )
2524rspcev 2884 . . 3  |-  ( ( x  e.  RR  /\  A. n  e.  ran  ( F `  x )
n  <_  x )  ->  E. y  e.  RR  A. n  e.  ran  ( F `  x )
n  <_  y )
2622, 25mpdan 649 . 2  |-  ( x  e.  RR  ->  E. y  e.  RR  A. n  e. 
ran  ( F `  x ) n  <_ 
y )
27 suprcl 9714 . 2  |-  ( ( ran  ( F `  x )  C_  RR  /\ 
ran  ( F `  x )  =/=  (/)  /\  E. y  e.  RR  A. n  e.  ran  ( F `  x ) n  <_ 
y )  ->  sup ( ran  ( F `  x ) ,  RR ,  <  )  e.  RR )
2811, 21, 26, 27syl3anc 1182 1  |-  ( x  e.  RR  ->  sup ( ran  ( F `  x ) ,  RR ,  <  )  e.  RR )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1623    e. wcel 1684    =/= wne 2446   A.wral 2543   E.wrex 2544   {crab 2547    C_ wss 3152   (/)c0 3455   class class class wbr 4023    e. cmpt 4077   dom cdm 4689   ran crn 4690   -->wf 5251   ` cfv 5255  (class class class)co 5858    ^m cmap 6772   supcsup 7193   RRcr 8736   1c1 8738    < clt 8867    <_ cle 8868    / cdiv 9423   NNcn 9746   ZZcz 10024   QQcq 10316
This theorem is referenced by:  rpnnen1lem5  10346
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512  ax-inf2 7342  ax-resscn 8794  ax-1cn 8795  ax-icn 8796  ax-addcl 8797  ax-addrcl 8798  ax-mulcl 8799  ax-mulrcl 8800  ax-mulcom 8801  ax-addass 8802  ax-mulass 8803  ax-distr 8804  ax-i2m1 8805  ax-1ne0 8806  ax-1rid 8807  ax-rnegex 8808  ax-rrecex 8809  ax-cnre 8810  ax-pre-lttri 8811  ax-pre-lttrn 8812  ax-pre-ltadd 8813  ax-pre-mulgt0 8814  ax-pre-sup 8815
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pss 3168  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-tp 3648  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-tr 4114  df-eprel 4305  df-id 4309  df-po 4314  df-so 4315  df-fr 4352  df-we 4354  df-ord 4395  df-on 4396  df-lim 4397  df-suc 4398  df-om 4657  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-riota 6304  df-recs 6388  df-rdg 6423  df-er 6660  df-map 6774  df-en 6864  df-dom 6865  df-sdom 6866  df-sup 7194  df-pnf 8869  df-mnf 8870  df-xr 8871  df-ltxr 8872  df-le 8873  df-sub 9039  df-neg 9040  df-div 9424  df-nn 9747  df-n0 9966  df-z 10025  df-q 10317
  Copyright terms: Public domain W3C validator