Theorem uhgraop 25833

Description: The property of being an undirected hypergraph represented as an ordered pair. The representation as an ordered pair is the usual representation of a graph, see section I.1 of [Bollobas] p. 1. (Contributed by AV, 1-Jan-2020.)

Assertion

Ref	Expression
uhgraop	⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGrph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))

Proof of Theorem uhgraop

Step	Hyp	Ref	Expression
1		df-br 4584	. 2 ⊢ (𝑉 UHGrph 𝐸 ↔ ⟨𝑉, 𝐸⟩ ∈ UHGrph )
2		isuhgra 25827	. 2 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (𝑉 UHGrph 𝐸 ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
3	1, 2	syl5bbr 273	1 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGrph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∈ wcel 1977   ∖ cdif 3537  ∅c0 3874  𝒫 cpw 4108  {csn 4125  ⟨cop 4131   class class class wbr 4583  dom cdm 5038  ⟶wf 5800   UHGrph cuhg 25819

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-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

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-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rab 2905  df-v 3175  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-br 4584  df-opab 4644  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-fun 5806  df-fn 5807  df-f 5808  df-uhgra 25821

This theorem is referenced by: (None)