Description: There is an Eulerian path on an empty graph, i.e. a graph with at least one vertex, but without an edge. (Contributed by Mario Carneiro, 7-Apr-2015) (Revised by AV, 5-Mar-2021) (Proof shortened by AV, 30-Oct-2021)
Ref | Expression | ||
---|---|---|---|
Hypotheses | eupth0.v | |
|
eupth0.i | |
||
Assertion | eupth0 | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eupth0.v | |
|
2 | eupth0.i | |
|
3 | eqidd | |
|
4 | 1 | is0wlk | |
5 | 3 4 | mpancom | |
6 | f1o0 | |
|
7 | eqidd | |
|
8 | hash0 | |
|
9 | 8 | oveq2i | |
10 | fzo0 | |
|
11 | 9 10 | eqtri | |
12 | 11 | a1i | |
13 | dmeq | |
|
14 | dm0 | |
|
15 | 13 14 | eqtrdi | |
16 | 7 12 15 | f1oeq123d | |
17 | 6 16 | mpbiri | |
18 | 5 17 | anim12i | |
19 | 2 | iseupthf1o | |
20 | 18 19 | sylibr | |