Theorem prcof1 49878

Description: The object part of the pre-composition functor. (Contributed by Zhi Wang, 3-Nov-2025.)

Hypotheses

Ref	Expression
prcof1.k	⊢ (𝜑 → 𝐾 ∈ (𝐷 Func 𝐸))
prcof1.o	⊢ (𝜑 → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = 𝑂)

Assertion

Ref	Expression
prcof1	⊢ (𝜑 → (𝑂‘𝐾) = (𝐾 ∘func 𝐹))

Proof of Theorem prcof1

Dummy variables 𝑎 𝑏 𝑘 𝑙 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prcof1.o	. . . . 5 ⊢ (𝜑 → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = 𝑂)
2	1	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = 𝑂)
3		eqid 2739	. . . . . . 7 ⊢ (𝐷 Func 𝐸) = (𝐷 Func 𝐸)
4		eqid 2739	. . . . . . 7 ⊢ (𝐷 Nat 𝐸) = (𝐷 Nat 𝐸)
5		prcof1.k	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ (𝐷 Func 𝐸))
6	5	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐾 ∈ (𝐷 Func 𝐸))
7	6	func1st2nd 49566	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘𝐾)(𝐷 Func 𝐸)(2nd ‘𝐾))
8	7	funcrcl2 49569	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐷 ∈ Cat)
9	7	funcrcl3 49570	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐸 ∈ Cat)
10		simpr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐹 ∈ V)
11	3, 4, 8, 9, 10	prcofvala 49867	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = ⟨(𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
12	11	fveq2d 6831	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (1st ‘⟨(𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩))
13		ovex 7389	. . . . . . 7 ⊢ (𝐷 Func 𝐸) ∈ V
14	13	mptex 7167	. . . . . 6 ⊢ (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)) ∈ V
15	13, 13	mpoex 8021	. . . . . 6 ⊢ (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹)))) ∈ V
16	14, 15	op1st 7939	. . . . 5 ⊢ (1st ‘⟨(𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩) = (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹))
17	12, 16	eqtrdi 2790	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)))
18	2, 17	eqtr3d 2776	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝑂 = (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)))
19		simpr 485	. . . 4 ⊢ (((𝜑 ∧ 𝐹 ∈ V) ∧ 𝑘 = 𝐾) → 𝑘 = 𝐾)
20	19	oveq1d 7371	. . 3 ⊢ (((𝜑 ∧ 𝐹 ∈ V) ∧ 𝑘 = 𝐾) → (𝑘 ∘func 𝐹) = (𝐾 ∘func 𝐹))
21		ovexd 7391	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (𝐾 ∘func 𝐹) ∈ V)
22	18, 20, 6, 21	fvmptd 6943	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (𝑂‘𝐾) = (𝐾 ∘func 𝐹))
23		0fv 6868	. . 3 ⊢ (∅‘𝐾) = ∅
24		reldmprcof 49865	. . . . . . . 8 ⊢ Rel dom −∘F
25	24	ovprc2 7396	. . . . . . 7 ⊢ (¬ 𝐹 ∈ V → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = ∅)
26	25	fveq2d 6831	. . . . . 6 ⊢ (¬ 𝐹 ∈ V → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (1st ‘∅))
27		1st0 7937	. . . . . 6 ⊢ (1st ‘∅) = ∅
28	26, 27	eqtrdi 2790	. . . . 5 ⊢ (¬ 𝐹 ∈ V → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = ∅)
29	1, 28	sylan9req 2795	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → 𝑂 = ∅)
30	29	fveq1d 6829	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → (𝑂‘𝐾) = (∅‘𝐾))
31		df-cofu 17818	. . . . . 6 ⊢ ∘func = (𝑙 ∈ V, 𝑘 ∈ V ↦ ⟨((1st ‘𝑙) ∘ (1st ‘𝑘)), (𝑎 ∈ dom dom (2nd ‘𝑘), 𝑏 ∈ dom dom (2nd ‘𝑘) ↦ ((((1st ‘𝑘)‘𝑎)(2nd ‘𝑙)((1st ‘𝑘)‘𝑏)) ∘ (𝑎(2nd ‘𝑘)𝑏)))⟩)
32	31	reldmmpo 7490	. . . . 5 ⊢ Rel dom ∘func
33	32	ovprc2 7396	. . . 4 ⊢ (¬ 𝐹 ∈ V → (𝐾 ∘func 𝐹) = ∅)
34	33	adantl 482	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → (𝐾 ∘func 𝐹) = ∅)
35	23, 30, 34	3eqtr4a 2800	. 2 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → (𝑂‘𝐾) = (𝐾 ∘func 𝐹))
36	22, 35	pm2.61dan 818	1 ⊢ (𝜑 → (𝑂‘𝐾) = (𝐾 ∘func 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1547   ∈ wcel 2119  Vcvv 3431  ∅c0 4261  ⟨cop 4561   ↦ cmpt 5153  dom cdm 5618   ∘ ccom 5622  ‘cfv 6485  (class class class)co 7356   ∈ cmpo 7358  1^st c1st 7929  2^nd c2nd 7930  Catccat 17621   Func cfunc 17812   ∘_func ccofu 17814   Nat cnat 17902   −∘_F cprcof 49863

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-func 17816  df-cofu 17818  df-prcof 49864

This theorem is referenced by:  prcofdiag  49884  lanrcl5  50125  ranrcl5  50130  lanup  50131  ranup  50132