Theorem resfval2 17982

Description: Value of the functor restriction operator. (Contributed by Mario Carneiro, 6-Jan-2017.)

Hypotheses

Ref	Expression
resfval.c	⊢ (𝜑 → 𝐹 ∈ 𝑉)
resfval.d	⊢ (𝜑 → 𝐻 ∈ 𝑊)
resfval2.g	⊢ (𝜑 → 𝐺 ∈ 𝑋)
resfval2.d	⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆))

Assertion

Ref	Expression
resfval2	⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨(𝐹 ↾ 𝑆), (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)

Distinct variable groups:   𝑥,𝐹   𝑥,𝑦,𝐺   𝑥,𝐻,𝑦   𝜑,𝑥   𝑥,𝑆,𝑦

Allowed substitution hints:   𝜑(𝑦)   𝐹(𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)   𝑋(𝑥, 𝑦)

Proof of Theorem resfval2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opex 5439	. . . 4 ⊢ ⟨𝐹, 𝐺⟩ ∈ V
2	1	a1i 11	. . 3 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ V)
3		resfval.d	. . 3 ⊢ (𝜑 → 𝐻 ∈ 𝑊)
4	2, 3	resfval 17981	. 2 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻‘𝑧)))⟩)
5		resfval.c	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
6		resfval2.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝑋)
7		op1stg 7998	. . . . 5 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑋) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
8	5, 6, 7	syl2anc 596	. . . 4 ⊢ (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
9		resfval2.d	. . . . . . 7 ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆))
10	9	fndmd 6637	. . . . . 6 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
11	10	dmeqd 5889	. . . . 5 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
12		dmxpid 5914	. . . . 5 ⊢ dom (𝑆 × 𝑆) = 𝑆
13	11, 12	eqtrdi 2811	. . . 4 ⊢ (𝜑 → dom dom 𝐻 = 𝑆)
14	8, 13	reseq12d 5973	. . 3 ⊢ (𝜑 → ((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻) = (𝐹 ↾ 𝑆))
15		op2ndg 7999	. . . . . . . 8 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑋) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
16	5, 6, 15	syl2anc 596	. . . . . . 7 ⊢ (𝜑 → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
17	16	fveq1d 6880	. . . . . 6 ⊢ (𝜑 → ((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) = (𝐺‘𝑧))
18	17	reseq1d 5971	. . . . 5 ⊢ (𝜑 → (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻‘𝑧)) = ((𝐺‘𝑧) ↾ (𝐻‘𝑧)))
19	10, 18	mpteq12dv 5192	. . . 4 ⊢ (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻‘𝑧))) = (𝑧 ∈ (𝑆 × 𝑆) ↦ ((𝐺‘𝑧) ↾ (𝐻‘𝑧))))
20		fveq2 6878	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐺‘𝑧) = (𝐺‘⟨𝑥, 𝑦⟩))
21		df-ov 7416	. . . . . . 7 ⊢ (𝑥𝐺𝑦) = (𝐺‘⟨𝑥, 𝑦⟩)
22	20, 21	eqtr4di 2813	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐺‘𝑧) = (𝑥𝐺𝑦))
23		fveq2 6878	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻‘𝑧) = (𝐻‘⟨𝑥, 𝑦⟩))
24		df-ov 7416	. . . . . . 7 ⊢ (𝑥𝐻𝑦) = (𝐻‘⟨𝑥, 𝑦⟩)
25	23, 24	eqtr4di 2813	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝐻‘𝑧) = (𝑥𝐻𝑦))
26	22, 25	reseq12d 5973	. . . . 5 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ((𝐺‘𝑧) ↾ (𝐻‘𝑧)) = ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))
27	26	mpompt 7527	. . . 4 ⊢ (𝑧 ∈ (𝑆 × 𝑆) ↦ ((𝐺‘𝑧) ↾ (𝐻‘𝑧))) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))
28	19, 27	eqtrdi 2811	. . 3 ⊢ (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻‘𝑧))) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦))))
29	14, 28	opeq12d 4841	. 2 ⊢ (𝜑 → ⟨((1st ‘⟨𝐹, 𝐺⟩) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘⟨𝐹, 𝐺⟩)‘𝑧) ↾ (𝐻‘𝑧)))⟩ = ⟨(𝐹 ↾ 𝑆), (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)
30	4, 29	eqtrd 2795	1 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ↾f 𝐻) = ⟨(𝐹 ↾ 𝑆), (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ ((𝑥𝐺𝑦) ↾ (𝑥𝐻𝑦)))⟩)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ⟨cop 4590   ↦ cmpt 5186   × cxp 5653  dom cdm 5655   ↾ cres 5657   Fn wfn 6528  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  1^st c1st 7984  2^nd c2nd 7985   ↾_f cresf 17946

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-resf 17950

This theorem is used by:  funcrngcsetc  20802  funcringcsetc  20836