Metamath Proof Explorer


Theorem umgruhgr

Description: An undirected multigraph is an undirected hypergraph. (Contributed by AV, 26-Nov-2020)

Ref Expression
Assertion umgruhgr ( 𝐺 ∈ UMGraph → 𝐺 ∈ UHGraph )

Proof

Step Hyp Ref Expression
1 umgrupgr ( 𝐺 ∈ UMGraph → 𝐺 ∈ UPGraph )
2 upgruhgr ( 𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph )
3 1 2 syl ( 𝐺 ∈ UMGraph → 𝐺 ∈ UHGraph )