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

Theorem divelunit 10159
Description: A condition for a ratio to be a member of the closed unit. (Contributed by Scott Fenton, 11-Jun-2013.)
Assertion
Ref Expression
divelunit  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( ( A  /  B )  e.  ( 0 [,] 1
)  <->  A  <_  B ) )

Proof of Theorem divelunit
StepHypRef Expression
1 0re 8107 . . . 4  |-  0  e.  RR
2 1re 8106 . . . 4  |-  1  e.  RR
31, 2elicc2i 10096 . . 3  |-  ( ( A  /  B )  e.  ( 0 [,] 1 )  <->  ( ( A  /  B )  e.  RR  /\  0  <_ 
( A  /  B
)  /\  ( A  /  B )  <_  1
) )
4 df-3an 983 . . 3  |-  ( ( ( A  /  B
)  e.  RR  /\  0  <_  ( A  /  B )  /\  ( A  /  B )  <_ 
1 )  <->  ( (
( A  /  B
)  e.  RR  /\  0  <_  ( A  /  B ) )  /\  ( A  /  B
)  <_  1 ) )
53, 4bitri 184 . 2  |-  ( ( A  /  B )  e.  ( 0 [,] 1 )  <->  ( (
( A  /  B
)  e.  RR  /\  0  <_  ( A  /  B ) )  /\  ( A  /  B
)  <_  1 ) )
6 ledivmul 8985 . . . . 5  |-  ( ( A  e.  RR  /\  1  e.  RR  /\  ( B  e.  RR  /\  0  <  B ) )  -> 
( ( A  /  B )  <_  1  <->  A  <_  ( B  x.  1 ) ) )
72, 6mp3an2 1338 . . . 4  |-  ( ( A  e.  RR  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( ( A  /  B )  <_ 
1  <->  A  <_  ( B  x.  1 ) ) )
87adantlr 477 . . 3  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( ( A  /  B )  <_ 
1  <->  A  <_  ( B  x.  1 ) ) )
9 simpll 527 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  A  e.  RR )
10 simprl 529 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  B  e.  RR )
11 gt0ap0 8734 . . . . . . 7  |-  ( ( B  e.  RR  /\  0  <  B )  ->  B #  0 )
1211adantl 277 . . . . . 6  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  B #  0
)
139, 10, 12redivclapd 8943 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( A  /  B )  e.  RR )
14 divge0 8981 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  0  <_  ( A  /  B ) )
1513, 14jca 306 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( ( A  /  B )  e.  RR  /\  0  <_ 
( A  /  B
) ) )
1615biantrurd 305 . . 3  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( ( A  /  B )  <_ 
1  <->  ( ( ( A  /  B )  e.  RR  /\  0  <_  ( A  /  B
) )  /\  ( A  /  B )  <_ 
1 ) ) )
17 recn 8093 . . . . . 6  |-  ( B  e.  RR  ->  B  e.  CC )
1817ad2antrl 490 . . . . 5  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  B  e.  CC )
1918mulridd 8124 . . . 4  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( B  x.  1 )  =  B )
2019breq2d 4071 . . 3  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( A  <_  ( B  x.  1 )  <->  A  <_  B ) )
218, 16, 203bitr3d 218 . 2  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( (
( ( A  /  B )  e.  RR  /\  0  <_  ( A  /  B ) )  /\  ( A  /  B
)  <_  1 )  <-> 
A  <_  B )
)
225, 21bitrid 192 1  |-  ( ( ( A  e.  RR  /\  0  <_  A )  /\  ( B  e.  RR  /\  0  <  B ) )  ->  ( ( A  /  B )  e.  ( 0 [,] 1
)  <->  A  <_  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   CCcc 7958   RRcr 7959   0cc0 7960   1c1 7961    x. cmul 7965    < clt 8142    <_ cle 8143   # cap 8689    / cdiv 8780   [,]cicc 10048
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-3or 982  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-icc 10052
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator