Theorem prcof1 50186

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 485	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = 𝑂)
3		eqid 2763	. . . . . . 7 ⊢ (𝐷 Func 𝐸) = (𝐷 Func 𝐸)
4		eqid 2763	. . . . . . 7 ⊢ (𝐷 Nat 𝐸) = (𝐷 Nat 𝐸)
5		prcof1.k	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ (𝐷 Func 𝐸))
6	5	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐾 ∈ (𝐷 Func 𝐸))
7	6	func1st2nd 49874	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘𝐾)(𝐷 Func 𝐸)(2nd ‘𝐾))
8	7	funcrcl2 49877	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐷 ∈ Cat)
9	7	funcrcl3 49878	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐸 ∈ Cat)
10		simpr 489	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝐹 ∈ V)
11	3, 4, 8, 9, 10	prcofvala 50175	. . . . . 6 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = ⟨(𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
12	11	fveq2d 6885	. . . . 5 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (1st ‘⟨(𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩))
13		ovex 7443	. . . . . . 7 ⊢ (𝐷 Func 𝐸) ∈ V
14	13	mptex 7221	. . . . . 6 ⊢ (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)) ∈ V
15	13, 13	mpoex 8072	. . . . . 6 ⊢ (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹)))) ∈ V
16	14, 15	op1st 7990	. . . . 5 ⊢ (1st ‘⟨(𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ (𝐷 Func 𝐸), 𝑙 ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑘(𝐷 Nat 𝐸)𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩) = (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹))
17	12, 16	eqtrdi 2814	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)))
18	2, 17	eqtr3d 2800	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → 𝑂 = (𝑘 ∈ (𝐷 Func 𝐸) ↦ (𝑘 ∘func 𝐹)))
19		simpr 489	. . . 4 ⊢ (((𝜑 ∧ 𝐹 ∈ V) ∧ 𝑘 = 𝐾) → 𝑘 = 𝐾)
20	19	oveq1d 7425	. . 3 ⊢ (((𝜑 ∧ 𝐹 ∈ V) ∧ 𝑘 = 𝐾) → (𝑘 ∘func 𝐹) = (𝐾 ∘func 𝐹))
21		ovexd 7445	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (𝐾 ∘func 𝐹) ∈ V)
22	18, 20, 6, 21	fvmptd 6997	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ V) → (𝑂‘𝐾) = (𝐾 ∘func 𝐹))
23		0fv 6922	. . 3 ⊢ (∅‘𝐾) = ∅
24		reldmprcof 50173	. . . . . . . 8 ⊢ Rel dom −∘F
25	24	ovprc2 7450	. . . . . . 7 ⊢ (¬ 𝐹 ∈ V → (⟨𝐷, 𝐸⟩ −∘F 𝐹) = ∅)
26	25	fveq2d 6885	. . . . . 6 ⊢ (¬ 𝐹 ∈ V → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = (1st ‘∅))
27		1st0 7988	. . . . . 6 ⊢ (1st ‘∅) = ∅
28	26, 27	eqtrdi 2814	. . . . 5 ⊢ (¬ 𝐹 ∈ V → (1st ‘(⟨𝐷, 𝐸⟩ −∘F 𝐹)) = ∅)
29	1, 28	sylan9req 2819	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → 𝑂 = ∅)
30	29	fveq1d 6883	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → (𝑂‘𝐾) = (∅‘𝐾))
31		df-cofu 17912	. . . . . 6 ⊢ ∘func = (𝑙 ∈ V, 𝑘 ∈ V ↦ ⟨((1st ‘𝑙) ∘ (1st ‘𝑘)), (𝑎 ∈ dom dom (2nd ‘𝑘), 𝑏 ∈ dom dom (2nd ‘𝑘) ↦ ((((1st ‘𝑘)‘𝑎)(2nd ‘𝑙)((1st ‘𝑘)‘𝑏)) ∘ (𝑎(2nd ‘𝑘)𝑏)))⟩)
32	31	reldmmpo 7544	. . . . 5 ⊢ Rel dom ∘func
33	32	ovprc2 7450	. . . 4 ⊢ (¬ 𝐹 ∈ V → (𝐾 ∘func 𝐹) = ∅)
34	33	adantl 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → (𝐾 ∘func 𝐹) = ∅)
35	23, 30, 34	3eqtr4a 2824	. 2 ⊢ ((𝜑 ∧ ¬ 𝐹 ∈ V) → (𝑂‘𝐾) = (𝐾 ∘func 𝐹))
36	22, 35	pm2.61dan 824	1 ⊢ (𝜑 → (𝑂‘𝐾) = (𝐾 ∘func 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  Vcvv 3455  ∅c0 4286  ⟨cop 4595   ↦ cmpt 5192  dom cdm 5661   ∘ ccom 5665  ‘cfv 6536  (class class class)co 7410   ∈ cmpo 7412  1^st c1st 7980  2^nd c2nd 7981  Catccat 17715   Func cfunc 17906   ∘_func ccofu 17908   Nat cnat 17996   −∘_F cprcof 50171

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-func 17910  df-cofu 17912  df-prcof 50172

This theorem is referenced by:  prcofdiag  50192  lanrcl5  50433  ranrcl5  50438  lanup  50439  ranup  50440