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

Theorem ushgrf 25729
 Description: The edge function of an undirected simple hypergraph is a function into the power set of the set of vertices. (Contributed by AV, 9-Oct-2020.)
Hypotheses
Ref Expression
uhgrf.v 𝑉 = (Vtx‘𝐺)
uhgrf.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
ushgrf (𝐺 ∈ USHGraph → 𝐸:dom 𝐸1-1→(𝒫 𝑉 ∖ {∅}))

Proof of Theorem ushgrf
StepHypRef Expression
1 uhgrf.v . . 3 𝑉 = (Vtx‘𝐺)
2 uhgrf.e . . 3 𝐸 = (iEdg‘𝐺)
31, 2isushgr 25727 . 2 (𝐺 ∈ USHGraph → (𝐺 ∈ USHGraph ↔ 𝐸:dom 𝐸1-1→(𝒫 𝑉 ∖ {∅})))
43ibi 255 1 (𝐺 ∈ USHGraph → 𝐸:dom 𝐸1-1→(𝒫 𝑉 ∖ {∅}))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1475   ∈ wcel 1977   ∖ cdif 3537  ∅c0 3874  𝒫 cpw 4108  {csn 4125  dom cdm 5038  –1-1→wf1 5801  ‘cfv 5804  Vtxcvtx 25673  iEdgciedg 25674   USHGraph cushgr 25723 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-nul 4717 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fv 5812  df-ushgr 25725 This theorem is referenced by:  ushgruhgr  25735  uspgrupgrushgr  40407  ushgredgedga  40456  ushgredgedgaloop  40458
 Copyright terms: Public domain W3C validator