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 e. USGraph -> G e. UHGraph )

Proof

Step Hyp Ref Expression
1 usgrupgr 
 |-  ( G e. USGraph -> G e. UPGraph )
2 upgruhgr 
 |-  ( G e. UPGraph -> G e. UHGraph )
3 1 2 syl 
 |-  ( G e. USGraph -> G e. UHGraph )