Theorem resf1st 17989

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 17987	. . 3 ⊢ (𝜑 → (𝐹 ↾f 𝐻) = ⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩)
4	3	fveq2d 6886	. 2 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = (1st ‘⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩))
5		fvex 6895	. . . 4 ⊢ (1st ‘𝐹) ∈ V
6	5	resex 6026	. . 3 ⊢ ((1st ‘𝐹) ↾ dom dom 𝐻) ∈ V
7		dmexg 7902	. . . 4 ⊢ (𝐻 ∈ 𝑊 → dom 𝐻 ∈ V)
8		mptexg 7224	. . . 4 ⊢ (dom 𝐻 ∈ V → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
9	2, 7, 8	3syl 19	. . 3 ⊢ (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
10		op1stg 8002	. . 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 6641	. . . . 5 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
14	13	dmeqd 5893	. . . 4 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
15		dmxpid 5918	. . . 4 ⊢ dom (𝑆 × 𝑆) = 𝑆
16	14, 15	eqtrdi 2813	. . 3 ⊢ (𝜑 → dom dom 𝐻 = 𝑆)
17	16	reseq2d 5976	. 2 ⊢ (𝜑 → ((1st ‘𝐹) ↾ dom dom 𝐻) = ((1st ‘𝐹) ↾ 𝑆))
18	4, 11, 17	3eqtrd 2801	1 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = ((1st ‘𝐹) ↾ 𝑆))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3453  ⟨cop 4593   ↦ cmpt 5190   × cxp 5657  dom cdm 5659   ↾ cres 5661   Fn wfn 6532  ‘cfv 6537  (class class class)co 7417  1^st c1st 7988  2^nd c2nd 7989   ↾_f cresf 17952

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7740

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-resf 17956

This theorem is used by: (None)