Theorem resf1st 18075

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 18073	. . 3 ⊢ (𝜑 → (𝐹 ↾f 𝐻) = ⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩)
4	3	fveq2d 6890	. 2 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = (1st ‘⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩))
5		fvex 6899	. . . 4 ⊢ (1st ‘𝐹) ∈ V
6	5	resex 6017	. . 3 ⊢ ((1st ‘𝐹) ↾ dom dom 𝐻) ∈ V
7		dmexg 7914	. . . 4 ⊢ (𝐻 ∈ 𝑊 → dom 𝐻 ∈ V)
8		mptexg 7228	. . . 4 ⊢ (dom 𝐻 ∈ V → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
9	2, 7, 8	3syl 19	. . 3 ⊢ (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
10		op1stg 8014	. . 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 6645	. . . . 5 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
14	13	dmeqd 5886	. . . 4 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
15		dmxpid 5911	. . . 4 ⊢ dom (𝑆 × 𝑆) = 𝑆
16	14, 15	eqtrdi 2811	. . 3 ⊢ (𝜑 → dom dom 𝐻 = 𝑆)
17	16	reseq2d 5969	. 2 ⊢ (𝜑 → ((1st ‘𝐹) ↾ dom dom 𝐻) = ((1st ‘𝐹) ↾ 𝑆))
18	4, 11, 17	3eqtrd 2799	1 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = ((1st ‘𝐹) ↾ 𝑆))

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ⟨cop 4834   ↦ cmpt 5185   × cxp 5648  dom cdm 5650   ↾ cres 5652   Fn wfn 6534  ‘cfv 6539  (class class class)co 7421  1^st c1st 8000  2^nd c2nd 8001   ↾_f cresf 18038

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-resf 18042

This theorem is used by: (None)