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

Theorem fullpropd 15136
Description: If two categories have the same set of objects, morphisms, and compositions, then they have the same full functors. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypotheses
Ref Expression
fullpropd.1  |-  ( ph  ->  ( Hom f  `  A )  =  ( Hom f  `  B ) )
fullpropd.2  |-  ( ph  ->  (compf `  A )  =  (compf `  B ) )
fullpropd.3  |-  ( ph  ->  ( Hom f  `  C )  =  ( Hom f  `  D ) )
fullpropd.4  |-  ( ph  ->  (compf `  C )  =  (compf `  D ) )
fullpropd.a  |-  ( ph  ->  A  e.  V )
fullpropd.b  |-  ( ph  ->  B  e.  V )
fullpropd.c  |-  ( ph  ->  C  e.  V )
fullpropd.d  |-  ( ph  ->  D  e.  V )
Assertion
Ref Expression
fullpropd  |-  ( ph  ->  ( A Full  C )  =  ( B Full  D
) )

Proof of Theorem fullpropd
Dummy variables  f 
g  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfull 15124 . 2  |-  Rel  ( A Full  C )
2 relfull 15124 . 2  |-  Rel  ( B Full  D )
3 fullpropd.1 . . . . . . . 8  |-  ( ph  ->  ( Hom f  `  A )  =  ( Hom f  `  B ) )
43homfeqbas 14941 . . . . . . 7  |-  ( ph  ->  ( Base `  A
)  =  ( Base `  B ) )
54adantr 465 . . . . . 6  |-  ( (
ph  /\  f ( A  Func  C ) g )  ->  ( Base `  A )  =  (
Base `  B )
)
65adantr 465 . . . . . . 7  |-  ( ( ( ph  /\  f
( A  Func  C
) g )  /\  x  e.  ( Base `  A ) )  -> 
( Base `  A )  =  ( Base `  B
) )
7 eqid 2460 . . . . . . . . 9  |-  ( Base `  C )  =  (
Base `  C )
8 eqid 2460 . . . . . . . . 9  |-  ( Hom  `  C )  =  ( Hom  `  C )
9 eqid 2460 . . . . . . . . 9  |-  ( Hom  `  D )  =  ( Hom  `  D )
10 fullpropd.3 . . . . . . . . . 10  |-  ( ph  ->  ( Hom f  `  C )  =  ( Hom f  `  D ) )
1110ad3antrrr 729 . . . . . . . . 9  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
( Hom f  `  C )  =  ( Hom f  `  D ) )
12 eqid 2460 . . . . . . . . . . 11  |-  ( Base `  A )  =  (
Base `  A )
13 simpllr 758 . . . . . . . . . . 11  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
f ( A  Func  C ) g )
1412, 7, 13funcf1 15082 . . . . . . . . . 10  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
f : ( Base `  A ) --> ( Base `  C ) )
15 simplr 754 . . . . . . . . . 10  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  ->  x  e.  ( Base `  A ) )
1614, 15ffvelrnd 6013 . . . . . . . . 9  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
( f `  x
)  e.  ( Base `  C ) )
17 simpr 461 . . . . . . . . . 10  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
y  e.  ( Base `  A ) )
1814, 17ffvelrnd 6013 . . . . . . . . 9  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
( f `  y
)  e.  ( Base `  C ) )
197, 8, 9, 11, 16, 18homfeqval 14942 . . . . . . . 8  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
( ( f `  x ) ( Hom  `  C ) ( f `
 y ) )  =  ( ( f `
 x ) ( Hom  `  D )
( f `  y
) ) )
2019eqeq2d 2474 . . . . . . 7  |-  ( ( ( ( ph  /\  f ( A  Func  C ) g )  /\  x  e.  ( Base `  A ) )  /\  y  e.  ( Base `  A ) )  -> 
( ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  C ) ( f `
 y ) )  <->  ran  ( x g y )  =  ( ( f `  x ) ( Hom  `  D
) ( f `  y ) ) ) )
216, 20raleqbidva 3067 . . . . . 6  |-  ( ( ( ph  /\  f
( A  Func  C
) g )  /\  x  e.  ( Base `  A ) )  -> 
( A. y  e.  ( Base `  A
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  C ) ( f `
 y ) )  <->  A. y  e.  ( Base `  B ) ran  ( x g y )  =  ( ( f `  x ) ( Hom  `  D
) ( f `  y ) ) ) )
225, 21raleqbidva 3067 . . . . 5  |-  ( (
ph  /\  f ( A  Func  C ) g )  ->  ( A. x  e.  ( Base `  A ) A. y  e.  ( Base `  A
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  C ) ( f `
 y ) )  <->  A. x  e.  ( Base `  B ) A. y  e.  ( Base `  B ) ran  (
x g y )  =  ( ( f `
 x ) ( Hom  `  D )
( f `  y
) ) ) )
2322pm5.32da 641 . . . 4  |-  ( ph  ->  ( ( f ( A  Func  C )
g  /\  A. x  e.  ( Base `  A
) A. y  e.  ( Base `  A
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  C ) ( f `
 y ) ) )  <->  ( f ( A  Func  C )
g  /\  A. x  e.  ( Base `  B
) A. y  e.  ( Base `  B
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  D ) ( f `
 y ) ) ) ) )
