ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  lediv2a Unicode version
Theorem lediv2a 9169
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 8357 . . . . . . 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 1181 . 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 529 . . . . 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 1182 . 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 9168 . 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 1005   e. wcel 2203   class class class wbr 4109  (class class class)co 6050   RRcr 8126   0cc0 8127   < clt 8308   <_ cle 8309   / cdiv 8946
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-po 4417  df-iso 4418  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947
This theorem is referenced by:  lediv2ad  10052
  Copyright terms: Public domain W3C validator