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

Theorem setccofval 17422
 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 2758 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
41, 2, 3setchomfval 17419 . . 3 (𝜑 → (Hom ‘𝐶) = (𝑥𝑈, 𝑦𝑈 ↦ (𝑦m 𝑥)))
5 eqidd 2759 . . 3 (𝜑 → (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓))) = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓))))
61, 2, 4, 5setcval 17417 . 2 (𝜑𝐶 = {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓)))⟩})
7 catstr 17300 . 2 {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓)))⟩} Struct ⟨1, 15⟩
8 ccoid 16762 . 2 comp = Slot (comp‘ndx)
9 snsstp3 4711 . 2 {⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓)))⟩} ⊆ {⟨(Base‘ndx), 𝑈⟩, ⟨(Hom ‘ndx), (Hom ‘𝐶)⟩, ⟨(comp‘ndx), (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓)))⟩}
102, 2xpexd 7478 . . 3 (𝜑 → (𝑈 × 𝑈) ∈ V)
11 mpoexga 7786 . . 3 (((𝑈 × 𝑈) ∈ V ∧ 𝑈𝑉) → (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓))) ∈ V)
1210, 2, 11syl2anc 587 . 2 (𝜑 → (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓))) ∈ V)
13 setcco.o . 2 · = (comp‘𝐶)
146, 7, 8, 9, 12, 13strfv3 16604 1 (𝜑· = (𝑣 ∈ (𝑈 × 𝑈), 𝑧𝑈 ↦ (𝑔 ∈ (𝑧m (2nd𝑣)), 𝑓 ∈ ((2nd𝑣) ↑m (1st𝑣)) ↦ (𝑔𝑓))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111  Vcvv 3409  {ctp 4529  ⟨cop 4531   × cxp 5526   ∘ ccom 5532  ‘cfv 6340  (class class class)co 7156   ∈ cmpo 7158  1st c1st 7697  2nd c2nd 7698   ↑m cmap 8422  1c1 10589  5c5 11745  ;cdc 12150  ndxcnx 16552  Basecbs 16555  Hom chom 16648  compcco 16649  SetCatcsetc 17415 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5160  ax-sep 5173  ax-nul 5180  ax-pow 5238  ax-pr 5302  ax-un 7465  ax-cnex 10644  ax-resscn 10645  ax-1cn 10646  ax-icn 10647  ax-addcl 10648  ax-addrcl 10649  ax-mulcl 10650  ax-mulrcl 10651  ax-mulcom 10652  ax-addass 10653  ax-mulass 10654  ax-distr 10655  ax-i2m1 10656  ax-1ne0 10657  ax-1rid 10658  ax-rnegex 10659  ax-rrecex 10660  ax-cnre 10661  ax-pre-lttri 10662  ax-pre-lttrn 10663  ax-pre-ltadd 10664  ax-pre-mulgt0 10665 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-nel 3056  df-ral 3075  df-rex 3076  df-reu 3077  df-rab 3079  df-v 3411  df-sbc 3699  df-csb 3808  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-pss 3879  df-nul 4228  df-if 4424  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4802  df-iun 4888  df-br 5037  df-opab 5099  df-mpt 5117  df-tr 5143  df-id 5434  df-eprel 5439  df-po 5447  df-so 5448  df-fr 5487  df-we 5489  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-pred 6131  df-ord 6177  df-on 6178  df-lim 6179  df-suc 6180  df-iota 6299  df-fun 6342  df-fn 6343  df-f 6344  df-f1 6345  df-fo 6346  df-f1o 6347  df-fv 6348  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7586  df-1st 7699  df-2nd 7700  df-wrecs 7963  df-recs 8024  df-rdg 8062  df-1o 8118  df-er 8305  df-en 8541  df-dom 8542  df-sdom 8543  df-fin 8544  df-pnf 10728  df-mnf 10729  df-xr 10730  df-ltxr 10731  df-le 10732  df-sub 10923  df-neg 10924  df-nn 11688  df-2 11750  df-3 11751  df-4 11752  df-5 11753  df-6 11754  df-7 11755  df-8 11756  df-9 11757  df-n0 11948  df-z 12034  df-dec 12151  df-uz 12296  df-fz 12953  df-struct 16557  df-ndx 16558  df-slot 16559  df-base 16561  df-hom 16661  df-cco 16662  df-setc 17416 This theorem is referenced by:  setcco  17423
 Copyright terms: Public domain W3C validator