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

Theorem upgr0eop 29401
Description: The empty graph, with vertices but no edges, is a pseudograph. The empty graph is actually a simple graph, see usgr0eop 29533, and therefore also a multigraph (𝐺 ∈ UMGraph). (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 11-Oct-2020.)
Assertion
Ref Expression
upgr0eop (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)

Proof of Theorem upgr0eop
StepHypRef Expression
1 opex 5443 . . 3 𝑉, ∅⟩ ∈ V
21a1i 11 . 2 (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ V)
3 0ex 5269 . . 3 ∅ ∈ V
4 opiedgfv 29294 . . 3 ((𝑉𝑊 ∧ ∅ ∈ V) → (iEdg‘⟨𝑉, ∅⟩) = ∅)
53, 4mpan2 703 . 2 (𝑉𝑊 → (iEdg‘⟨𝑉, ∅⟩) = ∅)
62, 5upgr0e 29398 1 (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  Vcvv 3463  c0 4294  cop 4597  cfv 6534  iEdgciedg 29284  UPGraphcupgr 29367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-i2m1 11164  ax-1ne0 11165  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-ov 7411  df-2nd 7983  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-2 12299  df-iedg 29286  df-upgr 29369  df-umgr 29370
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator