Theorem shftfvalg 11324

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

Assertion

Ref	Expression
shftfvalg	⊢ ((𝐴 ∈ ℂ ∧ 𝐹 ∈ 𝑉) → (𝐹 shift 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)})

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐹,𝑦

Allowed substitution hints:   𝑉(𝑥,𝑦)

Proof of Theorem shftfvalg

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 110	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐹 ∈ 𝑉) → 𝐹 ∈ 𝑉)
2		simpl 109	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐹 ∈ 𝑉) → 𝐴 ∈ ℂ)
3		simplr 528	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → 𝑥 ∈ ℂ)
4		simpll 527	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → 𝐴 ∈ ℂ)
5	3, 4	subcld 8453	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → (𝑥 − 𝐴) ∈ ℂ)
6		vex 2802	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
7		breldmg 4928	. . . . . . . . . . 11 ⊢ (((𝑥 − 𝐴) ∈ ℂ ∧ 𝑦 ∈ V ∧ (𝑥 − 𝐴)𝐹𝑦) → (𝑥 − 𝐴) ∈ dom 𝐹)
8	6, 7	mp3an2 1359	. . . . . . . . . 10 ⊢ (((𝑥 − 𝐴) ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) → (𝑥 − 𝐴) ∈ dom 𝐹)
9	5, 8	sylancom 420	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → (𝑥 − 𝐴) ∈ dom 𝐹)
10		npcan 8351	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℂ ∧ 𝐴 ∈ ℂ) → ((𝑥 − 𝐴) + 𝐴) = 𝑥)
11	10	eqcomd 2235	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℂ ∧ 𝐴 ∈ ℂ) → 𝑥 = ((𝑥 − 𝐴) + 𝐴))
12	11	ancoms 268	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → 𝑥 = ((𝑥 − 𝐴) + 𝐴))
13	12	adantr 276	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → 𝑥 = ((𝑥 − 𝐴) + 𝐴))
14		oveq1 6007	. . . . . . . . . . 11 ⊢ (𝑤 = (𝑥 − 𝐴) → (𝑤 + 𝐴) = ((𝑥 − 𝐴) + 𝐴))
15	14	eqeq2d 2241	. . . . . . . . . 10 ⊢ (𝑤 = (𝑥 − 𝐴) → (𝑥 = (𝑤 + 𝐴) ↔ 𝑥 = ((𝑥 − 𝐴) + 𝐴)))
16	15	rspcev 2907	. . . . . . . . 9 ⊢ (((𝑥 − 𝐴) ∈ dom 𝐹 ∧ 𝑥 = ((𝑥 − 𝐴) + 𝐴)) → ∃𝑤 ∈ dom 𝐹 𝑥 = (𝑤 + 𝐴))
17	9, 13, 16	syl2anc 411	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → ∃𝑤 ∈ dom 𝐹 𝑥 = (𝑤 + 𝐴))
18		vex 2802	. . . . . . . . 9 ⊢ 𝑥 ∈ V
19		eqeq1 2236	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑧 = (𝑤 + 𝐴) ↔ 𝑥 = (𝑤 + 𝐴)))
20	19	rexbidv 2531	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴) ↔ ∃𝑤 ∈ dom 𝐹 𝑥 = (𝑤 + 𝐴)))
21	18, 20	elab 2947	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ↔ ∃𝑤 ∈ dom 𝐹 𝑥 = (𝑤 + 𝐴))
22	17, 21	sylibr 134	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → 𝑥 ∈ {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)})
23		brelrng 4954	. . . . . . . . 9 ⊢ (((𝑥 − 𝐴) ∈ ℂ ∧ 𝑦 ∈ V ∧ (𝑥 − 𝐴)𝐹𝑦) → 𝑦 ∈ ran 𝐹)
24	6, 23	mp3an2 1359	. . . . . . . 8 ⊢ (((𝑥 − 𝐴) ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) → 𝑦 ∈ ran 𝐹)
25	5, 24	sylancom 420	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → 𝑦 ∈ ran 𝐹)
26	22, 25	jca 306	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) ∧ (𝑥 − 𝐴)𝐹𝑦) → (𝑥 ∈ {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ∧ 𝑦 ∈ ran 𝐹))
27	26	expl 378	. . . . 5 ⊢ (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦) → (𝑥 ∈ {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ∧ 𝑦 ∈ ran 𝐹)))
28	27	ssopab2dv 4366	. . . 4 ⊢ (𝐴 ∈ ℂ → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} ⊆ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ∧ 𝑦 ∈ ran 𝐹)})
29		df-xp 4724	. . . 4 ⊢ ({𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} × ran 𝐹) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ∧ 𝑦 ∈ ran 𝐹)}
30	28, 29	sseqtrrdi 3273	. . 3 ⊢ (𝐴 ∈ ℂ → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} ⊆ ({𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} × ran 𝐹))
31		dmexg 4987	. . . . 5 ⊢ (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V)
32		abrexexg 6261	. . . . 5 ⊢ (dom 𝐹 ∈ V → {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ∈ V)
33	31, 32	syl 14	. . . 4 ⊢ (𝐹 ∈ 𝑉 → {𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ∈ V)
34		rnexg 4988	. . . 4 ⊢ (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V)
35		xpexg 4832	. . . 4 ⊢ (({𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} ∈ V ∧ ran 𝐹 ∈ V) → ({𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} × ran 𝐹) ∈ V)
36	33, 34, 35	syl2anc 411	. . 3 ⊢ (𝐹 ∈ 𝑉 → ({𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} × ran 𝐹) ∈ V)
37		ssexg 4222	. . 3 ⊢ (({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} ⊆ ({𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} × ran 𝐹) ∧ ({𝑧 ∣ ∃𝑤 ∈ dom 𝐹 𝑧 = (𝑤 + 𝐴)} × ran 𝐹) ∈ V) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} ∈ V)
38	30, 36, 37	syl2an 289	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐹 ∈ 𝑉) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} ∈ V)
39		elex 2811	. . 3 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
40		breq 4084	. . . . . 6 ⊢ (𝑧 = 𝐹 → ((𝑥 − 𝑤)𝑧𝑦 ↔ (𝑥 − 𝑤)𝐹𝑦))
41	40	anbi2d 464	. . . . 5 ⊢ (𝑧 = 𝐹 → ((𝑥 ∈ ℂ ∧ (𝑥 − 𝑤)𝑧𝑦) ↔ (𝑥 ∈ ℂ ∧ (𝑥 − 𝑤)𝐹𝑦)))
42	41	opabbidv 4149	. . . 4 ⊢ (𝑧 = 𝐹 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝑤)𝑧𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝑤)𝐹𝑦)})
43		oveq2 6008	. . . . . . 7 ⊢ (𝑤 = 𝐴 → (𝑥 − 𝑤) = (𝑥 − 𝐴))
44	43	breq1d 4092	. . . . . 6 ⊢ (𝑤 = 𝐴 → ((𝑥 − 𝑤)𝐹𝑦 ↔ (𝑥 − 𝐴)𝐹𝑦))
45	44	anbi2d 464	. . . . 5 ⊢ (𝑤 = 𝐴 → ((𝑥 ∈ ℂ ∧ (𝑥 − 𝑤)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)))
46	45	opabbidv 4149	. . . 4 ⊢ (𝑤 = 𝐴 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝑤)𝐹𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)})
47		df-shft 11321	. . . 4 ⊢ shift = (𝑧 ∈ V, 𝑤 ∈ ℂ ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝑤)𝑧𝑦)})
48	42, 46, 47	ovmpog 6138	. . 3 ⊢ ((𝐹 ∈ V ∧ 𝐴 ∈ ℂ ∧ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} ∈ V) → (𝐹 shift 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)})
49	39, 48	syl3an1 1304	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ ℂ ∧ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)} ∈ V) → (𝐹 shift 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)})
50	1, 2, 38, 49	syl3anc 1271	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐹 ∈ 𝑉) → (𝐹 shift 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥 − 𝐴)𝐹𝑦)})

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1395   ∈ wcel 2200  {cab 2215  ∃wrex 2509  Vcvv 2799   ⊆ wss 3197   class class class wbr 4082  {copab 4143   × cxp 4716  dom cdm 4718  ran crn 4719  (class class class)co 6000  ℂcc 7993   + caddc 7998   − cmin 8313   shift cshi 11320

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 4198  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-resscn 8087  ax-1cn 8088  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-distr 8099  ax-i2m1 8100  ax-0id 8103  ax-rnegex 8104  ax-cnre 8106

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 3888  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-sub 8315  df-shft 11321

This theorem is referenced by:  ovshftex  11325  shftfibg  11326  2shfti  11337