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

Theorem icoshft 10147
Description: A shifted real is a member of a shifted, closed-below, open-above real interval. (Contributed by Paul Chapman, 25-Mar-2008.)
Assertion
Ref Expression
icoshft  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  ( A [,) B )  ->  ( X  +  C )  e.  ( ( A  +  C ) [,) ( B  +  C )
) ) )

Proof of Theorem icoshft
StepHypRef Expression
1 rexr 8153 . . . . . 6  |-  ( B  e.  RR  ->  B  e.  RR* )
2 elico2 10094 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR* )  -> 
( X  e.  ( A [,) B )  <-> 
( X  e.  RR  /\  A  <_  X  /\  X  <  B ) ) )
31, 2sylan2 286 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( X  e.  ( A [,) B )  <-> 
( X  e.  RR  /\  A  <_  X  /\  X  <  B ) ) )
43biimpd 144 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( X  e.  ( A [,) B )  ->  ( X  e.  RR  /\  A  <_  X  /\  X  <  B
) ) )
543adant3 1020 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  ( A [,) B )  ->  ( X  e.  RR  /\  A  <_  X  /\  X  < 
B ) ) )
6 3anass 985 . . 3  |-  ( ( X  e.  RR  /\  A  <_  X  /\  X  <  B )  <->  ( X  e.  RR  /\  ( A  <_  X  /\  X  <  B ) ) )
75, 6imbitrdi 161 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  ( A [,) B )  ->  ( X  e.  RR  /\  ( A  <_  X  /\  X  <  B ) ) ) )
8 leadd1 8538 . . . . . . . . . 10  |-  ( ( A  e.  RR  /\  X  e.  RR  /\  C  e.  RR )  ->  ( A  <_  X  <->  ( A  +  C )  <_  ( X  +  C )
) )
983com12 1210 . . . . . . . . 9  |-  ( ( X  e.  RR  /\  A  e.  RR  /\  C  e.  RR )  ->  ( A  <_  X  <->  ( A  +  C )  <_  ( X  +  C )
) )
1093expib 1209 . . . . . . . 8  |-  ( X  e.  RR  ->  (
( A  e.  RR  /\  C  e.  RR )  ->  ( A  <_  X 
<->  ( A  +  C
)  <_  ( X  +  C ) ) ) )
1110com12 30 . . . . . . 7  |-  ( ( A  e.  RR  /\  C  e.  RR )  ->  ( X  e.  RR  ->  ( A  <_  X  <->  ( A  +  C )  <_  ( X  +  C ) ) ) )
12113adant2 1019 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  RR  ->  ( A  <_  X  <->  ( A  +  C )  <_  ( X  +  C )
) ) )
1312imp 124 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  X  e.  RR )  ->  ( A  <_  X 
<->  ( A  +  C
)  <_  ( X  +  C ) ) )
14 ltadd1 8537 . . . . . . . . 9  |-  ( ( X  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  <  B  <->  ( X  +  C )  <  ( B  +  C )
) )
15143expib 1209 . . . . . . . 8  |-  ( X  e.  RR  ->  (
( B  e.  RR  /\  C  e.  RR )  ->  ( X  < 
B  <->  ( X  +  C )  <  ( B  +  C )
) ) )
1615com12 30 . . . . . . 7  |-  ( ( B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  RR  ->  ( X  <  B  <->  ( X  +  C )  <  ( B  +  C ) ) ) )
17163adant1 1018 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  RR  ->  ( X  <  B  <->  ( X  +  C )  <  ( B  +  C )
) ) )
1817imp 124 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  X  e.  RR )  ->  ( X  < 
B  <->  ( X  +  C )  <  ( B  +  C )
) )
1913, 18anbi12d 473 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  /\  X  e.  RR )  ->  ( ( A  <_  X  /\  X  <  B )  <->  ( ( A  +  C )  <_  ( X  +  C
)  /\  ( X  +  C )  <  ( B  +  C )
) ) )
2019pm5.32da 452 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( X  e.  RR  /\  ( A  <_  X  /\  X  <  B ) )  <->  ( X  e.  RR  /\  ( ( A  +  C )  <_  ( X  +  C )  /\  ( X  +  C )  <  ( B  +  C
) ) ) ) )
21 readdcl 8086 . . . . . . . 8  |-  ( ( X  e.  RR  /\  C  e.  RR )  ->  ( X  +  C
)  e.  RR )
2221expcom 116 . . . . . . 7  |-  ( C  e.  RR  ->  ( X  e.  RR  ->  ( X  +  C )  e.  RR ) )
2322anim1d 336 . . . . . 6  |-  ( C  e.  RR  ->  (
( X  e.  RR  /\  ( ( A  +  C )  <_  ( X  +  C )  /\  ( X  +  C
)  <  ( B  +  C ) ) )  ->  ( ( X  +  C )  e.  RR  /\  ( ( A  +  C )  <_  ( X  +  C )  /\  ( X  +  C )  <  ( B  +  C
) ) ) ) )
24 3anass 985 . . . . . 6  |-  ( ( ( X  +  C
)  e.  RR  /\  ( A  +  C
)  <_  ( X  +  C )  /\  ( X  +  C )  <  ( B  +  C
) )  <->  ( ( X  +  C )  e.  RR  /\  ( ( A  +  C )  <_  ( X  +  C )  /\  ( X  +  C )  <  ( B  +  C
) ) ) )
2523, 24imbitrrdi 162 . . . . 5  |-  ( C  e.  RR  ->  (
( X  e.  RR  /\  ( ( A  +  C )  <_  ( X  +  C )  /\  ( X  +  C
)  <  ( B  +  C ) ) )  ->  ( ( X  +  C )  e.  RR  /\  ( A  +  C )  <_ 
( X  +  C
)  /\  ( X  +  C )  <  ( B  +  C )
) ) )
26253ad2ant3 1023 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( X  e.  RR  /\  ( ( A  +  C )  <_  ( X  +  C )  /\  ( X  +  C
)  <  ( B  +  C ) ) )  ->  ( ( X  +  C )  e.  RR  /\  ( A  +  C )  <_ 
( X  +  C
)  /\  ( X  +  C )  <  ( B  +  C )
) ) )
27 readdcl 8086 . . . . . 6  |-  ( ( A  e.  RR  /\  C  e.  RR )  ->  ( A  +  C
)  e.  RR )
28273adant2 1019 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( A  +  C )  e.  RR )
29 readdcl 8086 . . . . . 6  |-  ( ( B  e.  RR  /\  C  e.  RR )  ->  ( B  +  C
)  e.  RR )
30293adant1 1018 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( B  +  C )  e.  RR )
31 rexr 8153 . . . . . . 7  |-  ( ( B  +  C )  e.  RR  ->  ( B  +  C )  e.  RR* )
32 elico2 10094 . . . . . . 7  |-  ( ( ( A  +  C
)  e.  RR  /\  ( B  +  C
)  e.  RR* )  ->  ( ( X  +  C )  e.  ( ( A  +  C
) [,) ( B  +  C ) )  <-> 
( ( X  +  C )  e.  RR  /\  ( A  +  C
)  <_  ( X  +  C )  /\  ( X  +  C )  <  ( B  +  C
) ) ) )
3331, 32sylan2 286 . . . . . 6  |-  ( ( ( A  +  C
)  e.  RR  /\  ( B  +  C
)  e.  RR )  ->  ( ( X  +  C )  e.  ( ( A  +  C ) [,) ( B  +  C )
)  <->  ( ( X  +  C )  e.  RR  /\  ( A  +  C )  <_ 
( X  +  C
)  /\  ( X  +  C )  <  ( B  +  C )
) ) )
3433biimprd 158 . . . . 5  |-  ( ( ( A  +  C
)  e.  RR  /\  ( B  +  C
)  e.  RR )  ->  ( ( ( X  +  C )  e.  RR  /\  ( A  +  C )  <_  ( X  +  C
)  /\  ( X  +  C )  <  ( B  +  C )
)  ->  ( X  +  C )  e.  ( ( A  +  C
) [,) ( B  +  C ) ) ) )
3528, 30, 34syl2anc 411 . . . 4  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( ( X  +  C )  e.  RR  /\  ( A  +  C
)  <_  ( X  +  C )  /\  ( X  +  C )  <  ( B  +  C
) )  ->  ( X  +  C )  e.  ( ( A  +  C ) [,) ( B  +  C )
) ) )
3626, 35syld 45 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( X  e.  RR  /\  ( ( A  +  C )  <_  ( X  +  C )  /\  ( X  +  C
)  <  ( B  +  C ) ) )  ->  ( X  +  C )  e.  ( ( A  +  C
) [,) ( B  +  C ) ) ) )
3720, 36sylbid 150 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  (
( X  e.  RR  /\  ( A  <_  X  /\  X  <  B ) )  ->  ( X  +  C )  e.  ( ( A  +  C
) [,) ( B  +  C ) ) ) )
387, 37syld 45 1  |-  ( ( A  e.  RR  /\  B  e.  RR  /\  C  e.  RR )  ->  ( X  e.  ( A [,) B )  ->  ( X  +  C )  e.  ( ( A  +  C ) [,) ( B  +  C )
) ) )
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    + caddc 7963   RR*cxr 8141    < clt 8142    <_ cle 8143   [,)cico 10047
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-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-i2m1 8065  ax-0id 8068  ax-rnegex 8069  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-ltadd 8076
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-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-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-ico 10051
This theorem is referenced by:  icoshftf1o  10148
  Copyright terms: Public domain W3C validator