Metamath Proof Explorer


Theorem umgr2v2evtx

Description: The set of vertices in a multigraph with two edges connecting the same two vertices. (Contributed by AV, 17-Dec-2020)

Ref Expression
Hypothesis umgr2v2evtx.g G = V 0 A B 1 A B
Assertion umgr2v2evtx V W Vtx G = V

Proof

Step Hyp Ref Expression
1 umgr2v2evtx.g G = V 0 A B 1 A B
2 1 fveq2i Vtx G = Vtx V 0 A B 1 A B
3 prex 0 A B 1 A B V
4 opvtxfv V W 0 A B 1 A B V Vtx V 0 A B 1 A B = V
5 3 4 mpan2 V W Vtx V 0 A B 1 A B = V
6 2 5 syl5eq V W Vtx G = V