MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-edgf Structured version   Visualization version   Unicode version

Definition df-edgf 25868
Description: Define the edge function (indexed edges) of a graph. (Contributed by AV, 18-Jan-2020.)
Assertion
Ref Expression
df-edgf  |- .ef  = Slot ; 1 8

Detailed syntax breakdown of Definition df-edgf
StepHypRef Expression
1 cedgf 25867 . 2  class .ef
2 c1 9937 . . . 4  class  1
3 c8 11076 . . . 4  class  8
42, 3cdc 11493 . . 3  class ; 1 8
54cslot 15856 . 2  class Slot ; 1 8
61, 5wceq 1483 1  wff .ef  = Slot ; 1 8
Colors of variables: wff setvar class
This definition is referenced by:  edgfid  25869  edgfndxnn  25870  edgfndxid  25871  baseltedgf  25872  iedgval0  25932
  Copyright terms: Public domain W3C validator