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

Theorem shftfn 10968
Description: Functionality and domain of a sequence shifted by  A. (Contributed by NM, 20-Jul-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1  |-  F  e. 
_V
Assertion
Ref Expression
shftfn  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  ( F  shift  A )  Fn  { x  e.  CC  |  ( x  -  A )  e.  B } )
Distinct variable groups:    x, A    x, F    x, B

Proof of Theorem shftfn
Dummy variables  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relopab 4788 . . . . 5  |-  Rel  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) }
21a1i 9 . . . 4  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  Rel  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
3 fnfun 5351 . . . . . 6  |-  ( F  Fn  B  ->  Fun  F )
43adantr 276 . . . . 5  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  Fun  F )
5 funmo 5269 . . . . . . 7  |-  ( Fun 
F  ->  E* w
( z  -  A
) F w )
6 vex 2763 . . . . . . . . . 10  |-  z  e. 
_V
7 vex 2763 . . . . . . . . . 10  |-  w  e. 
_V
8 eleq1 2256 . . . . . . . . . . 11  |-  ( x  =  z  ->  (
x  e.  CC  <->  z  e.  CC ) )
9 oveq1 5925 . . . . . . . . . . . 12  |-  ( x  =  z  ->  (
x  -  A )  =  ( z  -  A ) )
109breq1d 4039 . . . . . . . . . . 11  |-  ( x  =  z  ->  (
( x  -  A
) F y  <->  ( z  -  A ) F y ) )
118, 10anbi12d 473 . . . . . . . . . 10  |-  ( x  =  z  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  <-> 
( z  e.  CC  /\  ( z  -  A
) F y ) ) )
12 breq2 4033 . . . . . . . . . . 11  |-  ( y  =  w  ->  (
( z  -  A
) F y  <->  ( z  -  A ) F w ) )
1312anbi2d 464 . . . . . . . . . 10  |-  ( y  =  w  ->  (
( z  e.  CC  /\  ( z  -  A
) F y )  <-> 
( z  e.  CC  /\  ( z  -  A
) F w ) ) )
14 eqid 2193 . . . . . . . . . 10  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
156, 7, 11, 13, 14brab 4303 . . . . . . . . 9  |-  ( z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w  <->  ( z  e.  CC  /\  ( z  -  A
) F w ) )
1615simprbi 275 . . . . . . . 8  |-  ( z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w  ->  ( z  -  A
) F w )
1716moimi 2107 . . . . . . 7  |-  ( E* w ( z  -  A ) F w  ->  E* w  z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w
)
185, 17syl 14 . . . . . 6  |-  ( Fun 
F  ->  E* w  z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w
)
1918alrimiv 1885 . . . . 5  |-  ( Fun 
F  ->  A. z E* w  z { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w
)
204, 19syl 14 . . . 4  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  A. z E* w  z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w
)
21 dffun6 5268 . . . 4  |-  ( Fun 
{ <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) }  <->  ( Rel  {
<. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) }  /\  A. z E* w  z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w
) )
222, 20, 21sylanbrc 417 . . 3  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  Fun  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
23 shftfval.1 . . . . . 6  |-  F  e. 
_V
2423shftfval 10965 . . . . 5  |-  ( A  e.  CC  ->  ( F  shift  A )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
2524adantl 277 . . . 4  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  ( F  shift  A )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
2625funeqd 5276 . . 3  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  ( Fun  ( F 
shift  A )  <->  Fun  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } ) )
2722, 26mpbird 167 . 2  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  Fun  ( F  shift  A ) )
2823shftdm 10966 . . 3  |-  ( A  e.  CC  ->  dom  ( F  shift  A )  =  { x  e.  CC  |  ( x  -  A )  e. 
dom  F } )
29 fndm 5353 . . . . 5  |-  ( F  Fn  B  ->  dom  F  =  B )
3029eleq2d 2263 . . . 4  |-  ( F  Fn  B  ->  (
( x  -  A
)  e.  dom  F  <->  ( x  -  A )  e.  B ) )
3130rabbidv 2749 . . 3  |-  ( F  Fn  B  ->  { x  e.  CC  |  ( x  -  A )  e. 
dom  F }  =  { x  e.  CC  |  ( x  -  A )  e.  B } )
3228, 31sylan9eqr 2248 . 2  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  dom  ( F  shift  A )  =  { x  e.  CC  |  ( x  -  A )  e.  B } )
33 df-fn 5257 . 2  |-  ( ( F  shift  A )  Fn  { x  e.  CC  |  ( x  -  A )  e.  B } 
<->  ( Fun  ( F 
shift  A )  /\  dom  ( F  shift  A )  =  { x  e.  CC  |  ( x  -  A )  e.  B } ) )
3427, 32, 33sylanbrc 417 1  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  ( F  shift  A )  Fn  { x  e.  CC  |  ( x  -  A )  e.  B } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1362    = wceq 1364   E*wmo 2043    e. wcel 2164   {crab 2476   _Vcvv 2760   class class class wbr 4029   {copab 4089   dom cdm 4659   Rel wrel 4664   Fun wfun 5248    Fn wfn 5249  (class class class)co 5918   CCcc 7870    - cmin 8190    shift cshi 10958
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4144  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-resscn 7964  ax-1cn 7965  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-distr 7976  ax-i2m1 7977  ax-0id 7980  ax-rnegex 7981  ax-cnre 7983
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-sub 8192  df-shft 10959
This theorem is referenced by:  shftf  10974  seq3shft  10982
  Copyright terms: Public domain W3C validator