Theorem resf1st 18119

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 18117	. . 3 ⊢ (𝜑 → (𝐹 ↾f 𝐻) = ⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩)
4	3	fveq2d 6920	. 2 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = (1st ‘⟨((1st ‘𝐹) ↾ dom dom 𝐻), (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧)))⟩))
5		fvex 6929	. . . 4 ⊢ (1st ‘𝐹) ∈ V
6	5	resex 6036	. . 3 ⊢ ((1st ‘𝐹) ↾ dom dom 𝐻) ∈ V
7		dmexg 7947	. . . 4 ⊢ (𝐻 ∈ 𝑊 → dom 𝐻 ∈ V)
8		mptexg 7258	. . . 4 ⊢ (dom 𝐻 ∈ V → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
9	2, 7, 8	3syl 19	. . 3 ⊢ (𝜑 → (𝑧 ∈ dom 𝐻 ↦ (((2nd ‘𝐹)‘𝑧) ↾ (𝐻‘𝑧))) ∈ V)
10		op1stg 8047	. . 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 6674	. . . . 5 ⊢ (𝜑 → dom 𝐻 = (𝑆 × 𝑆))
14	13	dmeqd 5899	. . . 4 ⊢ (𝜑 → dom dom 𝐻 = dom (𝑆 × 𝑆))
15		dmxpid 5924	. . . 4 ⊢ dom (𝑆 × 𝑆) = 𝑆
16	14, 15	eqtrdi 2814	. . 3 ⊢ (𝜑 → dom dom 𝐻 = 𝑆)
17	16	reseq2d 5986	. 2 ⊢ (𝜑 → ((1st ‘𝐹) ↾ dom dom 𝐻) = ((1st ‘𝐹) ↾ 𝑆))
18	4, 11, 17	3eqtrd 2802	1 ⊢ (𝜑 → (1st ‘(𝐹 ↾f 𝐻)) = ((1st ‘𝐹) ↾ 𝑆))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4840   ↦ cmpt 5192   × cxp 5656  dom cdm 5658   ↾ cres 5660   Fn wfn 6561  ‘cfv 6566  (class class class)co 7451  1^st c1st 8033  2^nd c2nd 8034   ↾_f cresf 18082

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-resf 18086

This theorem is used by: (None)