Metamath Proof Explorer

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	$⊢ G \in USGraph \to G \in UHGraph$

Step	Hyp	Ref	Expression
1		usgrupgr	$⊢ G \in USGraph \to G \in UPGraph$
2		upgruhgr	$⊢ G \in UPGraph \to G \in UHGraph$
3	1 2	syl	$⊢ G \in USGraph \to G \in UHGraph$