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

Theorem monfval 13913
Description: Definition of a monomorphism in a category. (Contributed by Mario Carneiro, 3-Jan-2017.)
Hypotheses
Ref Expression
ismon.b  |-  B  =  ( Base `  C
)
ismon.h  |-  H  =  (  Hom  `  C
)
ismon.o  |-  .x.  =  (comp `  C )
ismon.s  |-  M  =  (Mono `  C )
ismon.c  |-  ( ph  ->  C  e.  Cat )
Assertion
Ref Expression
monfval  |-  ( ph  ->  M  =  ( x  e.  B ,  y  e.  B  |->  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x ) 
|->  ( f ( <.
z ,  x >.  .x.  y ) g ) ) } ) )
Distinct variable groups:    f, g, x, y, z, B    ph, f,
g, x, y, z    C, f, g, x, y, z    f, H, g, x, y, z    .x. , f,
g, x, y, z   
f, M
Allowed substitution hints:    M( x, y, z, g)

Proof of Theorem monfval
Dummy variables  b 
c  h are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ismon.s . 2  |-  M  =  (Mono `  C )
2 ismon.c . . 3  |-  ( ph  ->  C  e.  Cat )
3 fvex 5701 . . . . . 6  |-  ( Base `  c )  e.  _V
43a1i 11 . . . . 5  |-  ( c  =  C  ->  ( Base `  c )  e. 
_V )
5 fveq2 5687 . . . . . 6  |-  ( c  =  C  ->  ( Base `  c )  =  ( Base `  C
) )
6 ismon.b . . . . . 6  |-  B  =  ( Base `  C
)
75, 6syl6eqr 2454 . . . . 5  |-  ( c  =  C  ->  ( Base `  c )  =  B )
8 fvex 5701 . . . . . . 7  |-  (  Hom  `  c )  e.  _V
98a1i 11 . . . . . 6  |-  ( ( c  =  C  /\  b  =  B )  ->  (  Hom  `  c
)  e.  _V )
10 simpl 444 . . . . . . . 8  |-  ( ( c  =  C  /\  b  =  B )  ->  c  =  C )
1110fveq2d 5691 . . . . . . 7  |-  ( ( c  =  C  /\  b  =  B )  ->  (  Hom  `  c
)  =  (  Hom  `  C ) )
12 ismon.h . . . . . . 7  |-  H  =  (  Hom  `  C
)
1311, 12syl6eqr 2454 . . . . . 6  |-  ( ( c  =  C  /\  b  =  B )  ->  (  Hom  `  c
)  =  H )
14 simplr 732 . . . . . . 7  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  b  =  B )
15 simpr 448 . . . . . . . . 9  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  h  =  H )
1615oveqd 6057 . . . . . . . 8  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  (
x h y )  =  ( x H y ) )
1715oveqd 6057 . . . . . . . . . . . 12  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  (
z h x )  =  ( z H x ) )
18 simpll 731 . . . . . . . . . . . . . . . 16  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  c  =  C )
1918fveq2d 5691 . . . . . . . . . . . . . . 15  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  (comp `  c )  =  (comp `  C ) )
20 ismon.o . . . . . . . . . . . . . . 15  |-  .x.  =  (comp `  C )
2119, 20syl6eqr 2454 . . . . . . . . . . . . . 14  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  (comp `  c )  =  .x.  )
2221oveqd 6057 . . . . . . . . . . . . 13  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  ( <. z ,  x >. (comp `  c ) y )  =  ( <. z ,  x >.  .x.  y ) )
2322oveqd 6057 . . . . . . . . . . . 12  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  (
f ( <. z ,  x >. (comp `  c
) y ) g )  =  ( f ( <. z ,  x >.  .x.  y ) g ) )
2417, 23mpteq12dv 4247 . . . . . . . . . . 11  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  (
g  e.  ( z h x )  |->  ( f ( <. z ,  x >. (comp `  c
) y ) g ) )  =  ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) )
2524cnveqd 5007 . . . . . . . . . 10  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  `' ( g  e.  ( z h x ) 
|->  ( f ( <.
z ,  x >. (comp `  c ) y ) g ) )  =  `' ( g  e.  ( z H x )  |->  ( f (
<. z ,  x >.  .x.  y ) g ) ) )
2625funeqd 5434 . . . . . . . . 9  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  ( Fun  `' ( g  e.  ( z h x )  |->  ( f (
<. z ,  x >. (comp `  c ) y ) g ) )  <->  Fun  `' ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) ) )
2714, 26raleqbidv 2876 . . . . . . . 8  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  ( A. z  e.  b  Fun  `' ( g  e.  ( z h x )  |->  ( f (
<. z ,  x >. (comp `  c ) y ) g ) )  <->  A. z  e.  B  Fun  `' ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) ) )
2816, 27rabeqbidv 2911 . . . . . . 7  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  { f  e.  ( x h y )  |  A. z  e.  b  Fun  `' ( g  e.  ( z h x ) 
|->  ( f ( <.
z ,  x >. (comp `  c ) y ) g ) ) }  =  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) } )
2914, 14, 28mpt2eq123dv 6095 . . . . . 6  |-  ( ( ( c  =  C  /\  b  =  B )  /\  h  =  H )  ->  (
x  e.  b ,  y  e.  b  |->  { f  e.  ( x h y )  | 
A. z  e.  b  Fun  `' ( g  e.  ( z h x )  |->  ( f ( <. z ,  x >. (comp `  c )
y ) g ) ) } )  =  ( x  e.  B ,  y  e.  B  |->  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) } ) )
309, 13, 29csbied2 3254 . . . . 5  |-  ( ( c  =  C  /\  b  =  B )  ->  [_ (  Hom  `  c
)  /  h ]_ ( x  e.  b ,  y  e.  b  |->  { f  e.  ( x h y )  |  A. z  e.  b  Fun  `' ( g  e.  ( z h x )  |->  ( f ( <. z ,  x >. (comp `  c
) y ) g ) ) } )  =  ( x  e.  B ,  y  e.  B  |->  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) } ) )
314, 7, 30csbied2 3254 . . . 4  |-  ( c  =  C  ->  [_ ( Base `  c )  / 
b ]_ [_ (  Hom  `  c )  /  h ]_ ( x  e.  b ,  y  e.  b 
|->  { f  e.  ( x h y )  |  A. z  e.  b  Fun  `' ( g  e.  ( z h x )  |->  ( f ( <. z ,  x >. (comp `  c
) y ) g ) ) } )  =  ( x  e.  B ,  y  e.  B  |->  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) } ) )
32 df-mon 13911 . . . 4  |- Mono  =  ( c  e.  Cat  |->  [_ ( Base `  c )  /  b ]_ [_ (  Hom  `  c )  /  h ]_ ( x  e.  b ,  y  e.  b  |->  { f  e.  ( x h y )  |  A. z  e.  b  Fun  `' ( g  e.  ( z h x )  |->  ( f ( <. z ,  x >. (comp `  c
) y ) g ) ) } ) )
33 fvex 5701 . . . . . 6  |-  ( Base `  C )  e.  _V
346, 33eqeltri 2474 . . . . 5  |-  B  e. 
_V
3534, 34mpt2ex 6384 . . . 4  |-  ( x  e.  B ,  y  e.  B  |->  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x ) 
|->  ( f ( <.
z ,  x >.  .x.  y ) g ) ) } )  e. 
_V
3631, 32, 35fvmpt 5765 . . 3  |-  ( C  e.  Cat  ->  (Mono `  C )  =  ( x  e.  B , 
y  e.  B  |->  { f  e.  ( x H y )  | 
A. z  e.  B  Fun  `' ( g  e.  ( z H x )  |->  ( f (
<. z ,  x >.  .x.  y ) g ) ) } ) )
372, 36syl 16 . 2  |-  ( ph  ->  (Mono `  C )  =  ( x  e.  B ,  y  e.  B  |->  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x )  |->  ( f ( <. z ,  x >.  .x.  y ) g ) ) } ) )
381, 37syl5eq 2448 1  |-  ( ph  ->  M  =  ( x  e.  B ,  y  e.  B  |->  { f  e.  ( x H y )  |  A. z  e.  B  Fun  `' ( g  e.  ( z H x ) 
|->  ( f ( <.
z ,  x >.  .x.  y ) g ) ) } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1649    e. wcel 1721   A.wral 2666   {crab 2670   _Vcvv 2916   [_csb 3211   <.cop 3777    e. cmpt 4226   `'ccnv 4836   Fun wfun 5407   ` cfv 5413  (class class class)co 6040    e. cmpt2 6042   Basecbs 13424    Hom chom 13495  compcco 13496   Catccat 13844  Monocmon 13909
This theorem is referenced by:  ismon  13914  monpropd  13918
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-rep 4280  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-reu 2673  df-rab 2675  df-v 2918  df-sbc 3122  df-csb 3212  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-iun 4055  df-br 4173  df-opab 4227  df-mpt 4228  df-id 4458  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-ov 6043  df-oprab 6044  df-mpt2 6045  df-1st 6308  df-2nd 6309  df-mon 13911
  Copyright terms: Public domain W3C validator