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

Theorem uhgredgss 26843
Description: The set of edges of a hypergraph is a subset of the power set of vertices without the empty set. (Contributed by AV, 29-Nov-2020.)
Assertion
Ref Expression
uhgredgss (𝐺 ∈ UHGraph → (Edg‘𝐺) ⊆ (𝒫 (Vtx‘𝐺) ∖ {∅}))

Proof of Theorem uhgredgss
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 uhgredgn0 26840 . . 3 ((𝐺 ∈ UHGraph ∧ 𝑥 ∈ (Edg‘𝐺)) → 𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}))
21ex 413 . 2 (𝐺 ∈ UHGraph → (𝑥 ∈ (Edg‘𝐺) → 𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅})))
32ssrdv 3970 1 (𝐺 ∈ UHGraph → (Edg‘𝐺) ⊆ (𝒫 (Vtx‘𝐺) ∖ {∅}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2105  cdif 3930  wss 3933  c0 4288  𝒫 cpw 4535  {csn 4557  cfv 6348  Vtxcvtx 26708  Edgcedg 26759  UHGraphcuhgr 26768
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-fv 6356  df-edg 26760  df-uhgr 26770
This theorem is referenced by:  lfuhgr  32261
  Copyright terms: Public domain W3C validator