Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > df-rusgr | Structured version Visualization version Unicode version |
Description: Define the "k-regular simple graph" predicate, which is true for a simple graph being k-regular: read RegUSGraph as is a -regular simple graph. (Contributed by Alexander van der Vekens, 6-Jul-2018.) (Revised by AV, 18-Dec-2020.) |
Ref | Expression |
---|---|
df-rusgr | RegUSGraph USGraph RegGraph |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | crusgr 26452 | . 2 RegUSGraph | |
2 | vg | . . . . . 6 | |
3 | 2 | cv 1482 | . . . . 5 |
4 | cusgr 26044 | . . . . 5 USGraph | |
5 | 3, 4 | wcel 1990 | . . . 4 USGraph |
6 | vk | . . . . . 6 | |
7 | 6 | cv 1482 | . . . . 5 |
8 | crgr 26451 | . . . . 5 RegGraph | |
9 | 3, 7, 8 | wbr 4653 | . . . 4 RegGraph |
10 | 5, 9 | wa 384 | . . 3 USGraph RegGraph |
11 | 10, 2, 6 | copab 4712 | . 2 USGraph RegGraph |
12 | 1, 11 | wceq 1483 | 1 RegUSGraph USGraph RegGraph |
Colors of variables: wff setvar class |
This definition is referenced by: isrusgr 26457 rusgrprop 26458 |
Copyright terms: Public domain | W3C validator |