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

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

Proof of Theorem iccshftr
StepHypRef Expression
1 simpl 108 . . . . 5  |-  ( ( X  e.  RR  /\  R  e.  RR )  ->  X  e.  RR )
2 readdcl 7871 . . . . 5  |-  ( ( X  e.  RR  /\  R  e.  RR )  ->  ( X  +  R
)  e.  RR )
31, 22thd 174 . . . 4  |-  ( ( X  e.  RR  /\  R  e.  RR )  ->  ( X  e.  RR  <->  ( X  +  R )  e.  RR ) )
43adantl 275 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( X  e.  RR  <->  ( X  +  R )  e.  RR ) )
5 leadd1 8320 . . . . . 6  |-  ( ( A  e.  RR  /\  X  e.  RR  /\  R  e.  RR )  ->  ( A  <_  X  <->  ( A  +  R )  <_  ( X  +  R )
) )
653expb 1193 . . . . 5  |-  ( ( A  e.  RR  /\  ( X  e.  RR  /\  R  e.  RR ) )  ->  ( A  <_  X  <->  ( A  +  R )  <_  ( X  +  R )
) )
76adantlr 469 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( A  <_  X  <->  ( A  +  R )  <_  ( X  +  R ) ) )
8 iccshftr.1 . . . . 5  |-  ( A  +  R )  =  C
98breq1i 3984 . . . 4  |-  ( ( A  +  R )  <_  ( X  +  R )  <->  C  <_  ( X  +  R ) )
107, 9bitrdi 195 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( A  <_  X  <->  C  <_  ( X  +  R ) ) )
11 leadd1 8320 . . . . . . 7  |-  ( ( X  e.  RR  /\  B  e.  RR  /\  R  e.  RR )  ->  ( X  <_  B  <->  ( X  +  R )  <_  ( B  +  R )
) )
12113expb 1193 . . . . . 6  |-  ( ( X  e.  RR  /\  ( B  e.  RR  /\  R  e.  RR ) )  ->  ( X  <_  B  <->  ( X  +  R )  <_  ( B  +  R )
) )
1312an12s 555 . . . . 5  |-  ( ( B  e.  RR  /\  ( X  e.  RR  /\  R  e.  RR ) )  ->  ( X  <_  B  <->  ( X  +  R )  <_  ( B  +  R )
) )
1413adantll 468 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( X  <_  B  <->  ( X  +  R )  <_  ( B  +  R ) ) )
15 iccshftr.2 . . . . 5  |-  ( B  +  R )  =  D
1615breq2i 3985 . . . 4  |-  ( ( X  +  R )  <_  ( B  +  R )  <->  ( X  +  R )  <_  D
)
1714, 16bitrdi 195 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( X  <_  B  <->  ( X  +  R )  <_  D ) )
184, 10, 173anbi123d 1301 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( ( X  e.  RR  /\  A  <_  X  /\  X  <_  B
)  <->  ( ( X  +  R )  e.  RR  /\  C  <_ 
( X  +  R
)  /\  ( X  +  R )  <_  D
) ) )
19 elicc2 9866 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( X  e.  ( A [,] B )  <-> 
( X  e.  RR  /\  A  <_  X  /\  X  <_  B ) ) )
2019adantr 274 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( X  e.  ( A [,] B )  <-> 
( X  e.  RR  /\  A  <_  X  /\  X  <_  B ) ) )
21 readdcl 7871 . . . . . 6  |-  ( ( A  e.  RR  /\  R  e.  RR )  ->  ( A  +  R
)  e.  RR )
228, 21eqeltrrid 2252 . . . . 5  |-  ( ( A  e.  RR  /\  R  e.  RR )  ->  C  e.  RR )
23 readdcl 7871 . . . . . 6  |-  ( ( B  e.  RR  /\  R  e.  RR )  ->  ( B  +  R
)  e.  RR )
2415, 23eqeltrrid 2252 . . . . 5  |-  ( ( B  e.  RR  /\  R  e.  RR )  ->  D  e.  RR )
25 elicc2 9866 . . . . 5  |-  ( ( C  e.  RR  /\  D  e.  RR )  ->  ( ( X  +  R )  e.  ( C [,] D )  <-> 
( ( X  +  R )  e.  RR  /\  C  <_  ( X  +  R )  /\  ( X  +  R )  <_  D ) ) )
2622, 24, 25syl2an 287 . . . 4  |-  ( ( ( A  e.  RR  /\  R  e.  RR )  /\  ( B  e.  RR  /\  R  e.  RR ) )  -> 
( ( X  +  R )  e.  ( C [,] D )  <-> 
( ( X  +  R )  e.  RR  /\  C  <_  ( X  +  R )  /\  ( X  +  R )  <_  D ) ) )
2726anandirs 583 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  R  e.  RR )  ->  ( ( X  +  R )  e.  ( C [,] D
)  <->  ( ( X  +  R )  e.  RR  /\  C  <_ 
( X  +  R
)  /\  ( X  +  R )  <_  D
) ) )
2827adantrl 470 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( ( X  +  R )  e.  ( C [,] D )  <-> 
( ( X  +  R )  e.  RR  /\  C  <_  ( X  +  R )  /\  ( X  +  R )  <_  D ) ) )
2918, 20, 283bitr4d 219 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( X  e.  ( A [,] B )  <-> 
( X  +  R
)  e.  ( C [,] D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 967    = wceq 1342    e. wcel 2135   class class class wbr 3977  (class class class)co 5837   RRcr 7744    + caddc 7748    <_ cle 7926   [,]cicc 9819
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 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4095  ax-pow 4148  ax-pr 4182  ax-un 4406  ax-setind 4509  ax-cnex 7836  ax-resscn 7837  ax-1cn 7838  ax-icn 7840  ax-addcl 7841  ax-addrcl 7842  ax-mulcl 7843  ax-addcom 7845  ax-addass 7847  ax-i2m1 7850  ax-0id 7853  ax-rnegex 7854  ax-pre-ltirr 7857  ax-pre-ltwlin 7858  ax-pre-lttrn 7859  ax-pre-ltadd 7861
This theorem depends on definitions:  df-bi 116  df-3or 968  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-nel 2430  df-ral 2447  df-rex 2448  df-rab 2451  df-v 2724  df-sbc 2948  df-dif 3114  df-un 3116  df-in 3118  df-ss 3125  df-pw 3556  df-sn 3577  df-pr 3578  df-op 3580  df-uni 3785  df-br 3978  df-opab 4039  df-id 4266  df-po 4269  df-iso 4270  df-xp 4605  df-rel 4606  df-cnv 4607  df-co 4608  df-dm 4609  df-iota 5148  df-fun 5185  df-fv 5191  df-ov 5840  df-oprab 5841  df-mpo 5842  df-pnf 7927  df-mnf 7928  df-xr 7929  df-ltxr 7930  df-le 7931  df-icc 9823
This theorem is referenced by:  iccshftri  9923  lincmb01cmp  9931
  Copyright terms: Public domain W3C validator