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

Theorem upgruhgr 26337
Description: An undirected pseudograph is an undirected hypergraph. (Contributed by Alexander van der Vekens, 27-Dec-2017.) (Revised by AV, 10-Oct-2020.)
Assertion
Ref Expression
upgruhgr (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)

Proof of Theorem upgruhgr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2799 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2799 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
31, 2upgrf 26321 . . 3 (𝐺 ∈ UPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
4 ssrab2 3883 . . 3 {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 (Vtx‘𝐺) ∖ {∅})
5 fss 6269 . . 3 (((iEdg‘𝐺):dom (iEdg‘𝐺)⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ∧ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2} ⊆ (𝒫 (Vtx‘𝐺) ∖ {∅})) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
63, 4, 5sylancl 581 . 2 (𝐺 ∈ UPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
71, 2isuhgr 26295 . 2 (𝐺 ∈ UPGraph → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
86, 7mpbird 249 1 (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2157  {crab 3093  cdif 3766  wss 3769  c0 4115  𝒫 cpw 4349  {csn 4368   class class class wbr 4843  dom cdm 5312  wf 6097  cfv 6101  cle 10364  2c2 11368  chash 13370  Vtxcvtx 26231  iEdgciedg 26232  UHGraphcuhgr 26291  UPGraphcupgr 26315
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-nul 4983
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2591  df-eu 2609  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ral 3094  df-rex 3095  df-rab 3098  df-v 3387  df-sbc 3634  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-if 4278  df-pw 4351  df-sn 4369  df-pr 4371  df-op 4375  df-uni 4629  df-br 4844  df-opab 4906  df-rel 5319  df-cnv 5320  df-co 5321  df-dm 5322  df-rn 5323  df-iota 6064  df-fun 6103  df-fn 6104  df-f 6105  df-fv 6109  df-uhgr 26293  df-upgr 26317
This theorem is referenced by:  umgruhgr  26339  upgrle2  26340  edglnl  26379  numedglnl  26380  usgruhgr  26419  subupgr  26521  upgrspan  26527  upgrreslem  26538  upgrres  26540  finsumvtxdg2ssteplem1  26795  finsumvtxdg2size  26800  upgrewlkle2  26856  upgredginwlk  26885  wlkiswwlks1  27124  wlkiswwlksupgr2  27134  eulerpathpr  27585  eulercrct  27587  isomuspgrlem2c  42496
  Copyright terms: Public domain W3C validator