Metamath Proof Explorer


Definition df-uspgr

Description: Define the class of all undirected simple pseudographs (which could have loops). An undirected simple pseudograph is a special undirected pseudograph (see uspgrupgr ) or a special undirected simple hypergraph (see uspgrushgr ), consisting of a set v (of "vertices") and an injective (one-to-one) function e (representing (indexed) "edges") into subsets of v of cardinality one or two, representing the two vertices incident to the edge, or the one vertex if the edge is a loop. In contrast to a pseudograph, there is at most one edge between two vertices resp. at most one loop for a vertex. (Contributed by Alexander van der Vekens, 10-Aug-2017) (Revised by AV, 13-Oct-2020)

Ref Expression
Assertion df-uspgr USHGraph=g|[˙Vtxg/v]˙[˙iEdgg/e]˙e:dome1-1x𝒫v|x2

Detailed syntax breakdown

Step Hyp Ref Expression
0 cuspgr classUSHGraph
1 vg setvarg
2 cvtx classVtx
3 1 cv setvarg
4 3 2 cfv classVtxg
5 vv setvarv
6 ciedg classiEdg
7 3 6 cfv classiEdgg
8 ve setvare
9 8 cv setvare
10 9 cdm classdome
11 vx setvarx
12 5 cv setvarv
13 12 cpw class𝒫v
14 c0 class
15 14 csn class
16 13 15 cdif class𝒫v
17 chash class.
18 11 cv setvarx
19 18 17 cfv classx
20 cle class
21 c2 class2
22 19 21 20 wbr wffx2
23 22 11 16 crab classx𝒫v|x2
24 10 23 9 wf1 wffe:dome1-1x𝒫v|x2
25 24 8 7 wsbc wff[˙iEdgg/e]˙e:dome1-1x𝒫v|x2
26 25 5 4 wsbc wff[˙Vtxg/v]˙[˙iEdgg/e]˙e:dome1-1x𝒫v|x2
27 26 1 cab classg|[˙Vtxg/v]˙[˙iEdgg/e]˙e:dome1-1x𝒫v|x2
28 0 27 wceq wffUSHGraph=g|[˙Vtxg/v]˙[˙iEdgg/e]˙e:dome1-1x𝒫v|x2