Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > df-iedg | Structured version Visualization version Unicode version |
Description: Define the function mapping a graph to its indexed edges. This definition is very general: It defines the indexed edges for any ordered pair as its second component, and for any other class as its "edge function". It is meaningful, however, only if the ordered pair represents a graph resp. the class is an extensible structure (containing a slot for "edge functions") representing a graph. (Contributed by AV, 20-Sep-2020.) |
Ref | Expression |
---|---|
df-iedg | iEdg .ef |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ciedg 25875 | . 2 iEdg | |
2 | vg | . . 3 | |
3 | cvv 3200 | . . 3 | |
4 | 2 | cv 1482 | . . . . 5 |
5 | 3, 3 | cxp 5112 | . . . . 5 |
6 | 4, 5 | wcel 1990 | . . . 4 |
7 | c2nd 7167 | . . . . 5 | |
8 | 4, 7 | cfv 5888 | . . . 4 |
9 | cedgf 25867 | . . . . 5 .ef | |
10 | 4, 9 | cfv 5888 | . . . 4 .ef |
11 | 6, 8, 10 | cif 4086 | . . 3 .ef |
12 | 2, 3, 11 | cmpt 4729 | . 2 .ef |
13 | 1, 12 | wceq 1483 | 1 iEdg .ef |
Colors of variables: wff setvar class |
This definition is referenced by: iedgval 25879 iedgvalOLD 25881 |
Copyright terms: Public domain | W3C validator |