ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  lediv2a Unicode version
Theorem lediv2a 9117
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 8305 . . . . . . 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 9116 . 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 2202   class class class wbr 4093  (class class class)co 6028   RRcr 8074   0cc0 8075   < clt 8256   <_ cle 8257   / cdiv 8894
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-po 4399  df-iso 4400  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-reap 8797  df-ap 8804  df-div 8895
This theorem is referenced by:  lediv2ad  9998
  Copyright terms: Public domain W3C validator