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

Theorem iccshftr 9745
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 7714 . . . . 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 8160 . . . . . 6  |-  ( ( A  e.  RR  /\  X  e.  RR  /\  R  e.  RR )  ->  ( A  <_  X  <->  ( A  +  R )  <_  ( X  +  R )
) )
653expb 1167 . . . . 5  |-  ( ( A  e.  RR  /\  ( X  e.  RR  /\  R  e.  RR ) )  ->  ( A  <_  X  <->  ( A  +  R )  <_  ( X  +  R )
) )
76adantlr 468 . . . 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 3906 . . . 4  |-  ( ( A  +  R )  <_  ( X  +  R )  <->  C  <_  ( X  +  R ) )
107, 9syl6bb 195 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( A  <_  X  <->  C  <_  ( X  +  R ) ) )
11 leadd1 8160 . . . . . . 7  |-  ( ( X  e.  RR  /\  B  e.  RR  /\  R  e.  RR )  ->  ( X  <_  B  <->  ( X  +  R )  <_  ( B  +  R )
) )
12113expb 1167 . . . . . 6  |-  ( ( X  e.  RR  /\  ( B  e.  RR  /\  R  e.  RR ) )  ->  ( X  <_  B  <->  ( X  +  R )  <_  ( B  +  R )
) )
1312an12s 539 . . . . 5  |-  ( ( B  e.  RR  /\  ( X  e.  RR  /\  R  e.  RR ) )  ->  ( X  <_  B  <->  ( X  +  R )  <_  ( B  +  R )
) )
1413adantll 467 . . . 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 3907 . . . 4  |-  ( ( X  +  R )  <_  ( B  +  R )  <->  ( X  +  R )  <_  D
)
1714, 16syl6bb 195 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( X  e.  RR  /\  R  e.  RR ) )  -> 
( X  <_  B  <->  ( X  +  R )  <_  D ) )
184, 10, 173anbi123d 1275 . 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 9689 . . 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 7714 . . . . . 6  |-  ( ( A  e.  RR  /\  R  e.  RR )  ->  ( A  +  R
)  e.  RR )
228, 21eqeltrrid 2205 . . . . 5  |-  ( ( A  e.  RR  /\  R  e.  RR )  ->  C  e.  RR )
23 readdcl 7714 . . . . . 6  |-  ( ( B  e.  RR  /\  R  e.  RR )  ->  ( B  +  R
)  e.  RR )
2415, 23eqeltrrid 2205 . . . . 5  |-  ( ( B  e.  RR  /\  R  e.  RR )  ->  D  e.  RR )
25 elicc2 9689 . . . . 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 567 . . 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 469 . 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 947    = wceq 1316    e. wcel 1465   class class class wbr 3899  (class class class)co 5742   RRcr 7587    + caddc 7591    <_ cle 7769   [,]cicc 9642
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 588  ax-in2 589  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-13 1476  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101  ax-un 4325  ax-setind 4422  ax-cnex 7679  ax-resscn 7680  ax-1cn 7681  ax-icn 7683  ax-addcl 7684  ax-addrcl 7685  ax-mulcl 7686  ax-addcom 7688  ax-addass 7690  ax-i2m1 7693  ax-0id 7696  ax-rnegex 7697  ax-pre-ltirr 7700  ax-pre-ltwlin 7701  ax-pre-lttrn 7702  ax-pre-ltadd 7704
This theorem depends on definitions:  df-bi 116  df-3or 948  df-3an 949  df-tru 1319  df-fal 1322  df-nf 1422  df-sb 1721  df-eu 1980  df-mo 1981  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ne 2286  df-nel 2381  df-ral 2398  df-rex 2399  df-rab 2402  df-v 2662  df-sbc 2883  df-dif 3043  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-uni 3707  df-br 3900  df-opab 3960  df-id 4185  df-po 4188  df-iso 4189  df-xp 4515  df-rel 4516  df-cnv 4517  df-co 4518  df-dm 4519  df-iota 5058  df-fun 5095  df-fv 5101  df-ov 5745  df-oprab 5746  df-mpo 5747  df-pnf 7770  df-mnf 7771  df-xr 7772  df-ltxr 7773  df-le 7774  df-icc 9646
This theorem is referenced by:  iccshftri  9746  lincmb01cmp  9754
  Copyright terms: Public domain W3C validator