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

Theorem umgr0e 26895
Description: The empty graph, with vertices but no edges, is a multigraph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 25-Nov-2020.)
Hypotheses
Ref Expression
umgr0e.g (𝜑𝐺𝑊)
umgr0e.e (𝜑 → (iEdg‘𝐺) = ∅)
Assertion
Ref Expression
umgr0e (𝜑𝐺 ∈ UMGraph)

Proof of Theorem umgr0e
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 umgr0e.e . . . 4 (𝜑 → (iEdg‘𝐺) = ∅)
21f10d 6648 . . 3 (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
3 f1f 6575 . . 3 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
42, 3syl 17 . 2 (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
5 umgr0e.g . . 3 (𝜑𝐺𝑊)
6 eqid 2821 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
7 eqid 2821 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
86, 7isumgr 26880 . . 3 (𝐺𝑊 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
95, 8syl 17 . 2 (𝜑 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}))
104, 9mpbird 259 1 (𝜑𝐺 ∈ UMGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1537  wcel 2114  {crab 3142  cdif 3933  c0 4291  𝒫 cpw 4539  {csn 4567  dom cdm 5555  wf 6351  1-1wf1 6352  cfv 6355  2c2 11693  chash 13691  Vtxcvtx 26781  iEdgciedg 26782  UMGraphcumgr 26866
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fv 6363  df-umgr 26868
This theorem is referenced by:  upgr0e  26896
  Copyright terms: Public domain W3C validator