Theorem bndndx 9400

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

Step	Hyp	Ref	Expression
1		arch 9398	. . . 4 |- ( x e. RR -> E. k e. NN x < k )
2		nnre 9149	. . . . . 6 |- ( k e. NN -> k e. RR )
3		lelttr 8267	. . . . . . . . . . 11 |- ( ( A e. RR /\ x e. RR /\ k e. RR ) -> ( ( A <_ x /\ x < k ) -> A < k ) )
4		ltle 8266	. . . . . . . . . . . 12 |- ( ( A e. RR /\ k e. RR ) -> ( A < k -> A <_ k ) )
5	4	3adant2 1042	. . . . . . . . . . 11 |- ( ( A e. RR /\ x e. RR /\ k e. RR ) -> ( A < k -> A <_ k ) )
6	3, 5	syld 45	. . . . . . . . . 10 |- ( ( A e. RR /\ x e. RR /\ k e. RR ) -> ( ( A <_ x /\ x < k ) -> A <_ k ) )
7	6	exp5o 1252	. . . . . . . . 9 |- ( A e. RR -> ( x e. RR -> ( k e. RR -> ( A <_ x -> ( x < k -> A <_ k ) ) ) ) )
8	7	com3l 81	. . . . . . . 8 |- ( x e. RR -> ( k e. RR -> ( A e. RR -> ( A <_ x -> ( x < k -> A <_ k ) ) ) ) )
9	8	imp4b 350	. . . . . . 7 |- ( ( x e. RR /\ k e. RR ) -> ( ( A e. RR /\ A <_ x ) -> ( x < k -> A <_ k ) ) )
10	9	com23 78	. . . . . 6 |- ( ( x e. RR /\ k e. RR ) -> ( x < k -> ( ( A e. RR /\ A <_ x ) -> A <_ k ) ) )
11	2, 10	sylan2 286	. . . . 5 |- ( ( x e. RR /\ k e. NN ) -> ( x < k -> ( ( A e. RR /\ A <_ x ) -> A <_ k ) ) )
12	11	reximdva 2634	. . . 4 |- ( x e. RR -> ( E. k e. NN x < k -> E. k e. NN ( ( A e. RR /\ A <_ x ) -> A <_ k ) ) )
13	1, 12	mpd 13	. . 3 |- ( x e. RR -> E. k e. NN ( ( A e. RR /\ A <_ x ) -> A <_ k ) )
14		r19.35-1 2683	. . 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 ) )
15	13, 14	syl 14	. 2 |- ( x e. RR -> ( A. k e. NN ( A e. RR /\ A <_ x ) -> E. k e. NN A <_ k ) )
16	15	rexlimiv 2644	1 |- ( E. x e. RR A. k e. NN ( A e. RR /\ A <_ x ) -> E. k e. NN A <_ k )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   e. wcel 2202   A.wral 2510   E.wrex 2511   class class class wbr 4088   RRcr 8030   < clt 8213   <_ cle 8214   NNcn 9142

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-arch 8150

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-xp 4731  df-cnv 4733  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-inn 9143

This theorem is referenced by: (None)