This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.
Description: Define the vertex degree function for a graph. To be appropriate for arbitrary hypergraphs, we have to double-count those edges that contain u "twice" (i.e. self-loops), this being represented as a singleton as the edge's value. Since the degree of a vertex can be (positive) infinity (if the graph containing the vertex is not of finite size), the extended addition +e is used for the summation of the number of "ordinary" edges" and the number of "loops". (Contributed by Mario Carneiro, 12-Mar-2015) (Revised by Alexander van der Vekens, 20-Dec-2017) (Revised by AV, 9-Dec-2020)
| Ref | Expression | ||
|---|---|---|---|
| Assertion | df-vtxdg |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 0 | cvtxdg | ||
| 1 | vg | ||
| 2 | cvv | ||
| 3 | cvtx | ||
| 4 | 1 | cv | |
| 5 | 4 3 | cfv | |
| 6 | vv | ||
| 7 | ciedg | ||
| 8 | 4 7 | cfv | |
| 9 | ve | ||
| 10 | vu | ||
| 11 | 6 | cv | |
| 12 | chash | ||
| 13 | vx | ||
| 14 | 9 | cv | |
| 15 | 14 | cdm | |
| 16 | 10 | cv | |
| 17 | 13 | cv | |
| 18 | 17 14 | cfv | |
| 19 | 16 18 | wcel | |
| 20 | 19 13 15 | crab | |
| 21 | 20 12 | cfv | |
| 22 | cxad | ||
| 23 | 16 | csn | |
| 24 | 18 23 | wceq | |
| 25 | 24 13 15 | crab | |
| 26 | 25 12 | cfv | |
| 27 | 21 26 22 | co | |
| 28 | 10 11 27 | cmpt | |
| 29 | 9 8 28 | csb | |
| 30 | 6 5 29 | csb | |
| 31 | 1 2 30 | cmpt | |
| 32 | 0 31 | wceq |