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

Theorem lediv2a 8866
Description: Division of both sides of 'less than or equal to' into a nonnegative number. (Contributed by Paul Chapman, 7-Sep-2007.)
Assertion
Ref Expression
lediv2a  |-  ( ( ( ( A  e.  RR  /\  0  < 
A )  /\  ( B  e.  RR  /\  0  <  B )  /\  ( C  e.  RR  /\  0  <_  C ) )  /\  A  <_  B )  -> 
( C  /  B
)  <_  ( C  /  A ) )

Proof of Theorem lediv2a
StepHypRef Expression
1 pm3.2 139 . . . . . . 7  |-  ( C  e.  RR  ->  ( C  e.  RR  ->  ( C  e.  RR  /\  C  e.  RR )
) )
21pm2.43i 49 . . . . . 6  |-  ( C  e.  RR  ->  ( C  e.  RR  /\  C  e.  RR ) )
32adantr 276 . . . . 5  |-  ( ( C  e.  RR  /\  0  <_  C )  -> 
( C  e.  RR  /\  C  e.  RR ) )
4 leid 8055 . . . . . . 7  |-  ( C  e.  RR  ->  C  <_  C )
54anim2i 342 . . . . . 6  |-  ( ( 0  <_  C  /\  C  e.  RR )  ->  ( 0  <_  C  /\  C  <_  C ) )
65ancoms 268 . . . . 5  |-  ( ( C  e.  RR  /\  0  <_  C )  -> 
( 0  <_  C  /\  C  <_  C ) )
73, 6jca 306 . . . 4  |-  ( ( C  e.  RR  /\  0  <_  C )  -> 
( ( C  e.  RR  /\  C  e.  RR )  /\  (
0  <_  C  /\  C  <_  C ) ) )
87ad2antlr 489 . . 3  |-  ( ( ( ( A  e.  RR  /\  0  < 
A )  /\  ( C  e.  RR  /\  0  <_  C ) )  /\  A  <_  B )  -> 
( ( C  e.  RR  /\  C  e.  RR )  /\  (
0  <_  C  /\  C  <_  C ) ) )
983adantl2 1155 . 2  |-  ( ( ( ( A  e.  RR  /\  0  < 
A )  /\  ( B  e.  RR  /\  0  <  B )  /\  ( C  e.  RR  /\  0  <_  C ) )  /\  A  <_  B )  -> 
( ( C  e.  RR  /\  C  e.  RR )  /\  (
0  <_  C  /\  C  <_  C ) ) )
10 id 19 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  e.  RR  /\  B  e.  RR ) )
1110ad2ant2r 509 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B ) )  -> 
( A  e.  RR  /\  B  e.  RR ) )
1211adantr 276 . . . 4  |-  ( ( ( ( A  e.  RR  /\  0  < 
A )  /\  ( B  e.  RR  /\  0  <  B ) )  /\  A  <_  B )  -> 
( A  e.  RR  /\  B  e.  RR ) )
13 simplr 528 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <  A )  /\  ( B  e.  RR  /\  0  < 
B ) )  -> 
0  <  A )
1413anim1i 340 . . . 4  |-  ( ( ( ( A  e.  RR  /\  0  < 
A )  /\  ( B  e.  RR  /\  0  <  B ) )  /\  A  <_  B )  -> 
( 0  <  A  /\  A  <_  B ) )
1512, 14jca 306 . . 3  |-  ( ( ( ( A  e.  RR  /\  0  < 
A )  /\  ( B  e.  RR  /\  0  <  B ) )  /\  A  <_  B )  -> 
( ( A  e.  RR  /\  B  e.  RR )  /\  (
0  <  A  /\  A  <_  B ) ) )
16153adantl3 1156 . 2  |-  ( ( ( ( A  e.  RR  /\  0  < 
A )  /\  ( B  e.  RR  /\  0  <  B )  /\  ( C  e.  RR  /\  0  <_  C ) )  /\  A  <_  B )  -> 
( ( A  e.  RR  /\  B  e.  RR )  /\  (
0  <  A  /\  A  <_  B ) ) )
17 lediv12a 8865 . 2  |-  ( ( ( ( C  e.  RR  /\  C  e.  RR )  /\  (
0  <_  C  /\  C  <_  C ) )  /\  ( ( A  e.  RR  /\  B  e.  RR )  /\  (
0  <  A  /\  A  <_  B ) ) )  ->  ( C  /  B )  <_  ( C  /  A ) )
189, 16, 17syl2anc 411 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 104    /\ w3a 979    e. wcel 2158   class class class wbr 4015  (class class class)co 5888   RRcr 7824   0cc0 7825    < clt 8006    <_ cle 8007    / cdiv 8643
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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-cnex 7916  ax-resscn 7917  ax-1cn 7918  ax-1re 7919  ax-icn 7920  ax-addcl 7921  ax-addrcl 7922  ax-mulcl 7923  ax-mulrcl 7924  ax-addcom 7925  ax-mulcom 7926  ax-addass 7927  ax-mulass 7928  ax-distr 7929  ax-i2m1 7930  ax-0lt1 7931  ax-1rid 7932  ax-0id 7933  ax-rnegex 7934  ax-precex 7935  ax-cnre 7936  ax-pre-ltirr 7937  ax-pre-ltwlin 7938  ax-pre-lttrn 7939  ax-pre-apti 7940  ax-pre-ltadd 7941  ax-pre-mulgt0 7942  ax-pre-mulext 7943
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rmo 2473  df-rab 2474  df-v 2751  df-sbc 2975  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-br 4016  df-opab 4077  df-id 4305  df-po 4308  df-iso 4309  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-iota 5190  df-fun 5230  df-fv 5236  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-pnf 8008  df-mnf 8009  df-xr 8010  df-ltxr 8011  df-le 8012  df-sub 8144  df-neg 8145  df-reap 8546  df-ap 8553  df-div 8644
This theorem is referenced by:  lediv2ad  9733
  Copyright terms: Public domain W3C validator