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

Theorem umgr0e 25776
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 6082 . . 3 (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2})
3 f1f 6014 . . 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 2610 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
7 eqid 2610 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
86, 7isumgr 25761 . . 3 (𝐺𝑊 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2}))
95, 8syl 17 . 2 (𝜑 → (𝐺 ∈ UMGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2}))
104, 9mpbird 246 1 (𝜑𝐺 ∈ UMGraph )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195   = wceq 1475  wcel 1977  {crab 2900  cdif 3537  c0 3874  𝒫 cpw 4108  {csn 4125  dom cdm 5038  wf 5800  1-1wf1 5801  cfv 5804  2c2 10947  #chash 12979  Vtxcvtx 25673  iEdgciedg 25674   UMGraph cumgr 25748
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-eu 2462  df-mo 2463  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-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fv 5812  df-umgr 25750
This theorem is referenced by:  upgr0e  25777
  Copyright terms: Public domain W3C validator