Theorem fusgrvtxfi 29520

Description: A finite simple graph has a finite set of vertices. (Contributed by AV, 16-Dec-2020.)

Hypothesis

Ref	Expression
isfusgr.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
fusgrvtxfi	⊢ (𝐺 ∈ FinUSGraph → 𝑉 ∈ Fin)

Proof of Theorem fusgrvtxfi

Step	Hyp	Ref	Expression
1		isfusgr.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	isfusgr 29519	. 2 ⊢ (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin))
3	2	simprbi 501	1 ⊢ (𝐺 ∈ FinUSGraph → 𝑉 ∈ Fin)

Syntax hints:   → wi 4   = wceq 1560   ∈ wcel 2142  ‘cfv 6521  Fincfn 8927  Vtxcvtx 29197  USGraphcusgr 29350  FinUSGraphcfusgr 29517

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-iota 6477  df-fv 6529  df-fusgr 29518

This theorem is referenced by:  fusgrfupgrfs  29532  nbfusgrlevtxm1  29578  nbfusgrlevtxm2  29579  nbusgrvtxm1  29580  uvtxnm1nbgr  29605  cusgrm1rusgr  29783  wlksnfi  30107  fusgrhashclwwlkn  30281  clwwlkndivn  30282  fusgreghash2wsp  30540  numclwwlk3lem2  30586  numclwwlk4  30588