![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > df-edgf | Structured version Visualization version GIF version |
Description: Define the edge function (indexed edges) of a graph. (Contributed by AV, 18-Jan-2020.) |
Ref | Expression |
---|---|
df-edgf | ⊢ .ef = Slot ;18 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cedgf 26354 | . 2 class .ef | |
2 | c1 10275 | . . . 4 class 1 | |
3 | c8 11441 | . . . 4 class 8 | |
4 | 2, 3 | cdc 11850 | . . 3 class ;18 |
5 | 4 | cslot 16265 | . 2 class Slot ;18 |
6 | 1, 5 | wceq 1601 | 1 wff .ef = Slot ;18 |
Colors of variables: wff setvar class |
This definition is referenced by: edgfid 26356 edgfndxnn 26357 edgfndxid 26358 baseltedgf 26359 iedgval0 26405 |
Copyright terms: Public domain | W3C validator |