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

Theorem precofval2 50611
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.
StepHypRef 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 ‘ ⚬ )‘𝐹))
71, 2, 3, 4, 5, 6precofval 50609 . 2 (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))⟩)
8 eqid 2760 . . . . . . . 8 (𝐷 Nat 𝐸) = (𝐷 Nat 𝐸)
9 id 23 . . . . . . . . 9 (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ))
108, 9nat1st2nd 18136 . . . . . . . 8 (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 ∈ (⟨(1st ‘𝑔), (2nd ‘𝑔)⟩(𝐷 Nat 𝐸)⟨(1st ‘ℎ), (2nd ‘ℎ)⟩))
11 eqid 2760 . . . . . . . 8 (Base‘𝐷) = (Base‘𝐷)
128, 10, 11natfn 18139 . . . . . . 7 (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎 Fn (Base‘𝐷))
13 dffn2 6714 . . . . . . 7 (𝑎 Fn (Base‘𝐷) ↔ 𝑎:(Base‘𝐷)⟶V)
1412, 13sylib 221 . . . . . 6 (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) → 𝑎:(Base‘𝐷)⟶V)
15 eqid 2760 . . . . . . 7 (Base‘𝐶) = (Base‘𝐶)
164func1st2nd 50297 . . . . . . 7 (𝜑 → (1st ‘𝐹)(𝐶 Func 𝐷)(2nd ‘𝐹))
1715, 11, 16funcf1 18048 . . . . . 6 (𝜑 → (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷))
18 fcompt 7137 . . . . . 6 ((𝑎:(Base‘𝐷)⟶V ∧ (1st ‘𝐹):(Base‘𝐶)⟶(Base‘𝐷)) → (𝑎 ∘ (1st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))
1914, 17, 18syl2anr 609 . . . . 5 ((𝜑 ∧ 𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ)) → (𝑎 ∘ (1st ‘𝐹)) = (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))
2019mpteq2dva 5197 . . . 4 (𝜑 → (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))) = (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))
2120mpoeq3dv 7501 . . 3 (𝜑 → (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹)))) = (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥))))))
2221opeq2d 4846 . 2 (𝜑 → ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩ = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑥 ∈ (Base‘𝐶) ↦ (𝑎‘((1st ‘𝐹)‘𝑥)))))⟩)
237, 22eqtr4d 2798 1 (𝜑 → 𝐾 = ⟨(𝑔 ∈ (𝐷 Func 𝐸) ↦ (𝑔 ∘func 𝐹)), (𝑔 ∈ (𝐷 Func 𝐸), ℎ ∈ (𝐷 Func 𝐸) ↦ (𝑎 ∈ (𝑔(𝐷 Nat 𝐸)ℎ) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ⟨cop 4834   ↦ cmpt 5185   ∘ ccom 5654   Fn wfn 6536  ⟶wf 6537  ‘cfv 6541  (class class class)co 7422   ∈ cmpo 7424  1st c1st 8001  2nd c2nd 8002  Basecbs 17394  Catccat 17845   Func cfunc 18036   ∘func ccofu 18038   Nat cnat 18126   FuncCat cfuc 18127   curryF ccurf 18391   swapF cswapf 50488   ∘F cfuco 50545
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753  ax-cnex 11261  ax-resscn 11262  ax-1cn 11263  ax-icn 11264  ax-addcl 11265  ax-addrcl 11266  ax-mulcl 11267  ax-mulrcl 11268  ax-mulcom 11269  ax-addass 11270  ax-mulass 11271  ax-distr 11272  ax-i2m1 11273  ax-1ne0 11274  ax-1rid 11275  ax-rnegex 11276  ax-rrecex 11277  ax-cnre 11278  ax-pre-lttri 11279  ax-pre-lttrn 11280  ax-pre-ltadd 11281  ax-pre-mulgt0 11282
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7379  df-ov 7425  df-oprab 7426  df-mpo 7427  df-om 7880  df-1st 8003  df-2nd 8004  df-frecs 8304  df-wrecs 8335  df-recs 8384  df-rdg 8423  df-1o 8481  df-er 8722  df-map 8854  df-ixp 8931  df-en 8979  df-dom 8980  df-sdom 8981  df-fin 8982  df-pnf 11350  df-mnf 11351  df-xr 11352  df-ltxr 11353  df-le 11354  df-sub 11548  df-neg 11549  df-nn 12341  df-2 12410  df-3 12411  df-4 12412  df-5 12413  df-6 12414  df-7 12415  df-8 12416  df-9 12417  df-n0 12612  df-z 12699  df-dec 12820  df-uz 12971  df-fz 13645  df-struct 17332  df-slot 17367  df-ndx 17379  df-base 17395  df-hom 17459  df-cco 17460  df-cat 17849  df-cid 17850  df-func 18040  df-cofu 18042  df-nat 18128  df-fuc 18129  df-xpc 18353  df-curf 18395  df-swapf 50489  df-fuco 50546
This theorem is used by:  precofval3  50613
  Copyright terms: Public domain W3C validator