24 fullpropd.2 . . . . . . 7  |-  ( ph  ->  (compf `  A )  =  (compf `  B ) )
25 fullpropd.4 . . . . . . 7  |-  ( ph  ->  (compf `  C )  =  (compf `  D ) )
26 fullpropd.a . . . . . . 7  |-  ( ph  ->  A  e.  V )
27 fullpropd.b . . . . . . 7  |-  ( ph  ->  B  e.  V )
28 fullpropd.c . . . . . . 7  |-  ( ph  ->  C  e.  V )
29 fullpropd.d . . . . . . 7  |-  ( ph  ->  D  e.  V )
303, 24, 10, 25, 26, 27, 28, 29funcpropd 15116 . . . . . 6  |-  ( ph  ->  ( A  Func  C
)  =  ( B 
Func  D ) )
3130breqd 4451 . . . . 5  |-  ( ph  ->  ( f ( A 
Func  C ) g  <->  f ( B  Func  D ) g ) )
3231anbi1d 704 . . . 4  |-  ( ph  ->  ( ( f ( A  Func  C )
g  /\  A. x  e.  ( Base `  B
) A. y  e.  ( Base `  B
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  D ) ( f `
 y ) ) )  <->  ( f ( B  Func  D )
g  /\  A. x  e.  ( Base `  B
) A. y  e.  ( Base `  B
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  D ) ( f `
 y ) ) ) ) )
3323, 32bitrd 253 . . 3  |-  ( ph  ->  ( ( f ( A  Func  C )
g  /\  A. x  e.  ( Base `  A
) A. y  e.  ( Base `  A
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  C ) ( f `
 y ) ) )  <->  ( f ( B  Func  D )
g  /\  A. x  e.  ( Base `  B
) A. y  e.  ( Base `  B
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  D ) ( f `
 y ) ) ) ) )
3412, 8isfull 15126 . . 3  |-  ( f ( A Full  C ) g  <->  ( f ( A  Func  C )
g  /\  A. x  e.  ( Base `  A
) A. y  e.  ( Base `  A
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  C ) ( f `
 y ) ) ) )
35 eqid 2460 . . . 4  |-  ( Base `  B )  =  (
Base `  B )
3635, 9isfull 15126 . . 3  |-  ( f ( B Full  D ) g  <->  ( f ( B  Func  D )
g  /\  A. x  e.  ( Base `  B
) A. y  e.  ( Base `  B
) ran  ( x
g y )  =  ( ( f `  x ) ( Hom  `  D ) ( f `
 y ) ) ) )
3733, 34, 363bitr4g 288 . 2  |-  ( ph  ->  ( f ( A Full 
C ) g  <->  f ( B Full  D ) g ) )
381, 2, 37eqbrrdiv 5092 1  |-  ( ph  ->  ( A Full  C )  =  ( B Full  D
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1374    e. wcel 1762   A.wral 2807   class class class wbr 4440   ran crn 4993   ` cfv 5579  (class class class)co 6275   Basecbs 14479   Hom chom 14555   Hom f chomf 14910  compfccomf 14911    Func cfunc 15070   Full cful 15118
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
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-fal 1380  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-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-nul 3779  df-if 3933  df-pw 4005  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-iun 4320  df-br 4441  df-opab 4499  df-mpt 4500  df-id 4788  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-1st 6774  df-2nd 6775  df-map 7412  df-ixp 7460  df-cat 14912  df-cid 14913  df-homf 14914  df-comf 14915  df-func 15074  df-full 15120
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator