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

Theorem bndndx 9329
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 9327 . . . 4  |-  ( x  e.  RR  ->  E. k  e.  NN  x  <  k
)
2 nnre 9078 . . . . . 6  |-  ( k  e.  NN  ->  k  e.  RR )
3 lelttr 8196 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  x  e.  RR  /\  k  e.  RR )  ->  (
( A  <_  x  /\  x  <  k )  ->  A  <  k
) )
4 ltle 8195 . . . . . . . . . . . 12  |-  ( ( A  e.  RR  /\  k  e.  RR )  ->  ( A  <  k  ->  A  <_  k )
)
543adant2 1019 . . . . . . . . . . 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 1229 . . . . . . . . 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 350 . . . . . . 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 286 . . . . 5  |-  ( ( x  e.  RR  /\  k  e.  NN )  ->  ( x  <  k  ->  ( ( A  e.  RR  /\  A  <_  x )  ->  A  <_  k ) ) )
1211reximdva 2610 . . . 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 2658 . . 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 2619 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 104    /\ w3a 981    e. wcel 2178   A.wral 2486   E.wrex 2487   class class class wbr 4059   RRcr 7959    < clt 8142    <_ cle 8143   NNcn 9071
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1re 8054  ax-addrcl 8057  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-arch 8079
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-br 4060  df-opab 4122  df-xp 4699  df-cnv 4701  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-inn 9072
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator