Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  uslgrav Structured version   Visualization version   GIF version

Theorem uslgrav 25866
 Description: The classes of vertices and edges of an undirected simple graph with loops are sets. (Contributed by Alexander van der Vekens, 20-Aug-2017.)
Assertion
Ref Expression
uslgrav (𝑉 USLGrph 𝐸 → (𝑉 ∈ V ∧ 𝐸 ∈ V))

Proof of Theorem uslgrav
StepHypRef Expression
1 reluslgra 25863 . . 3 Rel USLGrph
21brrelexi 5082 . 2 (𝑉 USLGrph 𝐸𝑉 ∈ V)
31brrelex2i 5083 . 2 (𝑉 USLGrph 𝐸𝐸 ∈ V)
42, 3jca 553 1 (𝑉 USLGrph 𝐸 → (𝑉 ∈ V ∧ 𝐸 ∈ V))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∈ wcel 1977  Vcvv 3173   class class class wbr 4583   USLGrph cuslg 25858 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045  df-uslgra 25861 This theorem is referenced by:  edguslgra  25871  uslisushgra  25892  uslisumgra  25893
 Copyright terms: Public domain W3C validator