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

Theorem bndndx 9134
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 9132 . . . 4  |-  ( x  e.  RR  ->  E. k  e.  NN  x  <  k
)
2 nnre 8885 . . . . . 6  |-  ( k  e.  NN  ->  k  e.  RR )
3 lelttr 8008 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  x  e.  RR  /\  k  e.  RR )  ->  (
( A  <_  x  /\  x  <  k )  ->  A  <  k
) )
4 ltle 8007 . . . . . . . . . . . 12  |-  ( ( A  e.  RR  /\  k  e.  RR )  ->  ( A  <  k  ->  A  <_  k )
)
543adant2 1011 . . . . . . . . . . 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 1221 . . . . . . . . 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 2572 . . . 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 2620 . . 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 2581 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 973    e. wcel 2141   A.wral 2448   E.wrex 2449   class class class wbr 3989   RRcr 7773    < clt 7954    <_ cle 7955   NNcn 8878
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1re 7868  ax-addrcl 7871  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-arch 7893
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-br 3990  df-opab 4051  df-xp 4617  df-cnv 4619  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-inn 8879
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator