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

Theorem lediv2 8794
Description: Division of a positive number by both sides of 'less than or equal to'. (Contributed by NM, 10-Jan-2006.)
Assertion
Ref Expression
lediv2  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <_  B  <->  ( C  /  B )  <_  ( C  /  A ) ) )

Proof of Theorem lediv2
StepHypRef Expression
1 simp2l 1018 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  B  e.  RR )
2 simp2r 1019 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
0  <  B )
31, 2gt0ap0d 8535 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  B #  0 )
41, 3rerecclapd 8738 . . 3  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( 1  /  B
)  e.  RR )
5 simp1l 1016 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  A  e.  RR )
6 simp1r 1017 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
0  <  A )
75, 6gt0ap0d 8535 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  A #  0 )
85, 7rerecclapd 8738 . . 3  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( 1  /  A
)  e.  RR )
9 simp3l 1020 . . 3  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  C  e.  RR )
10 simp3r 1021 . . 3  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
0  <  C )
11 lemul2 8760 . . 3  |-  ( ( ( 1  /  B
)  e.  RR  /\  ( 1  /  A
)  e.  RR  /\  ( C  e.  RR  /\  0  <  C ) )  ->  ( (
1  /  B )  <_  ( 1  /  A )  <->  ( C  x.  ( 1  /  B
) )  <_  ( C  x.  ( 1  /  A ) ) ) )
124, 8, 9, 10, 11syl112anc 1237 . 2  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( ( 1  /  B )  <_  (
1  /  A )  <-> 
( C  x.  (
1  /  B ) )  <_  ( C  x.  ( 1  /  A
) ) ) )
13 lerec 8787 . . 3  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B ) )  -> 
( A  <_  B  <->  ( 1  /  B )  <_  ( 1  /  A ) ) )
14133adant3 1012 . 2  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <_  B  <->  ( 1  /  B )  <_  ( 1  /  A ) ) )
159recnd 7935 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  C  e.  CC )
161recnd 7935 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  B  e.  CC )
1715, 16, 3divrecapd 8697 . . 3  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( C  /  B
)  =  ( C  x.  ( 1  /  B ) ) )
185recnd 7935 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  ->  A  e.  CC )
1915, 18, 7divrecapd 8697 . . 3  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( C  /  A
)  =  ( C  x.  ( 1  /  A ) ) )
2017, 19breq12d 4000 . 2  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( ( C  /  B )  <_  ( C  /  A )  <->  ( C  x.  ( 1  /  B
) )  <_  ( C  x.  ( 1  /  A ) ) ) )
2112, 14, 203bitr4d 219 1  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B )  /\  ( C  e.  RR  /\  0  <  C ) )  -> 
( A  <_  B  <->  ( C  /  B )  <_  ( C  /  A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 973    e. wcel 2141   class class class wbr 3987  (class class class)co 5850   RRcr 7760   0cc0 7761   1c1 7762    x. cmul 7766    < clt 7941    <_ cle 7942    / cdiv 8576
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 4105  ax-pow 4158  ax-pr 4192  ax-un 4416  ax-setind 4519  ax-cnex 7852  ax-resscn 7853  ax-1cn 7854  ax-1re 7855  ax-icn 7856  ax-addcl 7857  ax-addrcl 7858  ax-mulcl 7859  ax-mulrcl 7860  ax-addcom 7861  ax-mulcom 7862  ax-addass 7863  ax-mulass 7864  ax-distr 7865  ax-i2m1 7866  ax-0lt1 7867  ax-1rid 7868  ax-0id 7869  ax-rnegex 7870  ax-precex 7871  ax-cnre 7872  ax-pre-ltirr 7873  ax-pre-ltwlin 7874  ax-pre-lttrn 7875  ax-pre-apti 7876  ax-pre-ltadd 7877  ax-pre-mulgt0 7878  ax-pre-mulext 7879
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 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-opab 4049  df-id 4276  df-po 4279  df-iso 4280  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-iota 5158  df-fun 5198  df-fv 5204  df-riota 5806  df-ov 5853  df-oprab 5854  df-mpo 5855  df-pnf 7943  df-mnf 7944  df-xr 7945  df-ltxr 7946  df-le 7947  df-sub 8079  df-neg 8080  df-reap 8481  df-ap 8488  df-div 8577
This theorem is referenced by:  lediv2d  9665  nnledivrp  9710  isprm6  12088  divdenle  12138
  Copyright terms: Public domain W3C validator