precofval2 - Mathbox for Zhi Wang

	Mathbox for Zhi Wang		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > precofval2		Structured version Visualization version GIF version

Theorem precofval2 49358

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	⊢ (𝜑 → ⚬ = (⟨𝑄, 𝑅⟩ curry_F ((⟨𝐶, 𝐷⟩ ∘_F 𝐸) ∘_func (𝑄 swap_F 𝑅))))
precofval.f	⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
precofval.e	⊢ (𝜑 → 𝐸 ∈ Cat)
precofval.k	⊢ (𝜑 → 𝐾 = ((1^st ‘ ⚬ )‘𝐹))

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

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 ⊢ (𝜑 → ⚬ = (⟨𝑄, 𝑅⟩ curry_F ((⟨𝐶, 𝐷⟩ ∘_F 𝐸) ∘_func (𝑄 swap_F 𝑅))))
4		precofval.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
5		precofval.e	. . 3 ⊢ (𝜑 → 𝐸 ∈ Cat)
6		precofval.k	. . 3 ⊢ (𝜑 → 𝐾 = ((1^st ‘ ⚬ )‘𝐹))
7	1, 2, 3, 4, 5, 6	precofval 49356	. 2 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥)))))⟩)
8		eqid 2729	. . . . . . . 8 ⊢ (𝐷 Nat 𝐸) = (𝐷 Nat 𝐸)
9		id 22	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ))
10	8, 9	nat1st2nd 17916	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (⟨(1^st ‘𝑔), (2^nd ‘𝑔)⟩(𝐷 Nat 𝐸)⟨(1^st ‘ℎ), (2^nd ‘ℎ)⟩))
11		eqid 2729	. . . . . . . 8 ⊢ (Base‘𝐷) = (Base‘𝐷)
12	8, 10, 11	natfn 17919	. . . . . . 7 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 Fn (Base‘𝐷))
13		dffn2 6690	. . . . . . 7 ⊢ (𝑎 Fn (Base‘𝐷) ↔ 𝑎:(Base‘𝐷)⟶V)
14	12, 13	sylib 218	. . . . . 6 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎:(Base‘𝐷)⟶V)
15		eqid 2729	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘𝐶)
16	4	func1st2nd 49065	. . . . . . 7 ⊢ (𝜑 → (1^st ‘𝐹)(𝐶 Func 𝐷)(2^nd ‘𝐹))
17	15, 11, 16	funcf1 17828	. . . . . 6 ⊢ (𝜑 → (1^st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷))
18		fcompt 7105	. . . . . 6 ⊢ ((𝑎:(Base‘𝐷)⟶V ∧ (1^st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷)) → (𝑎 ∘ (1^st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥))))
19	14, 17, 18	syl2anr 597	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ)) → (𝑎 ∘ (1^st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥))))
20	19	mpteq2dva 5200	. . . 4 ⊢ (𝜑 → (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹))) = (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥)))))
21	20	mpoeq3dv 7468	. . 3 ⊢ (𝜑 → (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹)))) = (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥))))))
22	21	opeq2d 4844	. 2 ⊢ (𝜑 → ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹))))⟩ = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥)))))⟩)
23	7, 22	eqtr4d 2767	1 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹))))⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3447 ⟨cop 4595 ↦ cmpt 5188 ∘ ccom 5642 Fn wfn 6506 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 ∈ cmpo 7389 1^st c1st 7966 2^nd c2nd 7967 Basecbs 17179 Catccat 17625 Func cfunc 17816 ∘_func ccofu 17818 Nat cnat 17906 FuncCat cfuc 17907 curry_F ccurf 18171 swap_F cswapf 49248 ∘_F cfuco 49305

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-map 8801 df-ixp 8871 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-7 12254 df-8 12255 df-9 12256 df-n0 12443 df-z 12530 df-dec 12650 df-uz 12794 df-fz 13469 df-struct 17117 df-slot 17152 df-ndx 17164 df-base 17180 df-hom 17244 df-cco 17245 df-cat 17629 df-cid 17630 df-func 17820 df-cofu 17822 df-nat 17908 df-fuc 17909 df-xpc 18133 df-curf 18175 df-swapf 49249 df-fuco 49306

This theorem is referenced by: precofval3 49360

W3C validator