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

Theorem uspgrushgr 26974
 Description: A simple pseudograph is an undirected simple hypergraph. (Contributed by AV, 19-Jan-2020.) (Revised by AV, 15-Oct-2020.)
Assertion
Ref Expression
uspgrushgr (𝐺 ∈ USPGraph → 𝐺 ∈ USHGraph)

Proof of Theorem uspgrushgr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2824 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2824 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2isuspgr 26951 . . . 4 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
4 ssrab2 4042 . . . . 5 {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 (Vtx‘𝐺) ∖ {∅})
5 f1ss 6571 . . . . 5 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 (Vtx‘𝐺) ∖ {∅})) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
64, 5mpan2 690 . . . 4 ((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
73, 6syl6bi 256 . . 3 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅})))
81, 2isushgr 26860 . . 3 (𝐺 ∈ USPGraph → (𝐺 ∈ USHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅})))
97, 8sylibrd 262 . 2 (𝐺 ∈ USPGraph → (𝐺 ∈ USPGraph → 𝐺 ∈ USHGraph))
109pm2.43i 52 1 (𝐺 ∈ USPGraph → 𝐺 ∈ USHGraph)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∈ wcel 2115  {crab 3137   ∖ cdif 3916   ⊆ wss 3919  ∅c0 4276  𝒫 cpw 4522  {csn 4550   class class class wbr 5052  dom cdm 5542  –1-1→wf1 6340  ‘cfv 6343   ≤ cle 10674  2c2 11689  ♯chash 13695  Vtxcvtx 26795  iEdgciedg 26796  USHGraphcushgr 26856  USPGraphcuspgr 26947 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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-nul 5196 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ral 3138  df-rex 3139  df-rab 3142  df-v 3482  df-sbc 3759  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4277  df-pw 4524  df-sn 4551  df-pr 4553  df-op 4557  df-uni 4825  df-br 5053  df-opab 5115  df-rel 5549  df-cnv 5550  df-co 5551  df-dm 5552  df-rn 5553  df-iota 6302  df-fun 6345  df-fn 6346  df-f 6347  df-f1 6348  df-fv 6351  df-ushgr 26858  df-uspgr 26949 This theorem is referenced by:  uspgrupgrushgr  26976  usgredgedg  27026  vtxdusgrfvedg  27287  1loopgrvd2  27299  isomuspgr  44282
 Copyright terms: Public domain W3C validator