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 49114

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 49112	. 2 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥)))))⟩)
8		eqid 2734	. . . . . . . 8 ⊢ (𝐷 Nat 𝐸) = (𝐷 Nat 𝐸)
9		id 22	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ))
10	8, 9	nat1st2nd 17971	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (⟨(1^st ‘𝑔), (2^nd ‘𝑔)⟩(𝐷 Nat 𝐸)⟨(1^st ‘ℎ), (2^nd ‘ℎ)⟩))
11		eqid 2734	. . . . . . . 8 ⊢ (Base‘𝐷) = (Base‘𝐷)
12	8, 10, 11	natfn 17974	. . . . . . 7 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 Fn (Base‘𝐷))
13		dffn2 6718	. . . . . . 7 ⊢ (𝑎 Fn (Base‘𝐷) ↔ 𝑎:(Base‘𝐷)⟶V)
14	12, 13	sylib 218	. . . . . 6 ⊢ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎:(Base‘𝐷)⟶V)
15		eqid 2734	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘𝐶)
16		relfunc 17879	. . . . . . . 8 ⊢ Rel (𝐶 Func 𝐷)
17		1st2ndbr 8049	. . . . . . . 8 ⊢ ((Rel (𝐶 Func 𝐷) ∧ 𝐹 ∈ (𝐶 Func 𝐷)) → (1^st ‘𝐹)(𝐶 Func 𝐷)(2^nd ‘𝐹))
18	16, 4, 17	sylancr 587	. . . . . . 7 ⊢ (𝜑 → (1^st ‘𝐹)(𝐶 Func 𝐷)(2^nd ‘𝐹))
19	15, 11, 18	funcf1 17883	. . . . . 6 ⊢ (𝜑 → (1^st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷))
20		fcompt 7133	. . . . . 6 ⊢ ((𝑎:(Base‘𝐷)⟶V ∧ (1^st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷)) → (𝑎 ∘ (1^st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥))))
21	14, 19, 20	syl2anr 597	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ)) → (𝑎 ∘ (1^st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥))))
22	21	mpteq2dva 5222	. . . 4 ⊢ (𝜑 → (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹))) = (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥)))))
23	22	mpoeq3dv 7494	. . 3 ⊢ (𝜑 → (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹)))) = (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥))))))
24	23	opeq2d 4860	. 2 ⊢ (𝜑 → ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹))))⟩ = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1^st ‘𝐹)‘𝑥)))))⟩)
25	7, 24	eqtr4d 2772	1 ⊢ (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘_func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1^st ‘𝐹))))⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2107 Vcvv 3463 ⟨cop 4612 class class class wbr 5123 ↦ cmpt 5205 ∘ ccom 5669 Rel wrel 5670 Fn wfn 6536 ⟶wf 6537 ‘cfv 6541 (class class class)co 7413 ∈ cmpo 7415 1^st c1st 7994 2^nd c2nd 7995 Basecbs 17230 Catccat 17679 Func cfunc 17871 ∘_func ccofu 17873 Nat cnat 17961 FuncCat cfuc 17962 curry_F ccurf 18226 swap_Fcswapf 49010 ∘_F cfuco 49061

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5259 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 ax-cnex 11193 ax-resscn 11194 ax-1cn 11195 ax-icn 11196 ax-addcl 11197 ax-addrcl 11198 ax-mulcl 11199 ax-mulrcl 11200 ax-mulcom 11201 ax-addass 11202 ax-mulass 11203 ax-distr 11204 ax-i2m1 11205 ax-1ne0 11206 ax-1rid 11207 ax-rnegex 11208 ax-rrecex 11209 ax-cnre 11210 ax-pre-lttri 11211 ax-pre-lttrn 11212 ax-pre-ltadd 11213 ax-pre-mulgt0 11214

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7870 df-1st 7996 df-2nd 7997 df-frecs 8288 df-wrecs 8319 df-recs 8393 df-rdg 8432 df-1o 8488 df-er 8727 df-map 8850 df-ixp 8920 df-en 8968 df-dom 8969 df-sdom 8970 df-fin 8971 df-pnf 11279 df-mnf 11280 df-xr 11281 df-ltxr 11282 df-le 11283 df-sub 11476 df-neg 11477 df-nn 12249 df-2 12311 df-3 12312 df-4 12313 df-5 12314 df-6 12315 df-7 12316 df-8 12317 df-9 12318 df-n0 12510 df-z 12597 df-dec 12717 df-uz 12861 df-fz 13530 df-struct 17167 df-slot 17202 df-ndx 17214 df-base 17231 df-hom 17298 df-cco 17299 df-cat 17683 df-cid 17684 df-func 17875 df-cofu 17877 df-nat 17963 df-fuc 17964 df-xpc 18188 df-curf 18230 df-swapf 49011 df-fuco 49062

This theorem is referenced by: precofval3 49116

W3C validator