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

Theorem divlt1lt 10136
Description: A real number divided by a positive real number is less than 1 iff the real number is less than the positive real number. (Contributed by AV, 25-May-2020.)
Assertion
Ref Expression
divlt1lt  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( A  /  B )  <  1  <->  A  <  B ) )

Proof of Theorem divlt1lt
StepHypRef Expression
1 simpl 109 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  ->  A  e.  RR )
2 rpregt0 10079 . . . 4  |-  ( B  e.  RR+  ->  ( B  e.  RR  /\  0  <  B ) )
32adantl 277 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( B  e.  RR  /\  0  <  B ) )
4 1re 8326 . . . . 5  |-  1  e.  RR
5 0lt1 8455 . . . . 5  |-  0  <  1
64, 5pm3.2i 272 . . . 4  |-  ( 1  e.  RR  /\  0  <  1 )
76a1i 9 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( 1  e.  RR  /\  0  <  1 ) )
8 ltdiv23 9225 . . 3  |-  ( ( A  e.  RR  /\  ( B  e.  RR  /\  0  <  B )  /\  ( 1  e.  RR  /\  0  <  1 ) )  -> 
( ( A  /  B )  <  1  <->  ( A  /  1 )  <  B ) )
91, 3, 7, 8syl3anc 1278 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( A  /  B )  <  1  <->  ( A  /  1 )  <  B ) )
10 recn 8313 . . . . 5  |-  ( A  e.  RR  ->  A  e.  CC )
1110div1d 9113 . . . 4  |-  ( A  e.  RR  ->  ( A  /  1 )  =  A )
1211adantr 276 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( A  /  1
)  =  A )
1312breq1d 4140 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( A  / 
1 )  <  B  <->  A  <  B ) )
149, 13bitrd 188 1  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( A  /  B )  <  1  <->  A  <  B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   class class class wbr 4130  (class class class)co 6085   RRcr 8179   0cc0 8180   1c1 8181    < clt 8361    / cdiv 9005   RR+crp 10065
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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298
This proof depends on definitions:  df-bi 117  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-rmo 2536  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-br 4131  df-opab 4193  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913  df-div 9006  df-rp 10066
This theorem is used by:  adddivflid  10742  divfl0  10746  flodddiv4  12722  pigt3  16037
  Copyright terms: Public domain W3C validator