Description: There is no word over the set of vertices representing a closed walk on vertex X of length 0 in a graph G . (Contributed by AV, 17-Feb-2022) (Revised by AV, 25-Feb-2022)
Ref | Expression | ||
---|---|---|---|
Assertion | clwwlk0on0 | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqeq2 | |
|
2 | 1 | rabbidv | |
3 | oveq1 | |
|
4 | clwwlkn0 | |
|
5 | 3 4 | eqtrdi | |
6 | 5 | rabeqdv | |
7 | clwwlknonmpo | |
|
8 | 0ex | |
|
9 | 8 | rabex | |
10 | 2 6 7 9 | ovmpo | |
11 | rab0 | |
|
12 | 10 11 | eqtrdi | |
13 | 7 | mpondm0 | |
14 | 12 13 | pm2.61i | |