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

Theorem shftlem 11501
Description: Two ways to write a shifted set  ( B  +  A ). (Contributed by Mario Carneiro, 3-Nov-2013.)
Assertion
Ref Expression
shftlem  |-  ( ( A  e.  CC  /\  B  C_  CC )  ->  { x  e.  CC  |  ( x  -  A )  e.  B }  =  { x  |  E. y  e.  B  x  =  ( y  +  A ) } )
Distinct variable groups:    x, y, A   
x, B, y

Proof of Theorem shftlem
StepHypRef Expression
1 df-rab 2529 . 2  |-  { x  e.  CC  |  ( x  -  A )  e.  B }  =  {
x  |  ( x  e.  CC  /\  (
x  -  A )  e.  B ) }
2 npcan 8482 . . . . . . . . 9  |-  ( ( x  e.  CC  /\  A  e.  CC )  ->  ( ( x  -  A )  +  A
)  =  x )
32ancoms 268 . . . . . . . 8  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  ( ( x  -  A )  +  A
)  =  x )
43eqcomd 2238 . . . . . . 7  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  x  =  ( ( x  -  A )  +  A ) )
5 oveq1 6057 . . . . . . . . . 10  |-  ( y  =  ( x  -  A )  ->  (
y  +  A )  =  ( ( x  -  A )  +  A ) )
65eqeq2d 2244 . . . . . . . . 9  |-  ( y  =  ( x  -  A )  ->  (
x  =  ( y  +  A )  <->  x  =  ( ( x  -  A )  +  A
) ) )
76rspcev 2921 . . . . . . . 8  |-  ( ( ( x  -  A
)  e.  B  /\  x  =  ( (
x  -  A )  +  A ) )  ->  E. y  e.  B  x  =  ( y  +  A ) )
87expcom 116 . . . . . . 7  |-  ( x  =  ( ( x  -  A )  +  A )  ->  (
( x  -  A
)  e.  B  ->  E. y  e.  B  x  =  ( y  +  A ) ) )
94, 8syl 14 . . . . . 6  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  ( ( x  -  A )  e.  B  ->  E. y  e.  B  x  =  ( y  +  A ) ) )
109expimpd 363 . . . . 5  |-  ( A  e.  CC  ->  (
( x  e.  CC  /\  ( x  -  A
)  e.  B )  ->  E. y  e.  B  x  =  ( y  +  A ) ) )
1110adantr 276 . . . 4  |-  ( ( A  e.  CC  /\  B  C_  CC )  -> 
( ( x  e.  CC  /\  ( x  -  A )  e.  B )  ->  E. y  e.  B  x  =  ( y  +  A
) ) )
12 ssel2 3233 . . . . . . . . . 10  |-  ( ( B  C_  CC  /\  y  e.  B )  ->  y  e.  CC )
13 addcl 8252 . . . . . . . . . 10  |-  ( ( y  e.  CC  /\  A  e.  CC )  ->  ( y  +  A
)  e.  CC )
1412, 13sylan 283 . . . . . . . . 9  |-  ( ( ( B  C_  CC  /\  y  e.  B )  /\  A  e.  CC )  ->  ( y  +  A )  e.  CC )
15 pncan 8479 . . . . . . . . . . 11  |-  ( ( y  e.  CC  /\  A  e.  CC )  ->  ( ( y  +  A )  -  A
)  =  y )
1612, 15sylan 283 . . . . . . . . . 10  |-  ( ( ( B  C_  CC  /\  y  e.  B )  /\  A  e.  CC )  ->  ( ( y  +  A )  -  A )  =  y )
17 simplr 529 . . . . . . . . . 10  |-  ( ( ( B  C_  CC  /\  y  e.  B )  /\  A  e.  CC )  ->  y  e.  B
)
1816, 17eqeltrd 2309 . . . . . . . . 9  |-  ( ( ( B  C_  CC  /\  y  e.  B )  /\  A  e.  CC )  ->  ( ( y  +  A )  -  A )  e.  B
)
1914, 18jca 306 . . . . . . . 8  |-  ( ( ( B  C_  CC  /\  y  e.  B )  /\  A  e.  CC )  ->  ( ( y  +  A )  e.  CC  /\  ( ( y  +  A )  -  A )  e.  B ) )
2019ancoms 268 . . . . . . 7  |-  ( ( A  e.  CC  /\  ( B  C_  CC  /\  y  e.  B )
)  ->  ( (
y  +  A )  e.  CC  /\  (
( y  +  A
)  -  A )  e.  B ) )
2120anassrs 400 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  C_  CC )  /\  y  e.  B
)  ->  ( (
y  +  A )  e.  CC  /\  (
( y  +  A
)  -  A )  e.  B ) )
22 eleq1 2295 . . . . . . 7  |-  ( x  =  ( y  +  A )  ->  (
x  e.  CC  <->  ( y  +  A )  e.  CC ) )
23 oveq1 6057 . . . . . . . 8  |-  ( x  =  ( y  +  A )  ->  (
x  -  A )  =  ( ( y  +  A )  -  A ) )
2423eleq1d 2301 . . . . . . 7  |-  ( x  =  ( y  +  A )  ->  (
( x  -  A
)  e.  B  <->  ( (
y  +  A )  -  A )  e.  B ) )
2522, 24anbi12d 473 . . . . . 6  |-  ( x  =  ( y  +  A )  ->  (
( x  e.  CC  /\  ( x  -  A
)  e.  B )  <-> 
( ( y  +  A )  e.  CC  /\  ( ( y  +  A )  -  A
)  e.  B ) ) )
2621, 25syl5ibrcom 157 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  C_  CC )  /\  y  e.  B
)  ->  ( x  =  ( y  +  A )  ->  (
x  e.  CC  /\  ( x  -  A
)  e.  B ) ) )
2726rexlimdva 2660 . . . 4  |-  ( ( A  e.  CC  /\  B  C_  CC )  -> 
( E. y  e.  B  x  =  ( y  +  A )  ->  ( x  e.  CC  /\  ( x  -  A )  e.  B ) ) )
2811, 27impbid 129 . . 3  |-  ( ( A  e.  CC  /\  B  C_  CC )  -> 
( ( x  e.  CC  /\  ( x  -  A )  e.  B )  <->  E. y  e.  B  x  =  ( y  +  A
) ) )
2928abbidv 2352 . 2  |-  ( ( A  e.  CC  /\  B  C_  CC )  ->  { x  |  (
x  e.  CC  /\  ( x  -  A
)  e.  B ) }  =  { x  |  E. y  e.  B  x  =  ( y  +  A ) } )
301, 29eqtrid 2277 1  |-  ( ( A  e.  CC  /\  B  C_  CC )  ->  { x  e.  CC  |  ( x  -  A )  e.  B }  =  { x  |  E. y  e.  B  x  =  ( y  +  A ) } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2203   {cab 2218   E.wrex 2521   {crab 2524    C_ wss 3211  (class class class)co 6050   CCcc 8125    + caddc 8130    - cmin 8444
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-setind 4659  ax-resscn 8219  ax-1cn 8220  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-sub 8446
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator