Theorem 1vgrex 29149

Description: A graph with at least one vertex is a set. (Contributed by AV, 2-Mar-2021.)

Hypothesis

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

Assertion

Ref	Expression
1vgrex	⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V)

Proof of Theorem 1vgrex

Step	Hyp	Ref	Expression
1		elfvex 6898	. 2 ⊢ (𝑁 ∈ (Vtx‘𝐺) → 𝐺 ∈ V)
2		1vgrex.v	. 2 ⊢ 𝑉 = (Vtx‘𝐺)
3	1, 2	eleq2s 2879	1 ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V)

Syntax hints:   → wi 4   = wceq 1559   ∈ wcel 2141  Vcvv 3453  ‘cfv 6517  Vtxcvtx 29143

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-nul 5255  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-dm 5655  df-iota 6473  df-fv 6525

This theorem is referenced by:  upgr1e  29260  uspgr1e  29391  nbgrval  29483  cplgr1vlem  29576  vtxdgval  29615  vtxdgelxnn0  29619  wlkson  29801  trlsonfval  29850  pthsonfval  29886  spthson  29887  2wlkd  30082  is0wlk  30265  0wlkon  30268  is0trl  30271  0trlon  30272  0pthon  30275  0clwlkv  30279  1wlkd  30289  3wlkd  30318  wlkl0  30515  clnbgrval  48408  isgrtri  48529