Metamath Proof Explorer


Definition df-ushgr

Description: Define the class of all undirected simple hypergraphs. An undirected simple hypergraph is a special (non-simple, multiple, multi-) hypergraph for which the edge function e is an injective (one-to-one) function into subsets of the set of vertices v , representing the (one or more) vertices incident to the edge. This definition corresponds to the definition of hypergraphs in section I.1 of Bollobas p. 7 (except that the empty set seems to be allowed to be an "edge") or section 1.10 of Diestel p. 27, where "E is a subset of [... the power set of V, that is the set of all subsets of V" resp. "the elements of E are nonempty subsets (of any cardinality) of V". (Contributed by AV, 19-Jan-2020) (Revised by AV, 8-Oct-2020)

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

Detailed syntax breakdown

Step Hyp Ref Expression
0 cushgr 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 5 cv setvarv
12 11 cpw class𝒫v
13 c0 class
14 13 csn class
15 12 14 cdif class𝒫v
16 10 15 9 wf1 wffe:dome1-1𝒫v
17 16 8 7 wsbc wff[˙iEdgg/e]˙e:dome1-1𝒫v
18 17 5 4 wsbc wff[˙Vtxg/v]˙[˙iEdgg/e]˙e:dome1-1𝒫v
19 18 1 cab classg|[˙Vtxg/v]˙[˙iEdgg/e]˙e:dome1-1𝒫v
20 0 19 wceq wffUSHGraph=g|[˙Vtxg/v]˙[˙iEdgg/e]˙e:dome1-1𝒫v