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

Theorem usgr0e 26128
Description: The empty graph, with vertices but no edges, is a simple graph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 16-Oct-2020.) (Proof shortened by AV, 25-Nov-2020.)
Hypotheses
Ref Expression
usgr0e.g (𝜑𝐺𝑊)
usgr0e.e (𝜑 → (iEdg‘𝐺) = ∅)
Assertion
Ref Expression
usgr0e (𝜑𝐺 ∈ USGraph )

Proof of Theorem usgr0e
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 usgr0e.e . . 3 (𝜑 → (iEdg‘𝐺) = ∅)
21f10d 6170 . 2 (𝜑 → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2})
3 usgr0e.g . . 3 (𝜑𝐺𝑊)
4 eqid 2622 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
5 eqid 2622 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
64, 5isusgr 26048 . . 3 (𝐺𝑊 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2}))
73, 6syl 17 . 2 (𝜑 → (𝐺 ∈ USGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (#‘𝑥) = 2}))
82, 7mpbird 247 1 (𝜑𝐺 ∈ USGraph )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196   = wceq 1483  wcel 1990  {crab 2916  cdif 3571  c0 3915  𝒫 cpw 4158  {csn 4177  dom cdm 5114  1-1wf1 5885  cfv 5888  2c2 11070  #chash 13117  Vtxcvtx 25874  iEdgciedg 25875   USGraph cusgr 26044
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fv 5896  df-usgr 26046
This theorem is referenced by:  usgr0vb  26129  uhgr0vusgr  26134  usgr0eop  26138  edg0usgr  26145  usgr1v  26148  griedg0ssusgr  26157  cusgr1v  26327  frgr0v  27125
  Copyright terms: Public domain W3C validator