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

Theorem shftf 11617
Description: Functionality of a shifted sequence. (Contributed by NM, 19-Aug-2005.) (Revised by Mario Carneiro, 5-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1  |-  F  e. 
_V
Assertion
Ref Expression
shftf  |-  ( ( F : B --> C  /\  A  e.  CC )  ->  ( F  shift  A ) : { x  e.  CC  |  ( x  -  A )  e.  B } --> C )
Distinct variable groups:    x, A    x, F    x, B
Allowed substitution hint:    C( x)

Proof of Theorem shftf
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ffn 5536 . . 3  |-  ( F : B --> C  ->  F  Fn  B )
2 shftfval.1 . . . 4  |-  F  e. 
_V
32shftfn 11611 . . 3  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  ( F  shift  A )  Fn  { x  e.  CC  |  ( x  -  A )  e.  B } )
41, 3sylan 283 . 2  |-  ( ( F : B --> C  /\  A  e.  CC )  ->  ( F  shift  A )  Fn  { x  e.  CC  |  ( x  -  A )  e.  B } )
5 oveq1 6095 . . . . . 6  |-  ( x  =  y  ->  (
x  -  A )  =  ( y  -  A ) )
65eleq1d 2307 . . . . 5  |-  ( x  =  y  ->  (
( x  -  A
)  e.  B  <->  ( y  -  A )  e.  B
) )
76elrab 2982 . . . 4  |-  ( y  e.  { x  e.  CC  |  ( x  -  A )  e.  B }  <->  ( y  e.  CC  /\  ( y  -  A )  e.  B ) )
8 simpr 110 . . . . . 6  |-  ( ( F : B --> C  /\  A  e.  CC )  ->  A  e.  CC )
9 simpl 109 . . . . . 6  |-  ( ( y  e.  CC  /\  ( y  -  A
)  e.  B )  ->  y  e.  CC )
102shftval 11612 . . . . . 6  |-  ( ( A  e.  CC  /\  y  e.  CC )  ->  ( ( F  shift  A ) `  y )  =  ( F `  ( y  -  A
) ) )
118, 9, 10syl2an 289 . . . . 5  |-  ( ( ( F : B --> C  /\  A  e.  CC )  /\  ( y  e.  CC  /\  ( y  -  A )  e.  B ) )  -> 
( ( F  shift  A ) `  y )  =  ( F `  ( y  -  A
) ) )
12 simpl 109 . . . . . 6  |-  ( ( F : B --> C  /\  A  e.  CC )  ->  F : B --> C )
13 simpr 110 . . . . . 6  |-  ( ( y  e.  CC  /\  ( y  -  A
)  e.  B )  ->  ( y  -  A )  e.  B
)
14 ffvelcdm 5844 . . . . . 6  |-  ( ( F : B --> C  /\  ( y  -  A
)  e.  B )  ->  ( F `  ( y  -  A
) )  e.  C
)
1512, 13, 14syl2an 289 . . . . 5  |-  ( ( ( F : B --> C  /\  A  e.  CC )  /\  ( y  e.  CC  /\  ( y  -  A )  e.  B ) )  -> 
( F `  (
y  -  A ) )  e.  C )
1611, 15eqeltrd 2315 . . . 4  |-  ( ( ( F : B --> C  /\  A  e.  CC )  /\  ( y  e.  CC  /\  ( y  -  A )  e.  B ) )  -> 
( ( F  shift  A ) `  y )  e.  C )
177, 16sylan2b 287 . . 3  |-  ( ( ( F : B --> C  /\  A  e.  CC )  /\  y  e.  {
x  e.  CC  | 
( x  -  A
)  e.  B }
)  ->  ( ( F  shift  A ) `  y )  e.  C
)
1817ralrimiva 2623 . 2  |-  ( ( F : B --> C  /\  A  e.  CC )  ->  A. y  e.  {
x  e.  CC  | 
( x  -  A
)  e.  B } 
( ( F  shift  A ) `  y )  e.  C )
19 ffnfv 5869 . 2  |-  ( ( F  shift  A ) : { x  e.  CC  |  ( x  -  A )  e.  B }
--> C  <->  ( ( F 
shift  A )  Fn  {
x  e.  CC  | 
( x  -  A
)  e.  B }  /\  A. y  e.  {
x  e.  CC  | 
( x  -  A
)  e.  B } 
( ( F  shift  A ) `  y )  e.  C ) )
204, 18, 19sylanbrc 421 1  |-  ( ( F : B --> C  /\  A  e.  CC )  ->  ( F  shift  A ) : { x  e.  CC  |  ( x  -  A )  e.  B } --> C )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   {crab 2532   _Vcvv 2821    Fn wfn 5375   -->wf 5376   ` cfv 5380  (class class class)co 6088   CCcc 8183    - cmin 8504    shift cshi 11601
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-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-resscn 8277  ax-1cn 8278  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296
This proof depends on definitions:  df-bi 117  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-sub 8506  df-shft 11602
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator