Theorem shftfn 11335

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.

Step	Hyp	Ref	Expression
1		relopab 4848	. . . . 5 |- Rel { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) }
2	1	a1i 9	. . . 4 |- ( ( F Fn B /\ A e. CC ) -> Rel { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )
3		fnfun 5418	. . . . . 6 |- ( F Fn B -> Fun F )
4	3	adantr 276	. . . . 5 |- ( ( F Fn B /\ A e. CC ) -> Fun F )
5		funmo 5333	. . . . . . 7 |- ( Fun F -> E* w ( z - A ) F w )
6		vex 2802	. . . . . . . . . 10 |- z e. _V
7		vex 2802	. . . . . . . . . 10 |- w e. _V
8		eleq1 2292	. . . . . . . . . . 11 |- ( x = z -> ( x e. CC <-> z e. CC ) )
9		oveq1 6008	. . . . . . . . . . . 12 |- ( x = z -> ( x - A ) = ( z - A ) )
10	9	breq1d 4093	. . . . . . . . . . 11 |- ( x = z -> ( ( x - A ) F y <-> ( z - A ) F y ) )
11	8, 10	anbi12d 473	. . . . . . . . . 10 |- ( x = z -> ( ( x e. CC /\ ( x - A ) F y ) <-> ( z e. CC /\ ( z - A ) F y ) ) )
12		breq2 4087	. . . . . . . . . . 11 |- ( y = w -> ( ( z - A ) F y <-> ( z - A ) F w ) )
13	12	anbi2d 464	. . . . . . . . . 10 |- ( y = w -> ( ( z e. CC /\ ( z - A ) F y ) <-> ( z e. CC /\ ( z - A ) F w ) ) )
14		eqid 2229	. . . . . . . . . 10 |- { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) }
15	6, 7, 11, 13, 14	brab 4361	. . . . . . . . 9 |- ( z { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } w <-> ( z e. CC /\ ( z - A ) F w ) )
16	15	simprbi 275	. . . . . . . 8 |- ( z { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } w -> ( z - A ) F w )
17	16	moimi 2143	. . . . . . 7 |- ( E* w ( z - A ) F w -> E* w z { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } w )
18	5, 17	syl 14	. . . . . 6 |- ( Fun F -> E* w z { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } w )
19	18	alrimiv 1920	. . . . 5 |- ( Fun F -> A. z E* w z { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } w )
20	4, 19	syl 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 5332	. . . 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 ) )
22	2, 20, 21	sylanbrc 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
24	23	shftfval 11332	. . . . 5 |- ( A e. CC -> ( F shift A ) = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )
25	24	adantl 277	. . . 4 |- ( ( F Fn B /\ A e. CC ) -> ( F shift A ) = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )
26	25	funeqd 5340	. . 3 |- ( ( F Fn B /\ A e. CC ) -> ( Fun ( F shift A ) <-> Fun { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } ) )
27	22, 26	mpbird 167	. 2 |- ( ( F Fn B /\ A e. CC ) -> Fun ( F shift A ) )
28	23	shftdm 11333	. . 3 |- ( A e. CC -> dom ( F shift A ) = { x e. CC | ( x - A ) e. dom F } )
29		fndm 5420	. . . . 5 |- ( F Fn B -> dom F = B )
30	29	eleq2d 2299	. . . 4 |- ( F Fn B -> ( ( x - A ) e. dom F <-> ( x - A ) e. B ) )
31	30	rabbidv 2788	. . 3 |- ( F Fn B -> { x e. CC | ( x - A ) e. dom F } = { x e. CC | ( x - A ) e. B } )
32	28, 31	sylan9eqr 2284	. 2 |- ( ( F Fn B /\ A e. CC ) -> dom ( F shift A ) = { x e. CC | ( x - A ) e. B } )
33		df-fn 5321	. 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 } ) )
34	27, 32, 33	sylanbrc 417	1 |- ( ( F Fn B /\ A e. CC ) -> ( F shift A ) Fn { x e. CC | ( x - A ) e. B } )

Syntax hints:   -> wi 4   /\ wa 104   A.wal 1393   = wceq 1395   E*wmo 2078   e. wcel 2200   {crab 2512   _Vcvv 2799   class class class wbr 4083   {copab 4144   dom cdm 4719   Rel wrel 4724   Fun wfun 5312   Fn wfn 5313  (class class class)co 6001   CCcc 7997   - cmin 8317   shift cshi 11325

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-resscn 8091  ax-1cn 8092  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-sub 8319  df-shft 11326

This theorem is referenced by:  shftf  11341  seq3shft  11349