Metamath Proof Explorer


Theorem 1hegrvtxdg1

Description: The vertex degree of a graph with one hyperedge, case 2: an edge from the given vertex to some other vertex contributes one to the vertex's degree. (Contributed by Mario Carneiro, 12-Mar-2015) (Revised by Alexander van der Vekens, 22-Dec-2017) (Revised by AV, 23-Feb-2021)

Ref Expression
Hypotheses 1hegrvtxdg1.a φAX
1hegrvtxdg1.b φBV
1hegrvtxdg1.c φCV
1hegrvtxdg1.n φBC
1hegrvtxdg1.x φE𝒫V
1hegrvtxdg1.i φiEdgG=AE
1hegrvtxdg1.e φBCE
1hegrvtxdg1.v φVtxG=V
Assertion 1hegrvtxdg1 φVtxDegGB=1

Proof

Step Hyp Ref Expression
1 1hegrvtxdg1.a φAX
2 1hegrvtxdg1.b φBV
3 1hegrvtxdg1.c φCV
4 1hegrvtxdg1.n φBC
5 1hegrvtxdg1.x φE𝒫V
6 1hegrvtxdg1.i φiEdgG=AE
7 1hegrvtxdg1.e φBCE
8 1hegrvtxdg1.v φVtxG=V
9 prid1g BVBBC
10 2 9 syl φBBC
11 7 10 sseldd φBE
12 prid2g CVCBC
13 3 12 syl φCBC
14 7 13 sseldd φCE
15 5 11 14 4 nehash2 φ2E
16 6 8 1 2 5 11 15 1hevtxdg1 φVtxDegGB=1