Theorem shftfval 11586

Description: The value of the sequence shifter operation is a function on CC. A is ordinarily an integer. (Contributed by NM, 20-Jul-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)

Hypothesis

Ref	Expression
shftfval.1	|- F e. _V

Assertion

Ref	Expression
shftfval	|- ( A e. CC -> ( F shift A ) = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )

Distinct variable groups:   x, y, A   x, F, y

Proof of Theorem shftfval

Dummy variables w z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 533	. . . . . . . . . . 11 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> x e. CC )
2		simpll 531	. . . . . . . . . . 11 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> A e. CC )
3	1, 2	subcld 8637	. . . . . . . . . 10 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> ( x - A ) e. CC )
4		vex 2824	. . . . . . . . . . 11 |- y e. _V
5		breldmg 4987	. . . . . . . . . . 11 |- ( ( ( x - A ) e. CC /\ y e. _V /\ ( x - A ) F y ) -> ( x - A ) e. dom F )
6	4, 5	mp3an2 1366	. . . . . . . . . 10 |- ( ( ( x - A ) e. CC /\ ( x - A ) F y ) -> ( x - A ) e. dom F )
7	3, 6	sylancom 424	. . . . . . . . 9 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> ( x - A ) e. dom F )
8		npcan 8535	. . . . . . . . . . . 12 |- ( ( x e. CC /\ A e. CC ) -> ( ( x - A ) + A ) = x )
9	8	eqcomd 2244	. . . . . . . . . . 11 |- ( ( x e. CC /\ A e. CC ) -> x = ( ( x - A ) + A ) )
10	9	ancoms 268	. . . . . . . . . 10 |- ( ( A e. CC /\ x e. CC ) -> x = ( ( x - A ) + A ) )
11	10	adantr 276	. . . . . . . . 9 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> x = ( ( x - A ) + A ) )
12		oveq1 6092	. . . . . . . . . . 11 |- ( w = ( x - A ) -> ( w + A ) = ( ( x - A ) + A ) )
13	12	eqeq2d 2250	. . . . . . . . . 10 |- ( w = ( x - A ) -> ( x = ( w + A ) <-> x = ( ( x - A ) + A ) ) )
14	13	rspcev 2929	. . . . . . . . 9 |- ( ( ( x - A ) e. dom F /\ x = ( ( x - A ) + A ) ) -> E. w e. dom F x = ( w + A ) )
15	7, 11, 14	syl2anc 415	. . . . . . . 8 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> E. w e. dom F x = ( w + A ) )
16		vex 2824	. . . . . . . . 9 |- x e. _V
17		eqeq1 2245	. . . . . . . . . 10 |- ( z = x -> ( z = ( w + A ) <-> x = ( w + A ) ) )
18	17	rexbidv 2551	. . . . . . . . 9 |- ( z = x -> ( E. w e. dom F z = ( w + A ) <-> E. w e. dom F x = ( w + A ) ) )
19	16, 18	elab 2970	. . . . . . . 8 |- ( x e. { z | E. w e. dom F z = ( w + A ) } <-> E. w e. dom F x = ( w + A ) )
20	15, 19	sylibr 134	. . . . . . 7 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> x e. { z | E. w e. dom F z = ( w + A ) } )
21		brelrng 5013	. . . . . . . . 9 |- ( ( ( x - A ) e. CC /\ y e. _V /\ ( x - A ) F y ) -> y e. ran F )
22	4, 21	mp3an2 1366	. . . . . . . 8 |- ( ( ( x - A ) e. CC /\ ( x - A ) F y ) -> y e. ran F )
23	3, 22	sylancom 424	. . . . . . 7 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> y e. ran F )
24	20, 23	jca 306	. . . . . 6 |- ( ( ( A e. CC /\ x e. CC ) /\ ( x - A ) F y ) -> ( x e. { z | E. w e. dom F z = ( w + A ) } /\ y e. ran F ) )
25	24	expl 378	. . . . 5 |- ( A e. CC -> ( ( x e. CC /\ ( x - A ) F y ) -> ( x e. { z | E. w e. dom F z = ( w + A ) } /\ y e. ran F ) ) )
26	25	ssopab2dv 4421	. . . 4 |- ( A e. CC -> { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } C_ { <. x , y >. | ( x e. { z | E. w e. dom F z = ( w + A ) } /\ y e. ran F ) } )
27		df-xp 4780	. . . 4 |- ( { z | E. w e. dom F z = ( w + A ) } X. ran F ) = { <. x , y >. | ( x e. { z | E. w e. dom F z = ( w + A ) } /\ y e. ran F ) }
28	26, 27	sseqtrrdi 3297	. . 3 |- ( A e. CC -> { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } C_ ( { z | E. w e. dom F z = ( w + A ) } X. ran F ) )
29		shftfval.1	. . . . . 6 |- F e. _V
30	29	dmex 5049	. . . . 5 |- dom F e. _V
31	30	abrexex 6346	. . . 4 |- { z | E. w e. dom F z = ( w + A ) } e. _V
32	29	rnex 5050	. . . 4 |- ran F e. _V
33	31, 32	xpex 4891	. . 3 |- ( { z | E. w e. dom F z = ( w + A ) } X. ran F ) e. _V
34		ssexg 4272	. . 3 |- ( ( { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } C_ ( { z | E. w e. dom F z = ( w + A ) } X. ran F ) /\ ( { z | E. w e. dom F z = ( w + A ) } X. ran F ) e. _V ) -> { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } e. _V )
35	28, 33, 34	sylancl 417	. 2 |- ( A e. CC -> { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } e. _V )
36		breq 4132	. . . . . 6 |- ( z = F -> ( ( x - w ) z y <-> ( x - w ) F y ) )
37	36	anbi2d 468	. . . . 5 |- ( z = F -> ( ( x e. CC /\ ( x - w ) z y ) <-> ( x e. CC /\ ( x - w ) F y ) ) )
38	37	opabbidv 4197	. . . 4 |- ( z = F -> { <. x , y >. | ( x e. CC /\ ( x - w ) z y ) } = { <. x , y >. | ( x e. CC /\ ( x - w ) F y ) } )
39		oveq2 6093	. . . . . . 7 |- ( w = A -> ( x - w ) = ( x - A ) )
40	39	breq1d 4140	. . . . . 6 |- ( w = A -> ( ( x - w ) F y <-> ( x - A ) F y ) )
41	40	anbi2d 468	. . . . 5 |- ( w = A -> ( ( x e. CC /\ ( x - w ) F y ) <-> ( x e. CC /\ ( x - A ) F y ) ) )
42	41	opabbidv 4197	. . . 4 |- ( w = A -> { <. x , y >. | ( x e. CC /\ ( x - w ) F y ) } = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )
43		df-shft 11580	. . . 4 |- shift = ( z e. _V , w e. CC |-> { <. x , y >. | ( x e. CC /\ ( x - w ) z y ) } )
44	38, 42, 43	ovmpog 6223	. . 3 |- ( ( F e. _V /\ A e. CC /\ { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } e. _V ) -> ( F shift A ) = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )
45	29, 44	mp3an1 1365	. 2 |- ( ( A e. CC /\ { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } e. _V ) -> ( F shift A ) = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )
46	35, 45	mpdan 425	1 |- ( A e. CC -> ( F shift A ) = { <. x , y >. | ( x e. CC /\ ( x - A ) F y ) } )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   {cab 2224   E.wrex 2529   _Vcvv 2821   C_ wss 3220   class class class wbr 4130   {copab 4191   X. cxp 4772   dom cdm 4774   ran crn 4775  (class class class)co 6085   CCcc 8177   + caddc 8182   - cmin 8497   shift cshi 11579

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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-resscn 8271  ax-1cn 8272  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-shft 11580

This theorem is used by:  shftdm  11587  shftfib  11588  shftfn  11589  2shfti  11596  shftidt2  11597