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

Theorem ltdiv1 8941
Description: Division of both sides of 'less than' by a positive number. (Contributed by NM, 10-Oct-2004.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
ltdiv1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <  B  <->  ( A  /  C )  <  ( B  /  C ) ) )

Proof of Theorem ltdiv1
StepHypRef Expression
1 simp1 1000 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  A  e.  RR )
2 simp2 1001 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  B  e.  RR )
3 simp3l 1028 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  C  e.  RR )
4 simp3r 1029 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
0  <  C )
53, 4gt0ap0d 8702 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  C #  0 )
63, 5rerecclapd 8907 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( 1  /  C
)  e.  RR )
7 recgt0 8923 . . . 4  |-  ( ( C  e.  RR  /\  0  <  C )  -> 
0  <  ( 1  /  C ) )
873ad2ant3 1023 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
0  <  ( 1  /  C ) )
9 ltmul1 8665 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  (
( 1  /  C
)  e.  RR  /\  0  <  ( 1  /  C ) ) )  ->  ( A  < 
B  <->  ( A  x.  ( 1  /  C
) )  <  ( B  x.  ( 1  /  C ) ) ) )
101, 2, 6, 8, 9syl112anc 1254 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <  B  <->  ( A  x.  ( 1  /  C ) )  <  ( B  x.  ( 1  /  C
) ) ) )
111recnd 8101 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  A  e.  CC )
123recnd 8101 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  C  e.  CC )
1311, 12, 5divrecapd 8866 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  /  C
)  =  ( A  x.  ( 1  /  C ) ) )
142recnd 8101 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  B  e.  CC )
1514, 12, 5divrecapd 8866 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( B  /  C
)  =  ( B  x.  ( 1  /  C ) ) )
1613, 15breq12d 4057 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( ( A  /  C )  <  ( B  /  C )  <->  ( A  x.  ( 1  /  C
) )  <  ( B  x.  ( 1  /  C ) ) ) )
1710, 16bitr4d 191 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:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 981    e. wcel 2176   class class class wbr 4044  (class class class)co 5944   RRcr 7924   0cc0 7925   1c1 7926    x. cmul 7930    < clt 8107    / cdiv 8745
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-mulrcl 8024  ax-addcom 8025  ax-mulcom 8026  ax-addass 8027  ax-mulass 8028  ax-distr 8029  ax-i2m1 8030  ax-0lt1 8031  ax-1rid 8032  ax-0id 8033  ax-rnegex 8034  ax-precex 8035  ax-cnre 8036  ax-pre-ltirr 8037  ax-pre-ltwlin 8038  ax-pre-lttrn 8039  ax-pre-apti 8040  ax-pre-ltadd 8041  ax-pre-mulgt0 8042  ax-pre-mulext 8043
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-id 4340  df-po 4343  df-iso 4344  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-iota 5232  df-fun 5273  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-pnf 8109  df-mnf 8110  df-xr 8111  df-ltxr 8112  df-le 8113  df-sub 8245  df-neg 8246  df-reap 8648  df-ap 8655  df-div 8746
This theorem is referenced by:  lediv1  8942  gt0div  8943  ltmuldiv  8947  ltdivmul  8949  ltdiv23  8965  ltdiv1i  8994  ltdiv1d  9864  flltdivnn0lt  10447  flqdiv  10466  hashdvds  12543  hashgcdlem  12560  sinq12gt0  15302  lgsquadlem1  15554  lgsquadlem2  15555  2lgslem1a2  15564
  Copyright terms: Public domain W3C validator