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

Theorem ledivge1le 9883
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 9882 . . . . . . . . 9  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( A  /  B )  <_  1  <->  A  <_  B ) )
21adantr 276 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( ( A  /  B )  <_  1  <->  A  <_  B ) )
3 rerpdivcl 9841 . . . . . . . . . . 11  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( A  /  B
)  e.  RR )
43adantr 276 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( A  /  B
)  e.  RR )
5 1red 8122 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  1  e.  RR )
6 rpre 9817 . . . . . . . . . . 11  |-  ( C  e.  RR+  ->  C  e.  RR )
76adantl 277 . . . . . . . . . 10  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  C  e.  RR )
8 letr 8190 . . . . . . . . . 10  |-  ( ( ( A  /  B
)  e.  RR  /\  1  e.  RR  /\  C  e.  RR )  ->  (
( ( A  /  B )  <_  1  /\  1  <_  C )  ->  ( A  /  B )  <_  C
) )
94, 5, 7, 8syl3anc 1250 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( ( ( A  /  B )  <_ 
1  /\  1  <_  C )  ->  ( A  /  B )  <_  C
) )
109expd 258 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR+ )  /\  C  e.  RR+ )  ->  ( ( A  /  B )  <_  1  ->  ( 1  <_  C  ->  ( A  /  B
)  <_  C )
) )
112, 10sylbird 170 . . . . . . 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 363 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR+ )  -> 
( ( C  e.  RR+  /\  1  <_  C
)  ->  ( A  <_  B  ->  ( A  /  B )  <_  C
) ) )
1413ex 115 . . . 4  |-  ( A  e.  RR  ->  ( B  e.  RR+  ->  (
( C  e.  RR+  /\  1  <_  C )  ->  ( A  <_  B  ->  ( A  /  B
)  <_  C )
) ) )
15143imp1 1223 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  /\  A  <_  B )  -> 
( A  /  B
)  <_  C )
16 simp1 1000 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  ->  A  e.  RR )
176adantr 276 . . . . . . . 8  |-  ( ( C  e.  RR+  /\  1  <_  C )  ->  C  e.  RR )
18 0lt1 8234 . . . . . . . . . 10  |-  0  <  1
19 0red 8108 . . . . . . . . . . 11  |-  ( C  e.  RR+  ->  0  e.  RR )
20 1red 8122 . . . . . . . . . . 11  |-  ( C  e.  RR+  ->  1  e.  RR )
21 ltletr 8197 . . . . . . . . . . 11  |-  ( ( 0  e.  RR  /\  1  e.  RR  /\  C  e.  RR )  ->  (
( 0  <  1  /\  1  <_  C )  ->  0  <  C
) )
2219, 20, 6, 21syl3anc 1250 . . . . . . . . . 10  |-  ( C  e.  RR+  ->  ( ( 0  <  1  /\  1  <_  C )  ->  0  <  C ) )
2318, 22mpani 430 . . . . . . . . 9  |-  ( C  e.  RR+  ->  ( 1  <_  C  ->  0  <  C ) )
2423imp 124 . . . . . . . 8  |-  ( ( C  e.  RR+  /\  1  <_  C )  ->  0  <  C )
2517, 24jca 306 . . . . . . 7  |-  ( ( C  e.  RR+  /\  1  <_  C )  ->  ( C  e.  RR  /\  0  <  C ) )
26253ad2ant3 1023 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  -> 
( C  e.  RR  /\  0  <  C ) )
27 rpregt0 9824 . . . . . . 7  |-  ( B  e.  RR+  ->  ( B  e.  RR  /\  0  <  B ) )
28273ad2ant2 1022 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  -> 
( B  e.  RR  /\  0  <  B ) )
2916, 26, 283jca 1180 . . . . 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 276 . . . 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 9001 . . . 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 167 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR+  /\  ( C  e.  RR+  /\  1  <_  C ) )  /\  A  <_  B )  -> 
( A  /  C
)  <_  B )
3433ex 115 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 104    <-> wb 105    /\ w3a 981    e. wcel 2178   class class class wbr 4059  (class class class)co 5967   RRcr 7959   0cc0 7960   1c1 7961    < clt 8142    <_ cle 8143    / cdiv 8780   RR+crp 9810
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-po 4361  df-iso 4362  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-iota 5251  df-fun 5292  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690  df-div 8781  df-rp 9811
This theorem is referenced by:  gausslemma2dlem1a  15650
  Copyright terms: Public domain W3C validator