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

Theorem setccofval 15256
Description: Composition in the category of sets. (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
setcbas.c  |-  C  =  ( SetCat `  U )
setcbas.u  |-  ( ph  ->  U  e.  V )
setcco.o  |-  .x.  =  (comp `  C )
Assertion
Ref Expression
setccofval  |-  ( ph  ->  .x.  =  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v ) ) ,  f  e.  ( ( 2nd `  v
)  ^m  ( 1st `  v ) )  |->  ( g  o.  f ) ) ) )
Distinct variable groups:    f, g,
v, z, ph    v, U, z
Allowed substitution hints:    C( z, v, f, g)    .x. ( z, v, f, g)    U( f, g)    V( z, v, f, g)

Proof of Theorem setccofval
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 setcbas.c . . 3  |-  C  =  ( SetCat `  U )
2 setcbas.u . . 3  |-  ( ph  ->  U  e.  V )
3 eqid 2460 . . . 4  |-  ( Hom  `  C )  =  ( Hom  `  C )
41, 2, 3setchomfval 15253 . . 3  |-  ( ph  ->  ( Hom  `  C
)  =  ( x  e.  U ,  y  e.  U  |->  ( y  ^m  x ) ) )
5 eqidd 2461 . . 3  |-  ( ph  ->  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v ) ) ,  f  e.  ( ( 2nd `  v )  ^m  ( 1st `  v
) )  |->  ( g  o.  f ) ) )  =  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v ) ) ,  f  e.  ( ( 2nd `  v
)  ^m  ( 1st `  v ) )  |->  ( g  o.  f ) ) ) )
61, 2, 4, 5setcval 15251 . 2  |-  ( ph  ->  C  =  { <. (
Base `  ndx ) ,  U >. ,  <. ( Hom  `  ndx ) ,  ( Hom  `  C
) >. ,  <. (comp ` 
ndx ) ,  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v
) ) ,  f  e.  ( ( 2nd `  v )  ^m  ( 1st `  v ) ) 
|->  ( g  o.  f
) ) ) >. } )
7 catstr 15173 . 2  |-  { <. (
Base `  ndx ) ,  U >. ,  <. ( Hom  `  ndx ) ,  ( Hom  `  C
) >. ,  <. (comp ` 
ndx ) ,  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v
) ) ,  f  e.  ( ( 2nd `  v )  ^m  ( 1st `  v ) ) 
|->  ( g  o.  f
) ) ) >. } Struct  <. 1 , ; 1 5 >.
8 ccoid 14662 . 2  |- comp  = Slot  (comp ` 
ndx )
9 snsstp3 4173 . 2  |-  { <. (comp `  ndx ) ,  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v
) ) ,  f  e.  ( ( 2nd `  v )  ^m  ( 1st `  v ) ) 
|->  ( g  o.  f
) ) ) >. }  C_  { <. ( Base `  ndx ) ,  U >. ,  <. ( Hom  `  ndx ) ,  ( Hom  `  C
) >. ,  <. (comp ` 
ndx ) ,  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v
) ) ,  f  e.  ( ( 2nd `  v )  ^m  ( 1st `  v ) ) 
|->  ( g  o.  f
) ) ) >. }
10 xpexg 6702 . . . 4  |-  ( ( U  e.  V  /\  U  e.  V )  ->  ( U  X.  U
)  e.  _V )
112, 2, 10syl2anc 661 . . 3  |-  ( ph  ->  ( U  X.  U
)  e.  _V )
12 mpt2exga 6849 . . 3  |-  ( ( ( U  X.  U
)  e.  _V  /\  U  e.  V )  ->  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v ) ) ,  f  e.  ( ( 2nd `  v )  ^m  ( 1st `  v
) )  |->  ( g  o.  f ) ) )  e.  _V )
1311, 2, 12syl2anc 661 . 2  |-  ( ph  ->  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v ) ) ,  f  e.  ( ( 2nd `  v )  ^m  ( 1st `  v
) )  |->  ( g  o.  f ) ) )  e.  _V )
14 setcco.o . 2  |-  .x.  =  (comp `  C )
156, 7, 8, 9, 13, 14strfv3 14514 1  |-  ( ph  ->  .x.  =  ( v  e.  ( U  X.  U ) ,  z  e.  U  |->  ( g  e.  ( z  ^m  ( 2nd `  v ) ) ,  f  e.  ( ( 2nd `  v
)  ^m  ( 1st `  v ) )  |->  ( g  o.  f ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1374    e. wcel 1762   _Vcvv 3106   {ctp 4024   <.cop 4026    X. cxp 4990    o. ccom 4996   ` cfv 5579  (class class class)co 6275    |-> cmpt2 6277   1stc1st 6772   2ndc2nd 6773    ^m cmap 7410   1c1 9482   5c5 10577  ;cdc 10965   ndxcnx 14476   Basecbs 14479   Hom chom 14555  compcco 14556   SetCatcsetc 15249
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-rep 4551  ax-sep 4561  ax-nul 4569  ax-pow 4618  ax-pr 4679  ax-un 6567  ax-cnex 9537  ax-resscn 9538  ax-1cn 9539  ax-icn 9540  ax-addcl 9541  ax-addrcl 9542  ax-mulcl 9543  ax-mulrcl 9544  ax-mulcom 9545  ax-addass 9546  ax-mulass 9547  ax-distr 9548  ax-i2m1 9549  ax-1ne0 9550  ax-1rid 9551  ax-rnegex 9552  ax-rrecex 9553  ax-cnre 9554  ax-pre-lttri 9555  ax-pre-lttrn 9556  ax-pre-ltadd 9557  ax-pre-mulgt0 9558
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 969  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-nel 2658  df-ral 2812  df-rex 2813  df-reu 2814  df-rab 2816  df-v 3108  df-sbc 3325  df-csb 3429  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-pss 3485  df-nul 3779  df-if 3933  df-pw 4005  df-sn 4021  df-pr 4023  df-tp 4025  df-op 4027  df-uni 4239  df-int 4276  df-iun 4320  df-br 4441  df-opab 4499  df-mpt 4500  df-tr 4534  df-eprel 4784  df-id 4788  df-po 4793  df-so 4794  df-fr 4831  df-we 4833  df-ord 4874  df-on 4875  df-lim 4876  df-suc 4877  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-rn 5003  df-res 5004  df-ima 5005  df-iota 5542  df-fun 5581  df-fn 5582  df-f 5583  df-f1 5584  df-fo 5585  df-f1o 5586  df-fv 5587  df-riota 6236  df-ov 6278  df-oprab 6279  df-mpt2 6280  df-om 6672  df-1st 6774  df-2nd 6775  df-recs 7032  df-rdg 7066  df-1o 7120  df-oadd 7124  df-er 7301  df-en 7507  df-dom 7508  df-sdom 7509  df-fin 7510  df-pnf 9619  df-mnf 9620  df-xr 9621  df-ltxr 9622  df-le 9623  df-sub 9796  df-neg 9797  df-nn 10526  df-2 10583  df-3 10584  df-4 10585  df-5 10586  df-6 10587  df-7 10588  df-8 10589  df-9 10590  df-10 10591  df-n0 10785  df-z 10854  df-dec 10966  df-uz 11072  df-fz 11662  df-struct 14481  df-ndx 14482  df-slot 14483  df-base 14484  df-hom 14568  df-cco 14569  df-setc 15250
This theorem is referenced by:  setcco  15257
  Copyright terms: Public domain W3C validator