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

Theorem lediv1 8785
Description: Division of both sides of a less than or equal to relation by a positive number. (Contributed by NM, 18-Nov-2004.)
Assertion
Ref Expression
lediv1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <_  B  <->  ( A  /  C )  <_  ( B  /  C ) ) )

Proof of Theorem lediv1
StepHypRef Expression
1 ltdiv1 8784 . . . 4  |-  ( ( B  e.  RR  /\  A  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( B  <  A  <->  ( B  /  C )  <  ( A  /  C ) ) )
213com12 1202 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( B  <  A  <->  ( B  /  C )  <  ( A  /  C ) ) )
32notbid 662 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( -.  B  < 
A  <->  -.  ( B  /  C )  <  ( A  /  C ) ) )
4 lenlt 7995 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  <_  B  <->  -.  B  <  A ) )
543adant3 1012 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <_  B  <->  -.  B  <  A ) )
6 gt0ap0 8545 . . . . . . 7  |-  ( ( C  e.  RR  /\  0  <  C )  ->  C #  0 )
763adant1 1010 . . . . . 6  |-  ( ( A  e.  RR  /\  C  e.  RR  /\  0  <  C )  ->  C #  0 )
8 redivclap 8648 . . . . . 6  |-  ( ( A  e.  RR  /\  C  e.  RR  /\  C #  0 )  ->  ( A  /  C )  e.  RR )
97, 8syld3an3 1278 . . . . 5  |-  ( ( A  e.  RR  /\  C  e.  RR  /\  0  <  C )  ->  ( A  /  C )  e.  RR )
1093expb 1199 . . . 4  |-  ( ( A  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  ( A  /  C )  e.  RR )
11103adant2 1011 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  /  C
)  e.  RR )
1263adant1 1010 . . . . . 6  |-  ( ( B  e.  RR  /\  C  e.  RR  /\  0  <  C )  ->  C #  0 )
13 redivclap 8648 . . . . . 6  |-  ( ( B  e.  RR  /\  C  e.  RR  /\  C #  0 )  ->  ( B  /  C )  e.  RR )
1412, 13syld3an3 1278 . . . . 5  |-  ( ( B  e.  RR  /\  C  e.  RR  /\  0  <  C )  ->  ( B  /  C )  e.  RR )
15143expb 1199 . . . 4  |-  ( ( B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  ( B  /  C )  e.  RR )
16153adant1 1010 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( B  /  C
)  e.  RR )
1711, 16lenltd 8037 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( ( A  /  C )  <_  ( B  /  C )  <->  -.  ( B  /  C )  < 
( A  /  C
) ) )
183, 5, 173bitr4d 219 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <_  B  <->  ( A  /  C )  <_  ( B  /  C ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 973    e. wcel 2141   class class class wbr 3989  (class class class)co 5853   RRcr 7773   0cc0 7774    < clt 7954    <_ cle 7955   # cap 8500    / cdiv 8589
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891  ax-pre-mulext 7892
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-po 4281  df-iso 4282  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-reap 8494  df-ap 8501  df-div 8590
This theorem is referenced by:  ge0div  8787  ledivmul  8793  lediv23  8809  lediv1d  9700  icccntr  9957  sin01bnd  11720  cos01bnd  11721  sin02gt0  11726  hashdvds  12175  cosordlem  13564
  Copyright terms: Public domain W3C validator