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

Theorem btwnzge0 10756
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 8333 . . . 4  |-  ( ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  /\  0  <_  A )  -> 
0  e.  RR )
2 simplll 539 . . . 4  |-  ( ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  /\  0  <_  A )  ->  A  e.  RR )
3 simplr 533 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  ->  N  e.  ZZ )
43zred 9779 . . . . . 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 8347 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  /\  0  <_  A )  -> 
1  e.  RR )
75, 6readdcld 8361 . . . 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 542 . . . 4  |-  ( ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  /\  0  <_  A )  ->  A  <  ( N  + 
1 ) )
101, 2, 7, 8, 9lelttrd 8458 . . 3  |-  ( ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  /\  0  <_  A )  -> 
0  <  ( N  +  1 ) )
11 0z 9666 . . . . 5  |-  0  e.  ZZ
12 zleltp1 9711 . . . . 5  |-  ( ( 0  e.  ZZ  /\  N  e.  ZZ )  ->  ( 0  <_  N  <->  0  <  ( N  + 
1 ) ) )
1311, 12mpan 428 . . . 4  |-  ( N  e.  ZZ  ->  (
0  <_  N  <->  0  <  ( N  +  1 ) ) )
1413ad3antlr 497 . . 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 8333 . . 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 539 . . 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 541 . . 3  |-  ( ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  /\  0  <_  N )  ->  N  <_  A )
2116, 17, 18, 19, 20letrd 8457 . 2  |-  ( ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  /\  0  <_  N )  -> 
0  <_  A )
2215, 21impbida 604 1  |-  ( ( ( A  e.  RR  /\  N  e.  ZZ )  /\  ( N  <_  A  /\  A  <  ( N  +  1 ) ) )  ->  (
0  <_  A  <->  0  <_  N ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2209   class class class wbr 4131  (class class class)co 6088   RRcr 8184   0cc0 8185   1c1 8186    + caddc 8188    < clt 8366    <_ cle 8367   ZZcz 9655
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656
This theorem is used by:  2tnp1ge0ge0  10757
  Copyright terms: Public domain W3C validator