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

Theorem uhgrf 26002
Description: The edge function of an undirected hypergraph is a function into the power set of the set of vertices. (Contributed by Alexander van der Vekens, 26-Dec-2017.) (Revised by AV, 9-Oct-2020.)
Hypotheses
Ref Expression
uhgrf.v 𝑉 = (Vtx‘𝐺)
uhgrf.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
uhgrf (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))

Proof of Theorem uhgrf
StepHypRef Expression
1 uhgrf.v . . 3 𝑉 = (Vtx‘𝐺)
2 uhgrf.e . . 3 𝐸 = (iEdg‘𝐺)
31, 2isuhgr 26000 . 2 (𝐺 ∈ UHGraph → (𝐺 ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
43ibi 256 1 (𝐺 ∈ UHGraph → 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅}))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1523  wcel 2030  cdif 3604  c0 3948  𝒫 cpw 4191  {csn 4210  dom cdm 5143  wf 5922  cfv 5926  Vtxcvtx 25919  iEdgciedg 25920  UHGraphcuhgr 25996
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-nul 4822
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fv 5934  df-uhgr 25998
This theorem is referenced by:  uhgrss  26004  uhgrfun  26006  uhgrn0  26007  uhgr0vb  26012  uhgrun  26014  uhgredgn0  26068  2pthon3v  26908
  Copyright terms: Public domain W3C validator