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

Theorem shftfn 11513
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 4883 . . . . 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 5455 . . . . . 6  |-  ( F  Fn  B  ->  Fun  F )
43adantr 276 . . . . 5  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  Fun  F )
5 funmo 5369 . . . . . . 7  |-  ( Fun 
F  ->  E* w
( z  -  A
) F w )
6 vex 2818 . . . . . . . . . 10  |-  z  e. 
_V
7 vex 2818 . . . . . . . . . 10  |-  w  e. 
_V
8 eleq1 2297 . . . . . . . . . . 11  |-  ( x  =  z  ->  (
x  e.  CC  <->  z  e.  CC ) )
9 oveq1 6059 . . . . . . . . . . . 12  |-  ( x  =  z  ->  (
x  -  A )  =  ( z  -  A ) )
109breq1d 4121 . . . . . . . . . . 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 4115 . . . . . . . . . . 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 2234 . . . . . . . . . 10  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
156, 7, 11, 13, 14brab 4393 . . . . . . . . 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 2148 . . . . . . 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 1923 . . . . 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 5368 . . . 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 11510 . . . . 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 5376 . . 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 11511 . . 3  |-  ( A  e.  CC  ->  dom  ( F  shift  A )  =  { x  e.  CC  |  ( x  -  A )  e. 
dom  F } )
29 fndm 5457 . . . . 5  |-  ( F  Fn  B  ->  dom  F  =  B )
3029eleq2d 2304 . . . 4  |-  ( F  Fn  B  ->  (
( x  -  A
)  e.  dom  F  <->  ( x  -  A )  e.  B ) )
3130rabbidv 2804 . . 3  |-  ( F  Fn  B  ->  { x  e.  CC  |  ( x  -  A )  e. 
dom  F }  =  { x  e.  CC  |  ( x  -  A )  e.  B } )
3228, 31sylan9eqr 2289 . 2  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  dom  ( F  shift  A )  =  { x  e.  CC  |  ( x  -  A )  e.  B } )
33 df-fn 5357 . 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 1396    = wceq 1398   E*wmo 2083    e. wcel 2205   {crab 2526   _Vcvv 2815   class class class wbr 4111   {copab 4172   dom cdm 4751   Rel wrel 4756   Fun wfun 5348    Fn wfn 5349  (class class class)co 6052   CCcc 8127    - cmin 8446    shift cshi 11503
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-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-resscn 8221  ax-1cn 8222  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-sub 8448  df-shft 11504
This theorem is referenced by:  shftf  11519  seq3shft  11527
  Copyright terms: Public domain W3C validator