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

Theorem cidfn 15086
Description: The identity arrow operator is a function from objects to arrows. (Contributed by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
cidfn.b  |-  B  =  ( Base `  C
)
cidfn.i  |-  .1.  =  ( Id `  C )
Assertion
Ref Expression
cidfn  |-  ( C  e.  Cat  ->  .1.  Fn  B )

Proof of Theorem cidfn
Dummy variables  f 
g  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 riotaex 6162 . . 3  |-  ( iota_ g  e.  ( x ( Hom  `  C )
x ) A. y  e.  B  ( A. f  e.  ( y
( Hom  `  C ) x ) ( g ( <. y ,  x >. (comp `  C )
x ) f )  =  f  /\  A. f  e.  ( x
( Hom  `  C ) y ) ( f ( <. x ,  x >. (comp `  C )
y ) g )  =  f ) )  e.  _V
2 eqid 2382 . . 3  |-  ( x  e.  B  |->  ( iota_ g  e.  ( x ( Hom  `  C )
x ) A. y  e.  B  ( A. f  e.  ( y
( Hom  `  C ) x ) ( g ( <. y ,  x >. (comp `  C )
x ) f )  =  f  /\  A. f  e.  ( x
( Hom  `  C ) y ) ( f ( <. x ,  x >. (comp `  C )
y ) g )  =  f ) ) )  =  ( x  e.  B  |->  ( iota_ g  e.  ( x ( Hom  `  C )
x ) A. y  e.  B  ( A. f  e.  ( y
( Hom  `  C ) x ) ( g ( <. y ,  x >. (comp `  C )
x ) f )  =  f  /\  A. f  e.  ( x
( Hom  `  C ) y ) ( f ( <. x ,  x >. (comp `  C )
y ) g )  =  f ) ) )
31, 2fnmpti 5617 . 2  |-  ( x  e.  B  |->  ( iota_ g  e.  ( x ( Hom  `  C )
x ) A. y  e.  B  ( A. f  e.  ( y
( Hom  `  C ) x ) ( g ( <. y ,  x >. (comp `  C )
x ) f )  =  f  /\  A. f  e.  ( x
( Hom  `  C ) y ) ( f ( <. x ,  x >. (comp `  C )
y ) g )  =  f ) ) )  Fn  B
4 cidfn.b . . . 4  |-  B  =  ( Base `  C
)
5 eqid 2382 . . . 4  |-  ( Hom  `  C )  =  ( Hom  `  C )
6 eqid 2382 . . . 4  |-  (comp `  C )  =  (comp `  C )
7 id 22 . . . 4  |-  ( C  e.  Cat  ->  C  e.  Cat )
8 cidfn.i . . . 4  |-  .1.  =  ( Id `  C )
94, 5, 6, 7, 8cidfval 15083 . . 3  |-  ( C  e.  Cat  ->  .1.  =  ( x  e.  B  |->  ( iota_ g  e.  ( x ( Hom  `  C ) x ) A. y  e.  B  ( A. f  e.  ( y ( Hom  `  C
) x ) ( g ( <. y ,  x >. (comp `  C
) x ) f )  =  f  /\  A. f  e.  ( x ( Hom  `  C
) y ) ( f ( <. x ,  x >. (comp `  C
) y ) g )  =  f ) ) ) )
109fneq1d 5579 . 2  |-  ( C  e.  Cat  ->  (  .1.  Fn  B  <->  ( x  e.  B  |->  ( iota_ g  e.  ( x ( Hom  `  C )
x ) A. y  e.  B  ( A. f  e.  ( y
( Hom  `  C ) x ) ( g ( <. y ,  x >. (comp `  C )
x ) f )  =  f  /\  A. f  e.  ( x
( Hom  `  C ) y ) ( f ( <. x ,  x >. (comp `  C )
y ) g )  =  f ) ) )  Fn  B ) )
113, 10mpbiri 233 1  |-  ( C  e.  Cat  ->  .1.  Fn  B )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 367    = wceq 1399    e. wcel 1826   A.wral 2732   <.cop 3950    |-> cmpt 4425    Fn wfn 5491   ` cfv 5496   iota_crio 6157  (class class class)co 6196   Basecbs 14634   Hom chom 14713  compcco 14714   Catccat 15071   Idccid 15072
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1626  ax-4 1639  ax-5 1712  ax-6 1755  ax-7 1798  ax-9 1830  ax-10 1845  ax-11 1850  ax-12 1862  ax-13 2006  ax-ext 2360  ax-rep 4478  ax-sep 4488  ax-nul 4496  ax-pr 4601
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1402  df-ex 1621  df-nf 1625  df-sb 1748  df-eu 2222  df-mo 2223  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2532  df-ne 2579  df-ral 2737  df-rex 2738  df-reu 2739  df-rab 2741  df-v 3036  df-sbc 3253  df-csb 3349  df-dif 3392  df-un 3394  df-in 3396  df-ss 3403  df-nul 3712  df-if 3858  df-sn 3945  df-pr 3947  df-op 3951  df-uni 4164  df-iun 4245  df-br 4368  df-opab 4426  df-mpt 4427  df-id 4709  df-xp 4919  df-rel 4920  df-cnv 4921  df-co 4922  df-dm 4923  df-rn 4924  df-res 4925  df-ima 4926  df-iota 5460  df-fun 5498  df-fn 5499  df-f 5500  df-f1 5501  df-fo 5502  df-f1o 5503  df-fv 5504  df-riota 6158  df-ov 6199  df-cid 15076
This theorem is referenced by:  oppccatid  15125  fucidcl  15371  fucsect  15378  curfcl  15618  curf2ndf  15633
  Copyright terms: Public domain W3C validator