Database
GRAPH THEORY
Vertices and edges
Vertices and indexed edges
The vertices and edges of a graph represented as extensible structure
funvtxval
Metamath Proof Explorer
Description: The set of vertices of a graph represented as an extensible structure with
vertices as base set and indexed edges. (Contributed by AV , 22-Sep-2020)
(Revised by AV , 7-Jun-2021) (Revised by AV , 12-Nov-2021)
Ref
Expression
Assertion
funvtxval
⊢ Fun ⁡ G ∖ ∅ ∧ Base ndx ef ⁡ ndx ⊆ dom ⁡ G → Vtx ⁡ G = Base G
Proof
Step
Hyp
Ref
Expression
1
slotsbaseefdif
⊢ Base ndx ≠ ef ⁡ ndx
2
fvex
⊢ Base ndx ∈ V
3
fvex
⊢ ef ⁡ ndx ∈ V
4
2 3
funvtxdm2val
⊢ Fun ⁡ G ∖ ∅ ∧ Base ndx ≠ ef ⁡ ndx ∧ Base ndx ef ⁡ ndx ⊆ dom ⁡ G → Vtx ⁡ G = Base G
5
1 4
mp3an2
⊢ Fun ⁡ G ∖ ∅ ∧ Base ndx ef ⁡ ndx ⊆ dom ⁡ G → Vtx ⁡ G = Base G