Definition df-cusgr 26232

Description: Define the class of all complete simple graphs. A simple graph is called complete if every pair of distinct vertices is connected by a (unique) edge, see definition in section 1.1 of [Diestel] p. 3. In contrast, the definition in section I.1 of [Bollobas] p. 3 is based on the size of (finite) complete graphs, see cusgrsize 26350. (Contributed by Alexander van der Vekens, 12-Oct-2017.) (Revised by AV, 24-Oct-2020.)

Assertion

Ref	Expression
df-cusgr	|- ComplUSGraph = { g e. USGraph | g e. ComplGraph }

Detailed syntax breakdown of Definition df-cusgr

Step	Hyp	Ref	Expression
1		ccusgr 26227	. 2 class ComplUSGraph
2		vg	. . . . 5 setvar g
3	2	cv 1482	. . . 4 class g
4		ccplgr 26226	. . . 4 class ComplGraph
5	3, 4	wcel 1990	. . 3 wff g e. ComplGraph
6		cusgr 26044	. . 3 class USGraph
7	5, 2, 6	crab 2916	. 2 class { g e. USGraph | g e. ComplGraph }
8	1, 7	wceq 1483	1 wff ComplUSGraph = { g e. USGraph | g e. ComplGraph }

This definition is referenced by:  iscusgr  26314