Metamath Proof Explorer


Definition df-subgr

Description: Define the class of the subgraph relation. A class s is a subgraph of a class g (thesupergraph of s ) if its vertices are also vertices of g , and its edges are also edges of g , connecting vertices of s only (see section I.1 in Bollobas p. 2 or section 1.1 in Diestel p. 4). The second condition is ensured by the requirement that the edge function of s is a restriction of the edge function of g having only vertices of s in its range. Note that the domains of the edge functions of the subgraph and the supergraph should be compatible. (Contributed by AV, 16-Nov-2020)

Ref Expression
Assertion df-subgr SubGraph=sg|VtxsVtxgiEdgs=iEdggdomiEdgsEdgs𝒫Vtxs

Detailed syntax breakdown

Step Hyp Ref Expression
0 csubgr classSubGraph
1 vs setvars
2 vg setvarg
3 cvtx classVtx
4 1 cv setvars
5 4 3 cfv classVtxs
6 2 cv setvarg
7 6 3 cfv classVtxg
8 5 7 wss wffVtxsVtxg
9 ciedg classiEdg
10 4 9 cfv classiEdgs
11 6 9 cfv classiEdgg
12 10 cdm classdomiEdgs
13 11 12 cres classiEdggdomiEdgs
14 10 13 wceq wffiEdgs=iEdggdomiEdgs
15 cedg classEdg
16 4 15 cfv classEdgs
17 5 cpw class𝒫Vtxs
18 16 17 wss wffEdgs𝒫Vtxs
19 8 14 18 w3a wffVtxsVtxgiEdgs=iEdggdomiEdgsEdgs𝒫Vtxs
20 19 1 2 copab classsg|VtxsVtxgiEdgs=iEdggdomiEdgsEdgs𝒫Vtxs
21 0 20 wceq wffSubGraph=sg|VtxsVtxgiEdgs=iEdggdomiEdgsEdgs𝒫Vtxs