Theorem precofval2 50180

Description: Value of the pre-composition functor as a transposed curry of the functor composition bifunctor. (Contributed by Zhi Wang, 11-Oct-2025.)

Hypotheses

Ref	Expression
precofval.q	⊢ 𝑄 = (𝐶 FuncCat 𝐷)
precofval.r	⊢ 𝑅 = (𝐷 FuncCat 𝐸)
precofval.o	⊢ (𝜑 → ⚬ = (⟨𝑄, 𝑅⟩ curryF ((⟨𝐶, 𝐷⟩ ∘F 𝐸) ∘func (𝑄 swapF 𝑅))))
precofval.f	⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
precofval.e	⊢ (𝜑 → 𝐸 ∈ Cat)
precofval.k	⊢ (𝜑 → 𝐾 = ((1st ‘ ⚬ )‘𝐹))

Assertion

Ref	Expression
precofval2	⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)

Distinct variable groups:   𝐶,𝑎,𝑔,ℎ   𝐷,𝑎,𝑔,ℎ   𝐸,𝑎,𝑔,ℎ   𝐹,𝑎,𝑔,ℎ   𝑄,𝑎,𝑔,ℎ   𝑅,𝑎,𝑔,ℎ   𝜑,𝑎,𝑔,ℎ

Allowed substitution hints:   𝐾(𝑔, ℎ, 𝑎)   ⚬ (𝑔, ℎ, 𝑎)

Proof of Theorem precofval2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		precofval.q	. . 3 ⊢ 𝑄 = (𝐶 FuncCat 𝐷)
2		precofval.r	. . 3 ⊢ 𝑅 = (𝐷 FuncCat 𝐸)
3		precofval.o	. . 3 ⊢ (𝜑 → ⚬ = (⟨𝑄, 𝑅⟩ curryF ((⟨𝐶, 𝐷⟩ ∘F 𝐸) ∘func (𝑄 swapF 𝑅))))
4		precofval.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
5		precofval.e	. . 3 ⊢ (𝜑 → 𝐸 ∈ Cat)
6		precofval.k	. . 3 ⊢ (𝜑 → 𝐾 = ((1st ‘ ⚬ )‘𝐹))
7	1, 2, 3, 4, 5, 6	precofval 50178	. 2 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))⟩)
8		eqid 2765	. . . . . . . 8 ⊢ (𝐷 Nat 𝐸) = (𝐷 Nat 𝐸)
9		id 23	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ))
10	8, 9	nat1st2nd 18029	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (⟨(1st ‘𝑔), (2nd ‘𝑔)⟩(𝐷 Nat 𝐸)⟨(1st ‘ℎ), (2nd ‘ℎ)⟩))
11		eqid 2765	. . . . . . . 8 ⊢ (Base‘𝐷) = (Base‘𝐷)
12	8, 10, 11	natfn 18032	. . . . . . 7 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 Fn (Base‘𝐷))
13		dffn2 6711	. . . . . . 7 ⊢ (𝑎 Fn (Base‘𝐷) ↔ 𝑎:(Base‘𝐷)⟶V)
14	12, 13	sylib 221	. . . . . 6 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎:(Base‘𝐷)⟶V)
15		eqid 2765	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘𝐶)
16	4	func1st2nd 49887	. . . . . . 7 ⊢ (𝜑 → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
17	15, 11, 16	funcf1 17941	. . . . . 6 ⊢ (𝜑 → (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷))
18		fcompt 7133	. . . . . 6 ⊢ ((𝑎:(Base‘𝐷)⟶V ∧ (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷)) → (𝑎 ∘ (1st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))
19	14, 17, 18	syl2anr 609	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ)) → (𝑎 ∘ (1st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))
20	19	mpteq2dva 5206	. . . 4 ⊢ (𝜑 → (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))) = (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))
21	20	mpoeq3dv 7495	. . 3 ⊢ (𝜑 → (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹)))) = (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))))
22	21	opeq2d 4847	. 2 ⊢ (𝜑 → ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩ = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))⟩)
23	7, 22	eqtr4d 2803	1 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  Vcvv 3457  ⟨cop 4597   ↦ cmpt 5194   ∘ ccom 5667   Fn wfn 6535  ⟶wf 6536  ‘cfv 6540  (class class class)co 7416   ∈ cmpo 7418  1^st c1st 7986  2^nd c2nd 7987  Basecbs 17287  Catccat 17738   Func cfunc 17929   ∘_func ccofu 17931   Nat cnat 18019   FuncCat cfuc 18020   curry_F ccurf 18284   swap_F cswapf 50070   ∘_F cfuco 50127

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 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187  ax-pre-mulgt0 11188

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-er 8696  df-map 8828  df-ixp 8898  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-sub 11454  df-neg 11455  df-nn 12245  df-2 12314  df-3 12315  df-4 12316  df-5 12317  df-6 12318  df-7 12319  df-8 12320  df-9 12321  df-n0 12516  df-z 12603  df-dec 12724  df-uz 12875  df-fz 13548  df-struct 17225  df-slot 17260  df-ndx 17272  df-base 17288  df-hom 17352  df-cco 17353  df-cat 17742  df-cid 17743  df-func 17933  df-cofu 17935  df-nat 18021  df-fuc 18022  df-xpc 18246  df-curf 18288  df-swapf 50071  df-fuco 50128

This theorem is used by:  precofval3  50182