Theorem 1vgrex 29096

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

Syntax hints:   → wi 4   = wceq 1547   ∈ wcel 2119  Vcvv 3432  ‘cfv 6492  Vtxcvtx 29090

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-nul 5235  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-dm 5635  df-iota 6448  df-fv 6500

This theorem is referenced by:  upgr1e  29207  uspgr1e  29338  nbgrval  29430  cplgr1vlem  29523  vtxdgval  29562  vtxdgelxnn0  29566  wlkson  29748  trlsonfval  29797  pthsonfval  29833  spthson  29834  2wlkd  30029  is0wlk  30212  0wlkon  30215  is0trl  30218  0trlon  30219  0pthon  30222  0clwlkv  30226  1wlkd  30236  3wlkd  30265  wlkl0  30462  clnbgrval  48320  isgrtri  48441