Theorem usgruhgr

Description: A simple graph is an undirected hypergraph. (Contributed by AV, 9-Feb-2018) (Revised by AV, 15-Oct-2020)

	Ref	Expression
Assertion	usgruhgr	⊢ ( 𝐺 ∈ USGraph → 𝐺 ∈ UHGraph )

Proof

Step	Hyp	Ref	Expression
1		usgrupgr	⊢ ( 𝐺 ∈ USGraph → 𝐺 ∈ UPGraph )
2		upgruhgr	⊢ ( 𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph )
3	1 2	syl	⊢ ( 𝐺 ∈ USGraph → 𝐺 ∈ UHGraph )