Theorem prcofvalg 50303

Description: Value of the pre-composition functor. (Contributed by Zhi Wang, 2-Nov-2025.)

Hypotheses

Ref	Expression
prcofvalg.b	⊢ 𝐵 = (𝐷 Func 𝐸)
prcofvalg.n	⊢ 𝑁 = (𝐷 Nat 𝐸)
prcofvalg.f	⊢ (𝜑 → 𝐹 ∈ 𝑈)
prcofvalg.p	⊢ (𝜑 → 𝑃 ∈ 𝑉)
prcofvalg.d	⊢ (𝜑 → (1st ‘𝑃) = 𝐷)
prcofvalg.e	⊢ (𝜑 → (2nd ‘𝑃) = 𝐸)

Assertion

Ref	Expression
prcofvalg	⊢ (𝜑 → (𝑃 −∘F 𝐹) = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)

Distinct variable groups:   𝐵,𝑎,𝑘,𝑙   𝐷,𝑎,𝑘,𝑙   𝐸,𝑎,𝑘,𝑙   𝐹,𝑎,𝑘,𝑙   𝑃,𝑎,𝑘,𝑙   𝜑,𝑎,𝑘,𝑙

Allowed substitution hints:   𝑈(𝑘, 𝑎, 𝑙)   𝑁(𝑘, 𝑎, 𝑙)   𝑉(𝑘, 𝑎, 𝑙)

Proof of Theorem prcofvalg

