Theorem shftfn 11611

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 4908	. . . . 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 5481	. . . . . 6 |- ( F Fn B -> Fun F )
4	3	adantr 276	. . . . 5 |- ( ( F Fn B /\ A e. CC ) -> Fun F )
5		funmo 5395	. . . . . . 7 |- ( Fun F -> E* w ( z - A ) F w )
6		vex 2824	. . . . . . . . . 10 |- z e. _V
7		vex 2824	. . . . . . . . . 10 |- w e. _V
8		eleq1 2301	. . . . . . . . . . 11 |- ( x = z -> ( x e. CC <-> z e. CC ) )
9		oveq1 6095	. . . . . . . . . . . 12 |- ( x = z -> ( x - A ) = ( z - A ) )
10	9	breq1d 4141	. . . . . . . . . . 11 |- ( x = z -> ( ( x - A ) F y <-> ( z - A ) F y ) )
11	8, 10	anbi12d 477	. . . . . . . . . 10 |- ( x = z -> ( ( x e. CC /\ ( x - A ) F y ) <-> ( z e. CC /\ ( z - A ) F y ) ) )
12		breq2 4135	. . . . . . . . . . 11 |- ( y = w -> ( ( z - A ) F y <-> ( z - A ) F w ) )
13	12	anbi2d 468	. . . . . . . . . 10 |- ( y = w -> ( ( z e. CC /\ ( z - A ) F y ) <-> ( z e. CC /\ ( z - A ) F w ) ) )
14		eqid 2238	. . . . . . . . . 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 4417	. . . . . . . . 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 2152	. . . . . . 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 1927	. . . . 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 5394	. . . 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 421	. . 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 11608	. . . . 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 5402	. . 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 11609	. . 3 |- ( A e. CC -> dom ( F shift A ) = { x e. CC | ( x - A ) e. dom F } )
29		fndm 5483	. . . . 5 |- ( F Fn B -> dom F = B )
30	29	eleq2d 2308	. . . 4 |- ( F Fn B -> ( ( x - A ) e. dom F <-> ( x - A ) e. B ) )
31	30	rabbidv 2810	. . 3 |- ( F Fn B -> { x e. CC | ( x - A ) e. dom F } = { x e. CC | ( x - A ) e. B } )
32	28, 31	sylan9eqr 2293	. 2 |- ( ( F Fn B /\ A e. CC ) -> dom ( F shift A ) = { x e. CC | ( x - A ) e. B } )
33		df-fn 5383	. 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 421	1 |- ( ( F Fn B /\ A e. CC ) -> ( F shift A ) Fn { x e. CC | ( x - A ) e. B } )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   A.wal 1400   = wceq 1402   E*wmo 2087   e. wcel 2209   {crab 2532   _Vcvv 2821   class class class wbr 4131   {copab 4192   dom cdm 4776   Rel wrel 4781   Fun wfun 5374   Fn wfn 5375  (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:  shftf  11617  seq3shft  11625