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

Theorem uspgrupgr 29468
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 2769 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2769 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2isuspgr 29442 . . . 4 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
4 f1f 6775 . . . 4 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
53, 4biimtrdi 256 . . 3 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
61, 2isupgr 29374 . . 3 (𝐺 ∈ USPGraph → (𝐺 ∈ UPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
75, 6sylibrd 262 . 2 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph))
87pm2.43i 53 1 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2149  {crab 3423  cdif 3910  c0 4294  𝒫 cpw 4567  {csn 4594   class class class wbr 5113  dom cdm 5662  wf 6533  1-1wf1 6534  cfv 6537  cle 11243  2c2 12294  chash 14365  Vtxcvtx 29286  iEdgciedg 29287  UPGraphcupgr 29370  USPGraphcuspgr 29438
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-nul 5271
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fv 6545  df-upgr 29372  df-uspgr 29440
This theorem is referenced by:  uspgrupgrushgr  29469  uspgruhgr  29474  usgrupgr  29475  uspgrun  29478  uspgrunop  29479  uspgredg2vtxeu  29510  1loopgrnb0  29792  uspgr2wlkeq  29935  uspgrn2crct  30097  wlkiswwlks2  30164  wlkiswwlks  30165  wlklnwwlkn  30173  clwlkclwwlk  30293  wlk2v2e  30448  isuspgrim0  48547  isuspgrimlem  48548  upgrimwlklem5  48554  upgrimwlk  48555  grlimprclnbgr  48649  grlimprclnbgrvtx  48652  grlimgredgex  48653  uspgropssxp  48797  uspgrsprf  48799
  Copyright terms: Public domain W3C validator