MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  setccofval Structured version   Visualization version   GIF version

Theorem setccofval 18286
Description: Composition in the category of sets. (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
setcbas.c 𝐶 = (SetCat‘𝑈)
setcbas.u (𝜑 → 𝑈 ∈ 𝑉)
setcco.o · = (comp‘𝐶)
Assertion
Ref Expression
setccofval (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
Distinct variable groups:   𝑓,𝑔,𝑣,𝑧,𝜑   𝑣,𝑈,𝑧
Allowed substitution hints:   𝐶(𝑧, 𝑣, 𝑓, 𝑔)   · (𝑧, 𝑣, 𝑓, 𝑔)   𝑈(𝑓, 𝑔)   𝑉(𝑧, 𝑣, 𝑓, 𝑔)

Proof of Theorem setccofval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 setcbas.c . . 3 𝐶 = (SetCat‘𝑈)
2 setcbas.u . . 3 (𝜑 → 𝑈 ∈ 𝑉)
3 eqid 2763 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
41, 2, 3setchomfval 18283 . . 3 (𝜑 → (Hom ‘𝐶) = (𝑥 ∈ 𝑈, 𝑦 ∈ 𝑈 ↦ (𝑦 ↑m 𝑥)))
5 eqidd 2764 . . 3 (𝜑 → (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
61, 2, 4, 5setcval 18281 . 2 (𝜑 → 𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩})
7 catstr 18164 . 2 {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩} Struct ⟨1, 15⟩
8 ccoid 17614 . 2 comp = Slot (comp‘ndx)
9 snsstp3 4777 . 2 {⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩} ⊆ {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓)))⟩}
102, 2xpexd 7789 . . 3 (𝜑 → (𝑈 × 𝑈) ∈ V)
11 mpoexga 8115 . . 3 (((𝑈 × 𝑈) ∈ V ∧ 𝑈 ∈ 𝑉) → (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) ∈ V)
1210, 2, 11syl2anc 596 . 2 (𝜑 → (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))) ∈ V)
13 setcco.o . 2 · = (comp‘𝐶)
146, 7, 8, 9, 12, 13strfv3 17411 1 (𝜑 → · = (𝑣 ∈ (𝑈 × 𝑈), 𝑧 ∈ 𝑈 ↦ (𝑔 ∈ (𝑧 ↑m (2nd ‘𝑣)), 𝑓 ∈ ((2nd ‘𝑣) ↑m (1st ‘𝑣)) ↦ (𝑔 ∘ 𝑓))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {ctp 4592  ⟨cop 4838   × cxp 5653   ∘ ccom 5659  ‘cfv 6558  (class class class)co 7443   ∈ cmpo 7445  1st c1st 8023  2nd c2nd 8024   ↑m cmap 8875  1c1 11228  5c5 12427  cdc 12841  ndxcnx 17400  Basecbs 17416  Hom chom 17468  compcco 17469  SetCatcsetc 18279
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-er 8745  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-nn 12363  df-2 12432  df-3 12433  df-4 12434  df-5 12435  df-6 12436  df-7 12437  df-8 12438  df-9 12439  df-n0 12634  df-z 12721  df-dec 12842  df-uz 12993  df-fz 13667  df-struct 17354  df-slot 17389  df-ndx 17401  df-base 17417  df-hom 17481  df-cco 17482  df-setc 18280
This theorem is used by:  setcco  18287  setc1ocofval  50834
  Copyright terms: Public domain W3C validator