Theorem ushgrf 29394

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

Step	Hyp	Ref	Expression
1		uhgrf.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		uhgrf.e	. . 3 ⊢ 𝐸 = (iEdg‘𝐺)
3	1, 2	isushgr 29392	. 2 ⊢ (𝐺 ∈ USHGraph → (𝐺 ∈ USHGraph ↔ 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅})))
4	3	ibi 270	1 ⊢ (𝐺 ∈ USHGraph → 𝐸:dom 𝐸–1-1→(𝒫 𝑉 ∖ {∅}))

Syntax hints:   → wi 4   = wceq 1570   ∈ wcel 2143   ∖ cdif 3903  ∅c0 4287  𝒫 cpw 4563  {csn 4590  dom cdm 5663  –1-1→wf1 6535  ‘cfv 6538  Vtxcvtx 29327  iEdgciedg 29328  USHGraphcushgr 29388

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-nul 5270

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fv 6546  df-ushgr 29390

This theorem is referenced by:  ushgruhgr  29400  uspgrupgrushgr  29510  ushgredgedg  29560  ushgredgedgloop  29562  gricushgr  48665  ushggricedg  48675