Theorem iscusgr 29503

Description: The property of being a complete simple graph. (Contributed by AV, 1-Nov-2020.)

Assertion

Ref	Expression
iscusgr	⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph))

Proof of Theorem iscusgr

Step	Hyp	Ref	Expression
1		df-cusgr 29497	. 2 ⊢ ComplUSGraph = (USGraph ∩ ComplGraph)
2	1	elin2 4157	1 ⊢ (𝐺 ∈ ComplUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝐺 ∈ ComplGraph))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∈ wcel 2114  USGraphcusgr 29234  ComplGraphccplgr 29494  ComplUSGraphccusgr 29495

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3444  df-in 3910  df-cusgr 29497

This theorem is referenced by:  cusgrusgr  29504  cusgrcplgr  29505  iscusgrvtx  29506  cusgruvtxb  29507  iscusgredg  29508  cusgr0  29511  cusgr0v  29513  cusgr1v  29516  cusgrop  29523  cusgrexi  29528  structtocusgr  29531  cusgrres  29534