Theorem precofval2 50446

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 50444	. 2 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))⟩)
8		eqid 2761	. . . . . . . 8 ⊢ (𝐷 Nat 𝐸) = (𝐷 Nat 𝐸)
9		id 23	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ))
10	8, 9	nat1st2nd 18122	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (⟨(1st ‘𝑔), (2nd ‘𝑔)⟩(𝐷 Nat 𝐸)⟨(1st ‘ℎ), (2nd ‘ℎ)⟩))
11		eqid 2761	. . . . . . . 8 ⊢ (Base‘𝐷) = (Base‘𝐷)
12	8, 10, 11	natfn 18125	. . . . . . 7 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 Fn (Base‘𝐷))
13		dffn2 6709	. . . . . . 7 ⊢ (𝑎 Fn (Base‘𝐷) ↔ 𝑎:(Base‘𝐷)⟶V)
14	12, 13	sylib 221	. . . . . 6 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎:(Base‘𝐷)⟶V)
15		eqid 2761	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘𝐶)
16	4	func1st2nd 50153	. . . . . . 7 ⊢ (𝜑 → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
17	15, 11, 16	funcf1 18034	. . . . . 6 ⊢ (𝜑 → (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷))
18		fcompt 7132	. . . . . 6 ⊢ ((𝑎:(Base‘𝐷)⟶V ∧ (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷)) → (𝑎 ∘ (1st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))
19	14, 17, 18	syl2anr 609	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ)) → (𝑎 ∘ (1st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))
20	19	mpteq2dva 5198	. . . 4 ⊢ (𝜑 → (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))) = (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))
21	20	mpoeq3dv 7497	. . 3 ⊢ (𝜑 → (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹)))) = (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))))
22	21	opeq2d 4840	. 2 ⊢ (𝜑 → ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩ = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))⟩)
23	7, 22	eqtr4d 2799	1 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⟨cop 4590   ↦ cmpt 5186   ∘ ccom 5655   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  1^st c1st 7997  2^nd c2nd 7998  Basecbs 17380  Catccat 17831   Func cfunc 18022   ∘_func ccofu 18024   Nat cnat 18112   FuncCat cfuc 18113   curry_F ccurf 18377   swap_F cswapf 50336   ∘_F cfuco 50393

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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-map 8842  df-ixp 8919  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-6 12402  df-7 12403  df-8 12404  df-9 12405  df-n0 12600  df-z 12687  df-dec 12808  df-uz 12959  df-fz 13633  df-struct 17318  df-slot 17353  df-ndx 17365  df-base 17381  df-hom 17445  df-cco 17446  df-cat 17835  df-cid 17836  df-func 18026  df-cofu 18028  df-nat 18114  df-fuc 18115  df-xpc 18339  df-curf 18381  df-swapf 50337  df-fuco 50394

This theorem is used by:  precofval3  50448