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

Theorem fullfunc 13796
Description: A full functor is a functor. (Contributed by Mario Carneiro, 26-Jan-2017.)
Assertion
Ref Expression
fullfunc  |-  ( C Full 
D )  C_  ( C  Func  D )

Proof of Theorem fullfunc
Dummy variables  c 
d  f  g  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 5881 . . . 4  |-  ( c  =  C  ->  (
c Full  d )  =  ( C Full  d ) )
2 oveq1 5881 . . . 4  |-  ( c  =  C  ->  (
c  Func  d )  =  ( C  Func  d ) )
31, 2sseq12d 3220 . . 3  |-  ( c  =  C  ->  (
( c Full  d ) 
C_  ( c  Func  d )  <->  ( C Full  d
)  C_  ( C  Func  d ) ) )
4 oveq2 5882 . . . 4  |-  ( d  =  D  ->  ( C Full  d )  =  ( C Full  D ) )
5 oveq2 5882 . . . 4  |-  ( d  =  D  ->  ( C  Func  d )  =  ( C  Func  D
) )
64, 5sseq12d 3220 . . 3  |-  ( d  =  D  ->  (
( C Full  d )  C_  ( C  Func  d
)  <->  ( C Full  D
)  C_  ( C  Func  D ) ) )
7 ovex 5899 . . . . . 6  |-  ( c 
Func  d )  e. 
_V
8 simpl 443 . . . . . . . 8  |-  ( ( f ( c  Func  d ) g  /\  A. x  e.  ( Base `  c ) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) )  ->  f (
c  Func  d )
g )
98ssopab2i 4308 . . . . . . 7  |-  { <. f ,  g >.  |  ( f ( c  Func  d ) g  /\  A. x  e.  ( Base `  c ) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) ) }  C_  { <. f ,  g >.  |  f ( c  Func  d
) g }
10 opabss 4096 . . . . . . 7  |-  { <. f ,  g >.  |  f ( c  Func  d
) g }  C_  ( c  Func  d
)
119, 10sstri 3201 . . . . . 6  |-  { <. f ,  g >.  |  ( f ( c  Func  d ) g  /\  A. x  e.  ( Base `  c ) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) ) }  C_  (
c  Func  d )
127, 11ssexi 4175 . . . . 5  |-  { <. f ,  g >.  |  ( f ( c  Func  d ) g  /\  A. x  e.  ( Base `  c ) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) ) }  e.  _V
13 df-full 13794 . . . . . 6  |- Full  =  ( c  e.  Cat , 
d  e.  Cat  |->  {
<. f ,  g >.  |  ( f ( c  Func  d )
g  /\  A. x  e.  ( Base `  c
) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) ) } )
1413ovmpt4g 5986 . . . . 5  |-  ( ( c  e.  Cat  /\  d  e.  Cat  /\  { <. f ,  g >.  |  ( f ( c  Func  d )
g  /\  A. x  e.  ( Base `  c
) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) ) }  e.  _V )  ->  ( c Full  d
)  =  { <. f ,  g >.  |  ( f ( c  Func  d ) g  /\  A. x  e.  ( Base `  c ) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) ) } )
1512, 14mp3an3 1266 . . . 4  |-  ( ( c  e.  Cat  /\  d  e.  Cat )  ->  ( c Full  d )  =  { <. f ,  g >.  |  ( f ( c  Func  d ) g  /\  A. x  e.  ( Base `  c ) A. y  e.  ( Base `  c
) ran  ( x
g y )  =  ( ( f `  x ) (  Hom  `  d ) ( f `
 y ) ) ) } )
1615, 11syl6eqss 3241 . . 3  |-  ( ( c  e.  Cat  /\  d  e.  Cat )  ->  ( c Full  d ) 
C_  ( c  Func  d ) )
173, 6, 16vtocl2ga 2864 . 2  |-  ( ( C  e.  Cat  /\  D  e.  Cat )  ->  ( C Full  D ) 
C_  ( C  Func  D ) )
1813, 12fnmpt2i 6209 . . . . 5  |- Full  Fn  ( Cat  X.  Cat )
19 fndm 5359 . . . . 5  |-  ( Full  Fn  ( Cat  X.  Cat )  ->  dom Full  =  ( Cat 
X.  Cat ) )
2018, 19ax-mp 8 . . . 4  |-  dom Full  =  ( Cat  X.  Cat )
2120ndmov 6020 . . 3  |-  ( -.  ( C  e.  Cat  /\  D  e.  Cat )  ->  ( C Full  D )  =  (/) )
22 0ss 3496 . . 3  |-  (/)  C_  ( C  Func  D )
2321, 22syl6eqss 3241 . 2  |-  ( -.  ( C  e.  Cat  /\  D  e.  Cat )  ->  ( C Full  D ) 
C_  ( C  Func  D ) )
2417, 23pm2.61i 156 1  |-  ( C Full 
D )  C_  ( C  Func  D )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 358    = wceq 1632    e. wcel 1696   A.wral 2556   _Vcvv 2801    C_ wss 3165   (/)c0 3468   class class class wbr 4039   {copab 4092    X. cxp 4703   dom cdm 4705   ran crn 4706    Fn wfn 5266   ` cfv 5271  (class class class)co 5874   Basecbs 13164    Hom chom 13235   Catccat 13582    Func cfunc 13744   Full cful 13792
This theorem is referenced by:  relfull  13798  isfull  13800  fulloppc  13812  cofull  13824  catcisolem  13954  catciso  13955
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-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  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-1st 6138  df-2nd 6139  df-full 13794
  Copyright terms: Public domain W3C validator