Definition df-edg

Description: Define the class of edges of a graph, see also definition "E = E(G)" in section I.1 of Bollobas p. 1. This definition is very general: It defines edges of a class as the range of its edge function (which does not even need to be a function). Therefore, this definition could also be used for hypergraphs, pseudographs and multigraphs. In these cases, however, the (possibly more than one) edges connecting the same vertices could not be distinguished anymore. In some cases, this is no problem, so theorems with Edg are meaningful nevertheless (e.g., edguhgr ). Usually, however, this definition is used only for undirected simple (hyper-/pseudo-)graphs (with or without loops). (Contributed by AV, 1-Jan-2020) (Revised by AV, 13-Oct-2020)

	Ref	Expression
Assertion	df-edg	|- Edg = ( g e. _V |-> ran ( iEdg ` g ) )

Detailed syntax breakdown

Step	Hyp	Ref	Expression
0		cedg	|- Edg
1		vg	|- g
2		cvv	|- _V
3		ciedg	|- iEdg
4	1	cv	|- g
5	4 3	cfv	|- ( iEdg ` g )
6	5	crn	|- ran ( iEdg ` g )
7	1 2 6	cmpt	|- ( g e. _V |-> ran ( iEdg ` g ) )
8	0 7	wceq	|- Edg = ( g e. _V |-> ran ( iEdg ` g ) )