Description: Define the class of all undirected hypergraphs. An undirected
hypergraph consists of a set v (of "vertices") and a function e
(representing indexed "edges") into the power set of this set (the empty
set excluded). (Contributed by Alexander van der Vekens, 26-Dec-2017)(Revised by AV, 8-Oct-2020)