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

Theorem shftfn 10628
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 4674 . . . . 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 5228 . . . . . 6  |-  ( F  Fn  B  ->  Fun  F )
43adantr 274 . . . . 5  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  Fun  F )
5 funmo 5146 . . . . . . 7  |-  ( Fun 
F  ->  E* w
( z  -  A
) F w )
6 vex 2692 . . . . . . . . . 10  |-  z  e. 
_V
7 vex 2692 . . . . . . . . . 10  |-  w  e. 
_V
8 eleq1 2203 . . . . . . . . . . 11  |-  ( x  =  z  ->  (
x  e.  CC  <->  z  e.  CC ) )
9 oveq1 5789 . . . . . . . . . . . 12  |-  ( x  =  z  ->  (
x  -  A )  =  ( z  -  A ) )
109breq1d 3947 . . . . . . . . . . 11  |-  ( x  =  z  ->  (
( x  -  A
) F y  <->  ( z  -  A ) F y ) )
118, 10anbi12d 465 . . . . . . . . . 10  |-  ( x  =  z  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  <-> 
( z  e.  CC  /\  ( z  -  A
) F y ) ) )
12 breq2 3941 . . . . . . . . . . 11  |-  ( y  =  w  ->  (
( z  -  A
) F y  <->  ( z  -  A ) F w ) )
1312anbi2d 460 . . . . . . . . . 10  |-  ( y  =  w  ->  (
( z  e.  CC  /\  ( z  -  A
) F y )  <-> 
( z  e.  CC  /\  ( z  -  A
) F w ) ) )
14 eqid 2140 . . . . . . . . . 10  |-  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }
156, 7, 11, 13, 14brab 4202 . . . . . . . . 9  |-  ( z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w  <->  ( z  e.  CC  /\  ( z  -  A
) F w ) )
1615simprbi 273 . . . . . . . 8  |-  ( z { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } w  ->  ( z  -  A
) F w )
1716moimi 2065 . . . . . . 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 1847 . . . . 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 5145 . . . 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 414 . . 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 10625 . . . . 5  |-  ( A  e.  CC  ->  ( F  shift  A )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
2524adantl 275 . . . 4  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  ( F  shift  A )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
2625funeqd 5153 . . 3  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  ( Fun  ( F 
shift  A )  <->  Fun  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } ) )
2722, 26mpbird 166 . 2  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  Fun  ( F  shift  A ) )
2823shftdm 10626 . . 3  |-  ( A  e.  CC  ->  dom  ( F  shift  A )  =  { x  e.  CC  |  ( x  -  A )  e. 
dom  F } )
29 fndm 5230 . . . . 5  |-  ( F  Fn  B  ->  dom  F  =  B )
3029eleq2d 2210 . . . 4  |-  ( F  Fn  B  ->  (
( x  -  A
)  e.  dom  F  <->  ( x  -  A )  e.  B ) )
3130rabbidv 2678 . . 3  |-  ( F  Fn  B  ->  { x  e.  CC  |  ( x  -  A )  e. 
dom  F }  =  { x  e.  CC  |  ( x  -  A )  e.  B } )
3228, 31sylan9eqr 2195 . 2  |-  ( ( F  Fn  B  /\  A  e.  CC )  ->  dom  ( F  shift  A )  =  { x  e.  CC  |  ( x  -  A )  e.  B } )
33 df-fn 5134 . 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 414 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 103   A.wal 1330    = wceq 1332    e. wcel 1481   E*wmo 2001   {crab 2421   _Vcvv 2689   class class class wbr 3937   {copab 3996   dom cdm 4547   Rel wrel 4552   Fun wfun 5125    Fn wfn 5126  (class class class)co 5782   CCcc 7642    - cmin 7957    shift cshi 10618
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-resscn 7736  ax-1cn 7737  ax-icn 7739  ax-addcl 7740  ax-addrcl 7741  ax-mulcl 7742  ax-addcom 7744  ax-addass 7746  ax-distr 7748  ax-i2m1 7749  ax-0id 7752  ax-rnegex 7753  ax-cnre 7755
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-riota 5738  df-ov 5785  df-oprab 5786  df-mpo 5787  df-sub 7959  df-shft 10619
This theorem is referenced by:  shftf  10634  seq3shft  10642
  Copyright terms: Public domain W3C validator