ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  btwnzge0 Unicode version
Theorem btwnzge0 10550
Description: A real bounded between an integer and its successor is nonnegative iff the integer is nonnegative. Second half of Lemma 13-4.1 of [Gleason] p. 217. (Contributed by NM, 12-Mar-2005.)
Assertion
Ref Expression
btwnzge0 |- ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) -> ( 0 <_ A <-> 0 <_ N ) )
Proof of Theorem btwnzge0
StepHypRef Expression
1 0red 8170 . . . 4 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> 0 e. RR )
2 simplll 533 . . . 4 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> A e. RR )
3 simplr 528 . . . . . . 7 |- ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) -> N e. ZZ )
43zred 9592 . . . . . 6 |- ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) -> N e. RR )
54adantr 276 . . . . 5 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> N e. RR )
6 1red 8184 . . . . 5 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> 1 e. RR )
75, 6readdcld 8199 . . . 4 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> ( N + 1 ) e. RR )
8 simpr 110 . . . 4 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> 0 <_ A )
9 simplrr 536 . . . 4 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> A < ( N + 1 ) )
101, 2, 7, 8, 9lelttrd 8294 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> 0 < ( N + 1 ) )
11 0z 9480 . . . . 5 |- 0 e. ZZ
12 zleltp1 9525 . . . . 5 |- ( ( 0 e. ZZ /\ N e. ZZ ) -> ( 0 <_ N <-> 0 < ( N + 1 ) ) )
1311, 12mpan 424 . . . 4 |- ( N e. ZZ -> ( 0 <_ N <-> 0 < ( N + 1 ) ) )
1413ad3antlr 493 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> ( 0 <_ N <-> 0 < ( N + 1 ) ) )
1510, 14mpbird 167 . 2 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> 0 <_ N )
16 0red 8170 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ N ) -> 0 e. RR )
174adantr 276 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ N ) -> N e. RR )
18 simplll 533 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ N ) -> A e. RR )
19 simpr 110 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ N ) -> 0 <_ N )
20 simplrl 535 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ N ) -> N <_ A )
2116, 17, 18, 19, 20letrd 8293 . 2 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ N ) -> 0 <_ A )
2215, 21impbida 598 1 |- ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) -> ( 0 <_ A <-> 0 <_ N ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2200   class class class wbr 4086  (class class class)co 6013   RRcr 8021   0cc0 8022   1c1 8023   + caddc 8025   < clt 8204   <_ cle 8205   ZZcz 9469
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-iota 5284  df-fun 5326  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470
This theorem is referenced by:  2tnp1ge0ge0  10551
  Copyright terms: Public domain W3C validator