Theorem resf1st 17983

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

Hypotheses

Ref	Expression
resf1st.f	⊢ (𝜑 → 𝐹 ∈ 𝑉)
resf1st.h	⊢ (𝜑 → 𝐻 ∈ 𝑊)
resf1st.s	⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆))

Assertion

Ref	Expression
resf1st	⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = ((1st ‘𝐹) ↾ 𝑆))

Proof of Theorem resf1st

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		resf1st.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
2		resf1st.h	. . . 4 ⊢ (𝜑 → 𝐻 ∈ 𝑊)
3	1, 2	resfval 17981	. . 3 ⊢ (𝜑 → (𝐹 ↾f 𝐻) = ⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩)
4	3	fveq2d 6882	. 2 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = (1st ‘⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩))
5		fvex 6891	. . . 4 ⊢ (1st ‘𝐹) ∈ V
6	5	resex 6022	. . 3 ⊢ ((1st ‘𝐹) ↾ dom dom 𝐻) ∈ V
7		dmexg 7898	. . . 4 ⊢ (𝐻 ∈ 𝑊 → dom 𝐻 ∈ V)
8		mptexg 7220	. . . 4 ⊢ (dom 𝐻 ∈ V → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
9	2, 7, 8	3syl 19	. . 3 ⊢ (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
10		op1stg 7998	. . 3 ⊢ ((((1st ‘𝐹) ↾ dom dom 𝐻) ∈ V ∧ (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V) → (1st ‘⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩) = ((1st ‘𝐹) ↾ dom dom 𝐻))
11	6, 9, 10	sylancr 599	. 2 ⊢ (𝜑 → (1st ‘⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩) = ((1st ‘𝐹) ↾ dom dom 𝐻))
12		resf1st.s	. . . . . 6 ⊢ (𝜑 → 𝐻 Fn (𝑆 × 𝑆))
13	12	fndmd 6637	. . . . 5 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
14	13	dmeqd 5889	. . . 4 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
15		dmxpid 5914	. . . 4 ⊢ dom (𝑆 × 𝑆) = 𝑆
16	14, 15	eqtrdi 2811	. . 3 ⊢ (𝜑 → dom dom 𝐻 = 𝑆)
17	16	reseq2d 5972	. 2 ⊢ (𝜑 → ((1st ‘𝐹) ↾ dom dom 𝐻) = ((1st ‘𝐹) ↾ 𝑆))
18	4, 11, 17	3eqtrd 2799	1 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = ((1st ‘𝐹) ↾ 𝑆))

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  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-rep 5232  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-reu 3366  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-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-resf 17950

This theorem is used by: (None)