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

Theorem rpnnen1lem4 10987
Description: Lemma for rpnnen1 10989. (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 10984 . . . 4  |-  ( x  e.  RR  ->  ( F `  x )  e.  ( QQ  ^m  NN ) )
4 qexALT 10973 . . . . 5  |-  QQ  e.  _V
5 nnexALT 10329 . . . . 5  |-  NN  e.  _V
64, 5elmap 7246 . . . 4  |-  ( ( F `  x )  e.  ( QQ  ^m  NN )  <->  ( F `  x ) : NN --> QQ )
73, 6sylib 196 . . 3  |-  ( x  e.  RR  ->  ( F `  x ) : NN --> QQ )
8 frn 5570 . . . 4  |-  ( ( F `  x ) : NN --> QQ  ->  ran  ( F `  x
)  C_  QQ )
9 qssre 10968 . . . 4  |-  QQ  C_  RR
108, 9syl6ss 3373 . . 3  |-  ( ( F `  x ) : NN --> QQ  ->  ran  ( F `  x
)  C_  RR )
117, 10syl 16 . 2  |-  ( x  e.  RR  ->  ran  ( F `  x ) 
C_  RR )
12 1nn 10338 . . . . . 6  |-  1  e.  NN
13 ne0i 3648 . . . . . 6  |-  ( 1  e.  NN  ->  NN  =/=  (/) )
1412, 13ax-mp 5 . . . . 5  |-  NN  =/=  (/)
15 fdm 5568 . . . . . 6  |-  ( ( F `  x ) : NN --> QQ  ->  dom  ( F `  x
)  =  NN )
1615neeq1d 2626 . . . . 5  |-  ( ( F `  x ) : NN --> QQ  ->  ( dom  ( F `  x )  =/=  (/)  <->  NN  =/=  (/) ) )
1714, 16mpbiri 233 . . . 4  |-  ( ( F `  x ) : NN --> QQ  ->  dom  ( F `  x
)  =/=  (/) )
18 dm0rn0 5061 . . . . 5  |-  ( dom  ( F `  x
)  =  (/)  <->  ran  ( F `
 x )  =  (/) )
1918necon3bii 2645 . . . 4  |-  ( dom  ( F `  x
)  =/=  (/)  <->  ran  ( F `
 x )  =/=  (/) )
2017, 19sylib 196 . . 3  |-  ( ( F `  x ) : NN --> QQ  ->  ran  ( F `  x
)  =/=  (/) )
217, 20syl 16 . 2  |-  ( x  e.  RR  ->  ran  ( F `  x )  =/=  (/) )
221, 2rpnnen1lem3 10986 . . 3  |-  ( x  e.  RR  ->  A. n  e.  ran  ( F `  x ) n  <_  x )
23 breq2 4301 . . . . 5  |-  ( y  =  x  ->  (
n  <_  y  <->  n  <_  x ) )
2423ralbidv 2740 . . . 4  |-  ( y  =  x  ->  ( A. n  e.  ran  ( F `  x ) n  <_  y  <->  A. n  e.  ran  ( F `  x ) n  <_  x ) )
2524rspcev 3078 . . 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 668 . 2  |-  ( x  e.  RR  ->  E. y  e.  RR  A. n  e. 
ran  ( F `  x ) n  <_ 
y )
27 suprcl 10295 . 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 1218 1  |-  ( x  e.  RR  ->  sup ( ran  ( F `  x ) ,  RR ,  <  )  e.  RR )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1369    e. wcel 1756    =/= wne 2611   A.wral 2720   E.wrex 2721   {crab 2724    C_ wss 3333   (/)c0 3642   class class class wbr 4297    e. cmpt 4355   dom cdm 4845   ran crn 4846   -->wf 5419   ` cfv 5423  (class class class)co 6096    ^m cmap 7219   supcsup 7695   RRcr 9286   1c1 9288    < clt 9423    <_ cle 9424    / cdiv 9998   NNcn 10327   ZZcz 10651   QQcq 10958
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4408  ax-sep 4418  ax-nul 4426  ax-pow 4475  ax-pr 4536  ax-un 6377  ax-inf2 7852  ax-resscn 9344  ax-1cn 9345  ax-icn 9346  ax-addcl 9347  ax-addrcl 9348  ax-mulcl 9349  ax-mulrcl 9350  ax-mulcom 9351  ax-addass 9352  ax-mulass 9353  ax-distr 9354  ax-i2m1 9355  ax-1ne0 9356  ax-1rid 9357  ax-rnegex 9358  ax-rrecex 9359  ax-cnre 9360  ax-pre-lttri 9361  ax-pre-lttrn 9362  ax-pre-ltadd 9363  ax-pre-mulgt0 9364  ax-pre-sup 9365
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2573  df-ne 2613  df-nel 2614  df-ral 2725  df-rex 2726  df-reu 2727  df-rmo 2728  df-rab 2729  df-v 2979  df-sbc 3192  df-csb 3294  df-dif 3336  df-un 3338  df-in 3340  df-ss 3347  df-pss 3349  df-nul 3643  df-if 3797  df-pw 3867  df-sn 3883  df-pr 3885  df-tp 3887  df-op 3889  df-uni 4097  df-iun 4178  df-br 4298  df-opab 4356  df-mpt 4357  df-tr 4391  df-eprel 4637  df-id 4641  df-po 4646  df-so 4647  df-fr 4684  df-we 4686  df-ord 4727  df-on 4728  df-lim 4729  df-suc 4730  df-xp 4851  df-rel 4852  df-cnv 4853  df-co 4854  df-dm 4855  df-rn 4856  df-res 4857  df-ima 4858  df-iota 5386  df-fun 5425  df-fn 5426  df-f 5427  df-f1 5428  df-fo 5429  df-f1o 5430  df-fv 5431  df-riota 6057  df-ov 6099  df-oprab 6100  df-mpt2 6101  df-om 6482  df-1st 6582  df-2nd 6583  df-recs 6837  df-rdg 6871  df-er 7106  df-map 7221  df-en 7316  df-dom 7317  df-sdom 7318  df-sup 7696  df-pnf 9425  df-mnf 9426  df-xr 9427  df-ltxr 9428  df-le 9429  df-sub 9602  df-neg 9603  df-div 9999  df-nn 10328  df-n0 10585  df-z 10652  df-q 10959
This theorem is referenced by:  rpnnen1lem5  10988
  Copyright terms: Public domain W3C validator