ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  btwnzge0 Unicode version
Theorem btwnzge0 10268
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 7933 . . . 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 9346 . . . . . 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 7947 . . . . 5 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> 1 e. RR )
75, 6readdcld 7961 . . . 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 8056 . . 3 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ A ) -> 0 < ( N + 1 ) )
11 0z 9235 . . . . 5 |- 0 e. ZZ
12 zleltp1 9279 . . . . 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 7933 . . 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 8055 . 2 |- ( ( ( ( A e. RR /\ N e. ZZ ) /\ ( N <_ A /\ A < ( N + 1 ) ) ) /\ 0 <_ N ) -> 0 <_ A )
2215, 21impbida 596 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 2146   class class class wbr 3998  (class class class)co 5865   RRcr 7785   0cc0 7786   1c1 7787   + caddc 7789   < clt 7966   <_ cle 7967   ZZcz 9224
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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-cnex 7877  ax-resscn 7878  ax-1cn 7879  ax-1re 7880  ax-icn 7881  ax-addcl 7882  ax-addrcl 7883  ax-mulcl 7884  ax-addcom 7886  ax-addass 7888  ax-distr 7890  ax-i2m1 7891  ax-0lt1 7892  ax-0id 7894  ax-rnegex 7895  ax-cnre 7897  ax-pre-ltirr 7898  ax-pre-ltwlin 7899  ax-pre-lttrn 7900  ax-pre-ltadd 7902
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-reu 2460  df-rab 2462  df-v 2737  df-sbc 2961  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-br 3999  df-opab 4060  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-iota 5170  df-fun 5210  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-pnf 7968  df-mnf 7969  df-xr 7970  df-ltxr 7971  df-le 7972  df-sub 8104  df-neg 8105  df-inn 8891  df-n0 9148  df-z 9225
This theorem is referenced by:  2tnp1ge0ge0  10269
  Copyright terms: Public domain W3C validator