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

Theorem ushgrf 25939
Description: The edge function of an undirected simple hypergraph is a one-to-one 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 25937 . 2 (𝐺 ∈ USHGraph → (𝐺 ∈ USHGraph ↔ 𝐸:dom 𝐸1-1→(𝒫 𝑉 ∖ {∅})))
43ibi 256 1 (𝐺 ∈ USHGraph → 𝐸:dom 𝐸1-1→(𝒫 𝑉 ∖ {∅}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1481  wcel 1988  cdif 3564  c0 3907  𝒫 cpw 4149  {csn 4168  dom cdm 5104  1-1wf1 5873  cfv 5876  Vtxcvtx 25855  iEdgciedg 25856   USHGraph cushgr 25933
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-nul 4780
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-pw 4151  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-f1 5881  df-fv 5884  df-ushgr 25935
This theorem is referenced by:  ushgruhgr  25945  uspgrupgrushgr  26053  ushgredgedg  26102  ushgredgedgloop  26104
  Copyright terms: Public domain W3C validator