Theorem 1vgrex 29330

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 6918	. 2 ⊢ (𝑁 ∈ (Vtx‘𝐺) → 𝐺 ∈ V)
2		1vgrex.v	. 2 ⊢ 𝑉 = (Vtx‘𝐺)
3	1, 2	eleq2s 2881	1 ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V)

Syntax hints:   → wi 4   = wceq 1570   ∈ wcel 2143  Vcvv 3455  ‘cfv 6538  Vtxcvtx 29324

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-nul 5270  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-dm 5673  df-iota 6494  df-fv 6546

This theorem is referenced by:  upgr1e  29441  uspgr1e  29572  nbgrval  29664  cplgr1vlem  29757  vtxdgval  29796  vtxdgelxnn0  29800  wlkson  29982  trlsonfval  30031  pthsonfval  30067  spthson  30068  2wlkd  30263  is0wlk  30446  0wlkon  30449  is0trl  30452  0trlon  30453  0pthon  30456  0clwlkv  30460  1wlkd  30470  3wlkd  30499  wlkl0  30696  clnbgrval  48564  isgrtri  48685