Dummy variables 𝑏 𝑑 𝑒 𝑓 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-prcof 50301	. . 3 ⊢ −∘F = (𝑝 ∈ V, 𝑓 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑑⦌⦋(2nd ‘𝑝) / 𝑒⦌⦋(𝑑 Func 𝑒) / 𝑏⦌⟨(𝑘 ∈ 𝑏 ↦ (𝑘 ∘func 𝑓)), (𝑘 ∈ 𝑏, 𝑙 ∈ 𝑏 ↦ (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓))))⟩)
2	1	a1i 11	. 2 ⊢ (𝜑 → −∘F = (𝑝 ∈ V, 𝑓 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑑⦌⦋(2nd ‘𝑝) / 𝑒⦌⦋(𝑑 Func 𝑒) / 𝑏⦌⟨(𝑘 ∈ 𝑏 ↦ (𝑘 ∘func 𝑓)), (𝑘 ∈ 𝑏, 𝑙 ∈ 𝑏 ↦ (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓))))⟩))
3		fvexd 6894	. . 3 ⊢ ((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) → (1st ‘𝑝) ∈ V)
4		simprl 783	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) → 𝑝 = 𝑃)
5	4	fveq2d 6883	. . . 4 ⊢ ((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) → (1st ‘𝑝) = (1st ‘𝑃))
6		prcofvalg.d	. . . . 5 ⊢ (𝜑 → (1st ‘𝑃) = 𝐷)
7	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) → (1st ‘𝑃) = 𝐷)
8	5, 7	eqtrd 2795	. . 3 ⊢ ((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) → (1st ‘𝑝) = 𝐷)
9		fvexd 6894	. . . 4 ⊢ (((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) → (2nd ‘𝑝) ∈ V)
10	4	adantr 486	. . . . . 6 ⊢ (((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) → 𝑝 = 𝑃)
11	10	fveq2d 6883	. . . . 5 ⊢ (((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) → (2nd ‘𝑝) = (2nd ‘𝑃))
12		prcofvalg.e	. . . . . 6 ⊢ (𝜑 → (2nd ‘𝑃) = 𝐸)
13	12	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) → (2nd ‘𝑃) = 𝐸)
14	11, 13	eqtrd 2795	. . . 4 ⊢ (((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) → (2nd ‘𝑝) = 𝐸)
15		ovexd 7449	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → (𝑑 Func 𝑒) ∈ V)
16		simplr 781	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → 𝑑 = 𝐷)
17		simpr 490	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → 𝑒 = 𝐸)
18	16, 17	oveq12d 7432	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → (𝑑 Func 𝑒) = (𝐷 Func 𝐸))
19		prcofvalg.b	. . . . . 6 ⊢ 𝐵 = (𝐷 Func 𝐸)
20	18, 19	eqtr4di 2813	. . . . 5 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → (𝑑 Func 𝑒) = 𝐵)
21		simpr 490	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
22		simp-4r 796	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (𝑝 = 𝑃 ∧ 𝑓 = 𝐹))
23	22	simprd 501	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → 𝑓 = 𝐹)
24	23	oveq2d 7430	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (𝑘 ∘func 𝑓) = (𝑘 ∘func 𝐹))
25	21, 24	mpteq12dv 5192	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (𝑘 ∈ 𝑏 ↦ (𝑘 ∘func 𝑓)) = (𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)))
26	16, 17	oveq12d 7432	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → (𝑑 Nat 𝑒) = (𝐷 Nat 𝐸))
27		prcofvalg.n	. . . . . . . . . 10 ⊢ 𝑁 = (𝐷 Nat 𝐸)
28	26, 27	eqtr4di 2813	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → (𝑑 Nat 𝑒) = 𝑁)
29	28	oveqdr 7442	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (𝑘(𝑑 Nat 𝑒)𝑙) = (𝑘𝑁𝑙))
30	23	fveq2d 6883	. . . . . . . . 9 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (1st ‘𝑓) = (1st ‘𝐹))
31	30	coeq2d 5842	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (𝑎 ∘ (1st ‘𝑓)) = (𝑎 ∘ (1st ‘𝐹)))
32	29, 31	mpteq12dv 5192	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓))) = (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))
33	21, 21, 32	mpoeq123dv 7489	. . . . . 6 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → (𝑘 ∈ 𝑏, 𝑙 ∈ 𝑏 ↦ (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓)))) = (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹)))))
34	25, 33	opeq12d 4841	. . . . 5 ⊢ (((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) ∧ 𝑏 = 𝐵) → ⟨(𝑘 ∈ 𝑏 ↦ (𝑘 ∘func 𝑓)), (𝑘 ∈ 𝑏, 𝑙 ∈ 𝑏 ↦ (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓))))⟩ = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
35	15, 20, 34	csbied2 3884	. . . 4 ⊢ ((((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) ∧ 𝑒 = 𝐸) → ⦋(𝑑 Func 𝑒) / 𝑏⦌⟨(𝑘 ∈ 𝑏 ↦ (𝑘 ∘func 𝑓)), (𝑘 ∈ 𝑏, 𝑙 ∈ 𝑏 ↦ (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓))))⟩ = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
36	9, 14, 35	csbied2 3884	. . 3 ⊢ (((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) ∧ 𝑑 = 𝐷) → ⦋(2nd ‘𝑝) / 𝑒⦌⦋(𝑑 Func 𝑒) / 𝑏⦌⟨(𝑘 ∈ 𝑏 ↦ (𝑘 ∘func 𝑓)), (𝑘 ∈ 𝑏, 𝑙 ∈ 𝑏 ↦ (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓))))⟩ = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
37	3, 8, 36	csbied2 3884	. 2 ⊢ ((𝜑 ∧ (𝑝 = 𝑃 ∧ 𝑓 = 𝐹)) → ⦋(1st ‘𝑝) / 𝑑⦌⦋(2nd ‘𝑝) / 𝑒⦌⦋(𝑑 Func 𝑒) / 𝑏⦌⟨(𝑘 ∈ 𝑏 ↦ (𝑘 ∘func 𝑓)), (𝑘 ∈ 𝑏, 𝑙 ∈ 𝑏 ↦ (𝑎 ∈ (𝑘(𝑑 Nat 𝑒)𝑙) ↦ (𝑎 ∘ (1st ‘𝑓))))⟩ = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
38		prcofvalg.p	. . 3 ⊢ (𝜑 → 𝑃 ∈ 𝑉)
39	38	elexd 3473	. 2 ⊢ (𝜑 → 𝑃 ∈ V)
40		prcofvalg.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑈)
41	40	elexd 3473	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
42		opex 5439	. . 3 ⊢ ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩ ∈ V
43	42	a1i 11	. 2 ⊢ (𝜑 → ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩ ∈ V)
44	2, 37, 39, 41, 43	ovmpod 7566	1 ⊢ (𝜑 → (𝑃 −∘F 𝐹) = ⟨(𝑘 ∈ 𝐵 ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ 𝐵, 𝑙 ∈ 𝐵 ↦ (𝑎 ∈ (𝑘𝑁𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ⦋csb 3847  ⟨cop 4590   ↦ cmpt 5186   ∘ ccom 5659  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416  1^st c1st 7985  2^nd c2nd 7986   Func cfunc 17944   ∘_func ccofu 17946   Nat cnat 18034   −∘_F cprcof 50300

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 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-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-prcof 50301

This theorem is used by:  prcofvala  50304  prcofelvv  50307  reldmprcof1  50308  reldmprcof2  50309