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

Theorem iccdil 10417
Description: Membership in a dilated interval. (Contributed by Jeff Madsen, 2-Sep-2009.)
Hypotheses
Ref Expression
iccdil.1  |-  ( A  x.  R )  =  C
iccdil.2  |-  ( B  x.  R )  =  D
Assertion
Ref Expression
iccdil  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  e.  ( A [,] B )  <->  ( X  x.  R )  e.  ( C [,] D ) ) )

Proof of Theorem iccdil
StepHypRef Expression
1 simpl 109 . . . . 5  |-  ( ( X  e.  RR  /\  R  e.  RR+ )  ->  X  e.  RR )
2 rpre 10078 . . . . . 6  |-  ( R  e.  RR+  ->  R  e.  RR )
3 remulcl 8313 . . . . . 6  |-  ( ( X  e.  RR  /\  R  e.  RR )  ->  ( X  x.  R
)  e.  RR )
42, 3sylan2 286 . . . . 5  |-  ( ( X  e.  RR  /\  R  e.  RR+ )  -> 
( X  x.  R
)  e.  RR )
51, 42thd 175 . . . 4  |-  ( ( X  e.  RR  /\  R  e.  RR+ )  -> 
( X  e.  RR  <->  ( X  x.  R )  e.  RR ) )
65adantl 277 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  e.  RR  <->  ( X  x.  R )  e.  RR ) )
7 elrp 10073 . . . . . . 7  |-  ( R  e.  RR+  <->  ( R  e.  RR  /\  0  < 
R ) )
8 lemul1 8929 . . . . . . 7  |-  ( ( A  e.  RR  /\  X  e.  RR  /\  ( R  e.  RR  /\  0  <  R ) )  -> 
( A  <_  X  <->  ( A  x.  R )  <_  ( X  x.  R ) ) )
97, 8syl3an3b 1316 . . . . . 6  |-  ( ( A  e.  RR  /\  X  e.  RR  /\  R  e.  RR+ )  ->  ( A  <_  X  <->  ( A  x.  R )  <_  ( X  x.  R )
) )
1093expb 1235 . . . . 5  |-  ( ( A  e.  RR  /\  ( X  e.  RR  /\  R  e.  RR+ )
)  ->  ( A  <_  X  <->  ( A  x.  R )  <_  ( X  x.  R )
) )
1110adantlr 481 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( A  <_  X  <->  ( A  x.  R )  <_  ( X  x.  R )
) )
12 iccdil.1 . . . . 5  |-  ( A  x.  R )  =  C
1312breq1i 4138 . . . 4  |-  ( ( A  x.  R )  <_  ( X  x.  R )  <->  C  <_  ( X  x.  R ) )
1411, 13bitrdi 196 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( A  <_  X  <->  C  <_  ( X  x.  R ) ) )
15 lemul1 8929 . . . . . . . 8  |-  ( ( X  e.  RR  /\  B  e.  RR  /\  ( R  e.  RR  /\  0  <  R ) )  -> 
( X  <_  B  <->  ( X  x.  R )  <_  ( B  x.  R ) ) )
167, 15syl3an3b 1316 . . . . . . 7  |-  ( ( X  e.  RR  /\  B  e.  RR  /\  R  e.  RR+ )  ->  ( X  <_  B  <->  ( X  x.  R )  <_  ( B  x.  R )
) )
17163expb 1235 . . . . . 6  |-  ( ( X  e.  RR  /\  ( B  e.  RR  /\  R  e.  RR+ )
)  ->  ( X  <_  B  <->  ( X  x.  R )  <_  ( B  x.  R )
) )
1817an12s 571 . . . . 5  |-  ( ( B  e.  RR  /\  ( X  e.  RR  /\  R  e.  RR+ )
)  ->  ( X  <_  B  <->  ( X  x.  R )  <_  ( B  x.  R )
) )
1918adantll 480 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  <_  B  <->  ( X  x.  R )  <_  ( B  x.  R )
) )
20 iccdil.2 . . . . 5  |-  ( B  x.  R )  =  D
2120breq2i 4139 . . . 4  |-  ( ( X  x.  R )  <_  ( B  x.  R )  <->  ( X  x.  R )  <_  D
)
2219, 21bitrdi 196 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  <_  B  <->  ( X  x.  R )  <_  D
) )
236, 14, 223anbi123d 1353 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  (
( X  e.  RR  /\  A  <_  X  /\  X  <_  B )  <->  ( ( X  x.  R )  e.  RR  /\  C  <_ 
( X  x.  R
)  /\  ( X  x.  R )  <_  D
) ) )
24 elicc2 10357 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( X  e.  ( A [,] B )  <-> 
( X  e.  RR  /\  A  <_  X  /\  X  <_  B ) ) )
2524adantr 276 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  e.  ( A [,] B )  <->  ( X  e.  RR  /\  A  <_  X  /\  X  <_  B
) ) )
26 remulcl 8313 . . . . . . 7  |-  ( ( A  e.  RR  /\  R  e.  RR )  ->  ( A  x.  R
)  e.  RR )
2712, 26eqeltrrid 2326 . . . . . 6  |-  ( ( A  e.  RR  /\  R  e.  RR )  ->  C  e.  RR )
28 remulcl 8313 . . . . . . 7  |-  ( ( B  e.  RR  /\  R  e.  RR )  ->  ( B  x.  R
)  e.  RR )
2920, 28eqeltrrid 2326 . . . . . 6  |-  ( ( B  e.  RR  /\  R  e.  RR )  ->  D  e.  RR )
30 elicc2 10357 . . . . . 6  |-  ( ( C  e.  RR  /\  D  e.  RR )  ->  ( ( X  x.  R )  e.  ( C [,] D )  <-> 
( ( X  x.  R )  e.  RR  /\  C  <_  ( X  x.  R )  /\  ( X  x.  R )  <_  D ) ) )
3127, 29, 30syl2an 289 . . . . 5  |-  ( ( ( A  e.  RR  /\  R  e.  RR )  /\  ( B  e.  RR  /\  R  e.  RR ) )  -> 
( ( X  x.  R )  e.  ( C [,] D )  <-> 
( ( X  x.  R )  e.  RR  /\  C  <_  ( X  x.  R )  /\  ( X  x.  R )  <_  D ) ) )
3231anandirs 601 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  R  e.  RR )  ->  ( ( X  x.  R )  e.  ( C [,] D
)  <->  ( ( X  x.  R )  e.  RR  /\  C  <_ 
( X  x.  R
)  /\  ( X  x.  R )  <_  D
) ) )
332, 32sylan2 286 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  R  e.  RR+ )  ->  ( ( X  x.  R )  e.  ( C [,] D
)  <->  ( ( X  x.  R )  e.  RR  /\  C  <_ 
( X  x.  R
)  /\  ( X  x.  R )  <_  D
) ) )
3433adantrl 482 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  (
( X  x.  R
)  e.  ( C [,] D )  <->  ( ( X  x.  R )  e.  RR  /\  C  <_ 
( X  x.  R
)  /\  ( X  x.  R )  <_  D
) ) )
3523, 25, 343bitr4d 220 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR+ ) )  ->  ( X  e.  ( A [,] B )  <->  ( X  x.  R )  e.  ( C [,] D ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   class class class wbr 4131  (class class class)co 6088   RRcr 8184   0cc0 8185    x. cmul 8190    < clt 8366    <_ cle 8367   RR+crp 10071   [,]cicc 10310
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-ltadd 8301  ax-pre-mulgt0 8302
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-id 4440  df-po 4443  df-iso 4444  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-rp 10072  df-icc 10314
This theorem is used by:  iccdili  10418  lincmb01cmp  10422  iccf1o  10424
  Copyright terms: Public domain W3C validator