Theorem rescofuf 49912

Description: The restriction of functor composition is a function from product functor space to functor space. (Contributed by Zhi Wang, 25-Sep-2025.)

Assertion

Ref	Expression
rescofuf	⊢ ( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))):((𝐷 Func 𝐸) × (𝐶 Func 𝐷))⟶(𝐶 Func 𝐸)

Proof of Theorem rescofuf

Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3462	. . . . 5 ⊢ 𝑔 ∈ V
2		vex 3462	. . . . 5 ⊢ 𝑓 ∈ V
3		opex 5450	. . . . 5 ⊢ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩ ∈ V
4		df-cofu 17942	. . . . . 6 ⊢ ∘func = (𝑔 ∈ V, 𝑓 ∈ V ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩)
5	4	ovmpt4g 7570	. . . . 5 ⊢ ((𝑔 ∈ V ∧ 𝑓 ∈ V ∧ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩ ∈ V) → (𝑔 ∘func 𝑓) = ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩)
6	1, 2, 3, 5	mp3an 1490	. . . 4 ⊢ (𝑔 ∘func 𝑓) = ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩
7		simpr 490	. . . . 5 ⊢ ((𝑔 ∈ (𝐷 Func 𝐸) ∧ 𝑓 ∈ (𝐶 Func 𝐷)) → 𝑓 ∈ (𝐶 Func 𝐷))
8		simpl 488	. . . . 5 ⊢ ((𝑔 ∈ (𝐷 Func 𝐸) ∧ 𝑓 ∈ (𝐶 Func 𝐷)) → 𝑔 ∈ (𝐷 Func 𝐸))
9	7, 8	cofucl 17970	. . . 4 ⊢ ((𝑔 ∈ (𝐷 Func 𝐸) ∧ 𝑓 ∈ (𝐶 Func 𝐷)) → (𝑔 ∘func 𝑓) ∈ (𝐶 Func 𝐸))
10	6, 9	eqeltrrid 2871	. . 3 ⊢ ((𝑔 ∈ (𝐷 Func 𝐸) ∧ 𝑓 ∈ (𝐶 Func 𝐷)) → ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩ ∈ (𝐶 Func 𝐸))
11	10	rgen2 3208	. 2 ⊢ ∀𝑔 ∈ (𝐷 Func 𝐸)∀𝑓 ∈ (𝐶 Func 𝐷)⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩ ∈ (𝐶 Func 𝐸)
12	4	reseq1i 5979	. . . 4 ⊢ ( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))) = ((𝑔 ∈ V, 𝑓 ∈ V ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩) ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)))
13		ssv 3964	. . . . 5 ⊢ (𝐷 Func 𝐸) ⊆ V
14		ssv 3964	. . . . 5 ⊢ (𝐶 Func 𝐷) ⊆ V
15		resmpo 7543	. . . . 5 ⊢ (((𝐷 Func 𝐸) ⊆ V ∧ (𝐶 Func 𝐷) ⊆ V) → ((𝑔 ∈ V, 𝑓 ∈ V ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩) ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))) = (𝑔 ∈ (𝐷 Func 𝐸), 𝑓 ∈ (𝐶 Func 𝐷) ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩))
16	13, 14, 15	mp2an 705	. . . 4 ⊢ ((𝑔 ∈ V, 𝑓 ∈ V ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩) ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))) = (𝑔 ∈ (𝐷 Func 𝐸), 𝑓 ∈ (𝐶 Func 𝐷) ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩)
17	12, 16	eqtri 2789	. . 3 ⊢ ( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))) = (𝑔 ∈ (𝐷 Func 𝐸), 𝑓 ∈ (𝐶 Func 𝐷) ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩)
18	17	fmpo 8074	. 2 ⊢ (∀𝑔 ∈ (𝐷 Func 𝐸)∀𝑓 ∈ (𝐶 Func 𝐷)⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩ ∈ (𝐶 Func 𝐸) ↔ ( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))):((𝐷 Func 𝐸) × (𝐶 Func 𝐷))⟶(𝐶 Func 𝐸))
19	11, 18	mpbi 233	1 ⊢ ( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))):((𝐷 Func 𝐸) × (𝐶 Func 𝐷))⟶(𝐶 Func 𝐸)

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3082  Vcvv 3458   ⊆ wss 3908  ⟨cop 4600   × cxp 5664  dom cdm 5666   ↾ cres 5668   ∘ ccom 5670  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425  1^st c1st 7993  2^nd c2nd 7994   Func cfunc 17936   ∘_func ccofu 17938

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-map 8835  df-ixp 8905  df-cat 17749  df-cid 17750  df-func 17940  df-cofu 17942

This theorem is used by:  fucof1  50141  fucofvalne  50144