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

Theorem bndndx 9000
Description: A bounded real sequence  A (
k ) is less than or equal to at least one of its indices. (Contributed by NM, 18-Jan-2008.)
Assertion
Ref Expression
bndndx  |-  ( E. x  e.  RR  A. k  e.  NN  ( A  e.  RR  /\  A  <_  x )  ->  E. k  e.  NN  A  <_  k
)
Distinct variable groups:    x, A    x, k
Allowed substitution hint:    A( k)

Proof of Theorem bndndx
StepHypRef Expression
1 arch 8998 . . . 4  |-  ( x  e.  RR  ->  E. k  e.  NN  x  <  k
)
2 nnre 8751 . . . . . 6  |-  ( k  e.  NN  ->  k  e.  RR )
3 lelttr 7876 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  x  e.  RR  /\  k  e.  RR )  ->  (
( A  <_  x  /\  x  <  k )  ->  A  <  k
) )
4 ltle 7875 . . . . . . . . . . . 12  |-  ( ( A  e.  RR  /\  k  e.  RR )  ->  ( A  <  k  ->  A  <_  k )
)
543adant2 1001 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  x  e.  RR  /\  k  e.  RR )  ->  ( A  <  k  ->  A  <_  k ) )
63, 5syld 45 . . . . . . . . . 10  |-  ( ( A  e.  RR  /\  x  e.  RR  /\  k  e.  RR )  ->  (
( A  <_  x  /\  x  <  k )  ->  A  <_  k
) )
76exp5o 1205 . . . . . . . . 9  |-  ( A  e.  RR  ->  (
x  e.  RR  ->  ( k  e.  RR  ->  ( A  <_  x  ->  ( x  <  k  ->  A  <_  k ) ) ) ) )
87com3l 81 . . . . . . . 8  |-  ( x  e.  RR  ->  (
k  e.  RR  ->  ( A  e.  RR  ->  ( A  <_  x  ->  ( x  <  k  ->  A  <_  k ) ) ) ) )
98imp4b 348 . . . . . . 7  |-  ( ( x  e.  RR  /\  k  e.  RR )  ->  ( ( A  e.  RR  /\  A  <_  x )  ->  (
x  <  k  ->  A  <_  k ) ) )
109com23 78 . . . . . 6  |-  ( ( x  e.  RR  /\  k  e.  RR )  ->  ( x  <  k  ->  ( ( A  e.  RR  /\  A  <_  x )  ->  A  <_  k ) ) )
112, 10sylan2 284 . . . . 5  |-  ( ( x  e.  RR  /\  k  e.  NN )  ->  ( x  <  k  ->  ( ( A  e.  RR  /\  A  <_  x )  ->  A  <_  k ) ) )
1211reximdva 2537 . . . 4  |-  ( x  e.  RR  ->  ( E. k  e.  NN  x  <  k  ->  E. k  e.  NN  ( ( A  e.  RR  /\  A  <_  x )  ->  A  <_  k ) ) )
131, 12mpd 13 . . 3  |-  ( x  e.  RR  ->  E. k  e.  NN  ( ( A  e.  RR  /\  A  <_  x )  ->  A  <_  k ) )
14 r19.35-1 2584 . . 3  |-  ( E. k  e.  NN  (
( A  e.  RR  /\  A  <_  x )  ->  A  <_  k )  ->  ( A. k  e.  NN  ( A  e.  RR  /\  A  <_  x )  ->  E. k  e.  NN  A  <_  k
) )
1513, 14syl 14 . 2  |-  ( x  e.  RR  ->  ( A. k  e.  NN  ( A  e.  RR  /\  A  <_  x )  ->  E. k  e.  NN  A  <_  k ) )
1615rexlimiv 2546 1  |-  ( E. x  e.  RR  A. k  e.  NN  ( A  e.  RR  /\  A  <_  x )  ->  E. k  e.  NN  A  <_  k
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 963    e. wcel 1481   A.wral 2417   E.wrex 2418   class class class wbr 3937   RRcr 7643    < clt 7824    <_ cle 7825   NNcn 8744
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-cnex 7735  ax-resscn 7736  ax-1re 7738  ax-addrcl 7741  ax-pre-ltirr 7756  ax-pre-ltwlin 7757  ax-pre-lttrn 7758  ax-arch 7763
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-br 3938  df-opab 3998  df-xp 4553  df-cnv 4555  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-inn 8745
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator