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

Theorem upgr0eop 29199
Description: The empty graph, with vertices but no edges, is a pseudograph. The empty graph is actually a simple graph, see usgr0eop 29331, 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 5419 . . 3 𝑉, ∅⟩ ∈ V
21a1i 11 . 2 (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ V)
3 0ex 5254 . . 3 ∅ ∈ V
4 opiedgfv 29092 . . 3 ((𝑉𝑊 ∧ ∅ ∈ V) → (iEdg‘⟨𝑉, ∅⟩) = ∅)
53, 4mpan2 692 . 2 (𝑉𝑊 → (iEdg‘⟨𝑉, ∅⟩) = ∅)
62, 5upgr0e 29196 1 (𝑉𝑊 → ⟨𝑉, ∅⟩ ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3442  c0 4287  cop 4588  cfv 6500  iEdgciedg 29082  UPGraphcupgr 29165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-i2m1 11106  ax-1ne0 11107  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-2nd 7944  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-2 12220  df-iedg 29084  df-upgr 29167  df-umgr 29168
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator