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

Theorem uspgrupgr 29261
Description: A simple pseudograph is an undirected pseudograph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 15-Oct-2020.)
Assertion
Ref Expression
uspgrupgr (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)

Proof of Theorem uspgrupgr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2737 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2737 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2isuspgr 29235 . . . 4 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
4 f1f 6730 . . . 4 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
53, 4biimtrdi 253 . . 3 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
61, 2isupgr 29167 . . 3 (𝐺 ∈ USPGraph → (𝐺 ∈ UPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
75, 6sylibrd 259 . 2 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph))
87pm2.43i 52 1 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  {crab 3390  cdif 3887  c0 4274  𝒫 cpw 4542  {csn 4568   class class class wbr 5086  dom cdm 5624  wf 6488  1-1wf1 6489  cfv 6492  cle 11171  2c2 12227  chash 14283  Vtxcvtx 29079  iEdgciedg 29080  UPGraphcupgr 29163  USPGraphcuspgr 29231
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-ext 2709  ax-nul 5241
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-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fv 6500  df-upgr 29165  df-uspgr 29233
This theorem is referenced by:  uspgrupgrushgr  29262  uspgruhgr  29267  usgrupgr  29268  uspgrun  29271  uspgrunop  29272  uspgredg2vtxeu  29303  1loopgrnb0  29586  uspgr2wlkeq  29729  uspgrn2crct  29891  wlkiswwlks2  29958  wlkiswwlks  29959  wlklnwwlkn  29967  clwlkclwwlk  30087  wlk2v2e  30242  isuspgrim0  48382  isuspgrimlem  48383  upgrimwlklem5  48389  upgrimwlk  48390  grlimprclnbgr  48484  grlimprclnbgrvtx  48487  grlimgredgex  48488  uspgropssxp  48632  uspgrsprf  48634
  Copyright terms: Public domain W3C validator