Description: A simple graph is complete iff the set of vertices is the set of universal vertices. (Contributed by Alexander van der Vekens, 14-Oct-2017) (Revised by Alexander van der Vekens, 18-Jan-2018) (Revised by AV, 1-Nov-2020)
Ref | Expression | ||
---|---|---|---|
Hypothesis | iscusgrvtx.v | ||
Assertion | cusgruvtxb |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iscusgrvtx.v | ||
2 | iscusgr | ||
3 | ibar | ||
4 | 1 | cplgruvtxb | |
5 | 3 4 | bitr3d | |
6 | 2 5 | syl5bb |