Theorem cusgrusgr 29555

Description: A complete simple graph is a simple graph. (Contributed by Alexander van der Vekens, 13-Oct-2017.) (Revised by AV, 1-Nov-2020.)

Assertion

Ref	Expression
cusgrusgr	⊢ (𝐺 ∈ ComplUSGraph → 𝐺 ∈ USGraph)

Proof of Theorem cusgrusgr

Step	Hyp	Ref	Expression
1		iscusgr 29554	. 2 ⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph))
2	1	simplbi 499	1 ⊢ (𝐺 ∈ ComplUSGraph → 𝐺 ∈ USGraph)

Syntax hints:   → wi 4   ∈ wcel 2132  USGraphcusgr 29285  ComplGraphccplgr 29545  ComplUSGraphccusgr 29546

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-ext 2724

This theorem depends on definitions:  df-bi 209  df-an 399  df-tru 1553  df-ex 1790  df-sb 2081  df-clab 2731  df-cleq 2744  df-clel 2827  df-v 3446  df-in 3902  df-cusgr 29548

This theorem is referenced by:  cusgrres  29584  cusgrsizeindslem  29587  cusgrsizeinds  29588  cusgrsize  29590  cusgrrusgr  29717  cusgredgex  35410  cusgr3cyclex  35424  cusgracyclt3v  35444