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

Theorem relfull 15521
Description: The set of full functors is a relation. (Contributed by Mario Carneiro, 26-Jan-2017.)
Assertion
Ref Expression
relfull  |-  Rel  ( C Full  D )

Proof of Theorem relfull
StepHypRef Expression
1 fullfunc 15519 . 2  |-  ( C Full 
D )  C_  ( C  Func  D )
2 relfunc 15475 . 2  |-  Rel  ( C  Func  D )
3 relss 4911 . 2  |-  ( ( C Full  D )  C_  ( C  Func  D )  ->  ( Rel  ( C  Func  D )  ->  Rel  ( C Full  D ) ) )
41, 2, 3mp2 9 1  |-  Rel  ( C Full  D )
Colors of variables: wff setvar class
Syntax hints:    C_ wss 3414   Rel wrel 4828  (class class class)co 6278    Func cfunc 15467   Full cful 15515
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-8 1844  ax-9 1846  ax-10 1861  ax-11 1866  ax-12 1878  ax-13 2026  ax-ext 2380  ax-sep 4517  ax-nul 4525  ax-pow 4572  ax-pr 4630  ax-un 6574
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 976  df-tru 1408  df-ex 1634  df-nf 1638  df-sb 1764  df-eu 2242  df-mo 2243  df-clab 2388  df-cleq 2394  df-clel 2397  df-nfc 2552  df-ne 2600  df-ral 2759  df-rex 2760  df-rab 2763  df-v 3061  df-sbc 3278  df-csb 3374  df-dif 3417  df-un 3419  df-in 3421  df-ss 3428  df-nul 3739  df-if 3886  df-sn 3973  df-pr 3975  df-op 3979  df-uni 4192  df-iun 4273  df-br 4396  df-opab 4454  df-mpt 4455  df-id 4738  df-xp 4829  df-rel 4830  df-cnv 4831  df-co 4832  df-dm 4833  df-rn 4834  df-res 4835  df-ima 4836  df-iota 5533  df-fun 5571  df-fv 5577  df-ov 6281  df-oprab 6282  df-mpt2 6283  df-1st 6784  df-2nd 6785  df-func 15471  df-full 15517
This theorem is referenced by:  fullpropd  15533  cofull  15547
  Copyright terms: Public domain W3C validator