Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 1vgrex | Structured version Visualization version GIF version |
Description: A graph with at least one vertex is a set. (Contributed by AV, 2-Mar-2021.) |
Ref | Expression |
---|---|
1vgrex.v | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
1vgrex | ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfvex 6698 | . 2 ⊢ (𝑁 ∈ (Vtx‘𝐺) → 𝐺 ∈ V) | |
2 | 1vgrex.v | . 2 ⊢ 𝑉 = (Vtx‘𝐺) | |
3 | 1, 2 | eleq2s 2931 | 1 ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 Vcvv 3495 ‘cfv 6350 Vtxcvtx 26775 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-nul 5203 ax-pow 5259 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-dm 5560 df-iota 6309 df-fv 6358 |
This theorem is referenced by: upgr1e 26892 uspgr1e 27020 nbgrval 27112 cplgr1vlem 27205 vtxdgval 27244 vtxdgelxnn0 27248 wlkson 27432 trlsonfval 27481 pthsonfval 27515 spthson 27516 2wlkd 27709 is0wlk 27890 0wlkon 27893 is0trl 27896 0trlon 27897 0pthon 27900 0clwlkv 27904 1wlkd 27914 3wlkd 27943 wlkl0 28140 |
Copyright terms: Public domain | W3C validator |