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

Theorem ledivge1le 9611
Description: If a number is less than or equal to another number, the number divided by a positive number greater than or equal to one is less than or equal to the other number. (Contributed by AV, 29-Jun-2021.)
Assertion
Ref Expression
ledivge1le  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  -> 
( A  <_  B  ->  ( A  /  C
)  <_  B )
)

Proof of Theorem ledivge1le
StepHypRef Expression
1 divle1le 9610 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( A  /  B )  <_  1  <->  A  <_  B ) )
21adantr 274 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( ( A  /  B )  <_  1  <->  A  <_  B ) )
3 rerpdivcl 9569 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( A  /  B
)  e.  RR )
43adantr 274 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( A  /  B
)  e.  RR )
5 1red 7872 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  1  e.  RR )
6 rpre 9545 . . . . . . . . . . 11  |-  ( C  e.  RR+  ->  C  e.  RR )
76adantl 275 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  C  e.  RR )
8 letr 7939 . . . . . . . . . 10  |-  ( ( ( A  /  B
)  e.  RR  /\  1  e.  RR  /\  C  e.  RR )  ->  (
( ( A  /  B )  <_  1  /\  1  <_  C )  ->  ( A  /  B )  <_  C
) )
94, 5, 7, 8syl3anc 1217 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( ( ( A  /  B )  <_ 
1  /\  1  <_  C )  ->  ( A  /  B )  <_  C
) )
109expd 256 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( ( A  /  B )  <_  1  ->  ( 1  <_  C  ->  ( A  /  B
)  <_  C )
) )
112, 10sylbird 169 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( A  <_  B  ->  ( 1  <_  C  ->  ( A  /  B
)  <_  C )
) )
1211com23 78 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( 1  <_  C  ->  ( A  <_  B  ->  ( A  /  B
)  <_  C )
) )
1312expimpd 361 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( C  e.  RR+  /\  1  <_  C
)  ->  ( A  <_  B  ->  ( A  /  B )  <_  C
) ) )
1413ex 114 . . . 4  |-  ( A  e.  RR  ->  ( B  e.  RR+  ->  (
( C  e.  RR+  /\  1  <_  C )  ->  ( A  <_  B  ->  ( A  /  B
)  <_  C )
) ) )
15143imp1 1199 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  /\  A  <_  B )  -> 
( A  /  B
)  <_  C )
16 simp1 982 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  ->  A  e.  RR )
176adantr 274 . . . . . . . 8  |-  ( ( C  e.  RR+  /\  1  <_  C )  ->  C  e.  RR )
18 0lt1 7981 . . . . . . . . . 10  |-  0  <  1
19 0red 7858 . . . . . . . . . . 11  |-  ( C  e.  RR+  ->  0  e.  RR )
20 1red 7872 . . . . . . . . . . 11  |-  ( C  e.  RR+  ->  1  e.  RR )
21 ltletr 7945 . . . . . . . . . . 11  |-  ( ( 0  e.  RR  /\  1  e.  RR  /\  C  e.  RR )  ->  (
( 0  <  1  /\  1  <_  C )  ->  0  <  C
) )
2219, 20, 6, 21syl3anc 1217 . . . . . . . . . 10  |-  ( C  e.  RR+  ->  ( ( 0  <  1  /\  1  <_  C )  ->  0  <  C ) )
2318, 22mpani 427 . . . . . . . . 9  |-  ( C  e.  RR+  ->  ( 1  <_  C  ->  0  <  C ) )
2423imp 123 . . . . . . . 8  |-  ( ( C  e.  RR+  /\  1  <_  C )  ->  0  <  C )
2517, 24jca 304 . . . . . . 7  |-  ( ( C  e.  RR+  /\  1  <_  C )  ->  ( C  e.  RR  /\  0  <  C ) )
26253ad2ant3 1005 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  -> 
( C  e.  RR  /\  0  <  C ) )
27 rpregt0 9552 . . . . . . 7  |-  ( B  e.  RR+  ->  ( B  e.  RR  /\  0  <  B ) )
28273ad2ant2 1004 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  -> 
( B  e.  RR  /\  0  <  B ) )
2916, 26, 283jca 1162 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  -> 
( A  e.  RR  /\  ( C  e.  RR  /\  0  <  C )  /\  ( B  e.  RR  /\  0  < 
B ) ) )
3029adantr 274 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  /\  A  <_  B )  -> 
( A  e.  RR  /\  ( C  e.  RR  /\  0  <  C )  /\  ( B  e.  RR  /\  0  < 
B ) ) )
31 lediv23 8743 . . . 4  |-  ( ( A  e.  RR  /\  ( C  e.  RR  /\  0  <  C )  /\  ( B  e.  RR  /\  0  < 
B ) )  -> 
( ( A  /  C )  <_  B  <->  ( A  /  B )  <_  C ) )
3230, 31syl 14 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  /\  A  <_  B )  -> 
( ( A  /  C )  <_  B  <->  ( A  /  B )  <_  C ) )
3315, 32mpbird 166 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  /\  A  <_  B )  -> 
( A  /  C
)  <_  B )
3433ex 114 1  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  -> 
( A  <_  B  ->  ( A  /  C
)  <_  B )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 963    e. wcel 2125   class class class wbr 3961  (class class class)co 5814   RRcr 7710   0cc0 7711   1c1 7712    < clt 7891    <_ cle 7892    / cdiv 8524   RR+crp 9538
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-13 2127  ax-14 2128  ax-ext 2136  ax-sep 4078  ax-pow 4130  ax-pr 4164  ax-un 4388  ax-setind 4490  ax-cnex 7802  ax-resscn 7803  ax-1cn 7804  ax-1re 7805  ax-icn 7806  ax-addcl 7807  ax-addrcl 7808  ax-mulcl 7809  ax-mulrcl 7810  ax-addcom 7811  ax-mulcom 7812  ax-addass 7813  ax-mulass 7814  ax-distr 7815  ax-i2m1 7816  ax-0lt1 7817  ax-1rid 7818  ax-0id 7819  ax-rnegex 7820  ax-precex 7821  ax-cnre 7822  ax-pre-ltirr 7823  ax-pre-ltwlin 7824  ax-pre-lttrn 7825  ax-pre-apti 7826  ax-pre-ltadd 7827  ax-pre-mulgt0 7828  ax-pre-mulext 7829
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ne 2325  df-nel 2420  df-ral 2437  df-rex 2438  df-reu 2439  df-rmo 2440  df-rab 2441  df-v 2711  df-sbc 2934  df-dif 3100  df-un 3102  df-in 3104  df-ss 3111  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-br 3962  df-opab 4022  df-id 4248  df-po 4251  df-iso 4252  df-xp 4585  df-rel 4586  df-cnv 4587  df-co 4588  df-dm 4589  df-iota 5128  df-fun 5165  df-fv 5171  df-riota 5770  df-ov 5817  df-oprab 5818  df-mpo 5819  df-pnf 7893  df-mnf 7894  df-xr 7895  df-ltxr 7896  df-le 7897  df-sub 8027  df-neg 8028  df-reap 8429  df-ap 8436  df-div 8525  df-rp 9539
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator