Database
GRAPH THEORY
Undirected graphs
Finite undirected simple graphs
fusgrvtxfi
Next ⟩
isfusgrf1
Metamath Proof Explorer
Ascii
Unicode
Theorem
fusgrvtxfi
Description:
A finite simple graph has a finite set of vertices.
(Contributed by
AV
, 16-Dec-2020)
Ref
Expression
Hypothesis
isfusgr.v
⊢
V
=
Vtx
⁡
G
Assertion
fusgrvtxfi
⊢
G
∈
FinUSGraph
→
V
∈
Fin
Proof
Step
Hyp
Ref
Expression
1
isfusgr.v
⊢
V
=
Vtx
⁡
G
2
1
isfusgr
⊢
G
∈
FinUSGraph
↔
G
∈
USGraph
∧
V
∈
Fin
3
2
simprbi
⊢
G
∈
FinUSGraph
→
V
∈
Fin