Users' Mathboxes Mathbox for Frédéric Liné < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fmamo Unicode version

Theorem fmamo 25939
Description: A functor is a mapping between morphisms. (Contributed by FL, 10-Feb-2008.)
Hypotheses
Ref Expression
fmamo.1  |-  M1  =  dom  ( dom_ `  T
)
fmamo.2  |-  M 2  =  dom  ( dom_ `  U
)
Assertion
Ref Expression
fmamo  |-  ( ( T  e.  Cat OLD  /\  U  e.  Cat OLD  )  ->  ( F  e.  ( Func OLD `  <. T ,  U >. )  ->  F : M1 --> M 2
) )

Proof of Theorem fmamo
Dummy variables  x  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2296 . . . 4  |-  dom  ( id_ `  T )  =  dom  ( id_ `  T
)
2 fmamo.1 . . . 4  |-  M1  =  dom  ( dom_ `  T
)
3 eqid 2296 . . . 4  |-  ( dom_ `  T )  =  (
dom_ `  T )
4 eqid 2296 . . . 4  |-  ( cod_ `  T )  =  (
cod_ `  T )
5 eqid 2296 . . . 4  |-  ( id_ `  T )  =  ( id_ `  T )
6 eqid 2296 . . . 4  |-  ( o_
`  T )  =  ( o_ `  T
)
7 eqid 2296 . . . 4  |-  dom  ( id_ `  U )  =  dom  ( id_ `  U
)
8 fmamo.2 . . . 4  |-  M 2  =  dom  ( dom_ `  U
)
9 eqid 2296 . . . 4  |-  ( dom_ `  U )  =  (
dom_ `  U )
10 eqid 2296 . . . 4  |-  ( cod_ `  U )  =  (
cod_ `  U )
11 eqid 2296 . . . 4  |-  ( id_ `  U )  =  ( id_ `  U )
12 eqid 2296 . . . 4  |-  ( o_
`  U )  =  ( o_ `  U
)
131, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12isfunb 25938 . . 3  |-  ( ( T  e.  Cat OLD  /\  U  e.  Cat OLD  )  ->  ( F  e.  ( Func OLD `  <. T ,  U >. )  <->  ( F : M1 --> M 2  /\  ( A. z  e. 
dom  ( id_ `  T
) E. w  e. 
dom  ( id_ `  U
) ( F `  ( ( id_ `  T
) `  z )
)  =  ( ( id_ `  U ) `
 w )  /\  ( A. x  e.  M1  ( F `  ( ( id_ `  T ) `
 ( ( dom_ `  T ) `  x
) ) )  =  ( ( id_ `  U
) `  ( ( dom_ `  U ) `  ( F `  x ) ) )  /\  A. x  e.  M1  ( F `
 ( ( id_ `  T ) `  (
( cod_ `  T ) `  x ) ) )  =  ( ( id_ `  U ) `  (
( cod_ `  U ) `  ( F `  x
) ) ) )  /\  A. x  e.  M1  A. y  e.  M1  ( ( ( cod_ `  T ) `  y
)  =  ( (
dom_ `  T ) `  x )  ->  ( F `  ( x
( o_ `  T
) y ) )  =  ( ( F `
 x ) ( o_ `  U ) ( F `  y
) ) ) ) ) ) )
1413simprbda 606 . 2  |-  ( ( ( T  e.  Cat OLD 
/\  U  e.  Cat OLD  )  /\  F  e.  ( Func OLD `  <. T ,  U >. )
)  ->  F : M1
--> M 2 )
1514ex 423 1  |-  ( ( T  e.  Cat OLD  /\  U  e.  Cat OLD  )  ->  ( F  e.  ( Func OLD `  <. T ,  U >. )  ->  F : M1 --> M 2
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696   A.wral 2556   E.wrex 2557   <.cop 3656   dom cdm 4705   -->wf 5267   ` cfv 5271  (class class class)co 5874   dom_cdom_ 25815   cod_ccod_ 25816   id_cid_ 25817   o_co_ 25818    Cat
OLD ccatOLD 25855   Func
OLDcfuncOLD 25934
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-map 6790  df-funcOLD 25936
  Copyright terms: Public domain W3C validator