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

Theorem isuhgrop 29681
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.) (Revised by AV, 9-Oct-2020.)
Assertion
Ref Expression
isuhgrop ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))

Proof of Theorem isuhgrop
StepHypRef Expression
1 opex 5437 . . 3 ⟨𝑉, 𝐸⟩ ∈ V
2 eqid 2763 . . . 4 (Vtx‘⟨𝑉, 𝐸⟩) = (Vtx‘⟨𝑉, 𝐸⟩)
3 eqid 2763 . . . 4 (iEdg‘⟨𝑉, 𝐸⟩) = (iEdg‘⟨𝑉, 𝐸⟩)
42, 3isuhgr 29671 . . 3 (⟨𝑉, 𝐸⟩ ∈ V → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ (iEdg‘⟨𝑉, 𝐸⟩):dom (iEdg‘⟨𝑉, 𝐸⟩)⟶(𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∖ {∅})))
51, 4mp1i 14 . 2 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ (iEdg‘⟨𝑉, 𝐸⟩):dom (iEdg‘⟨𝑉, 𝐸⟩)⟶(𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∖ {∅})))
6 opiedgfv 29618 . . 3 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (iEdg‘⟨𝑉, 𝐸⟩) = 𝐸)
76dmeqd 5895 . . 3 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → dom (iEdg‘⟨𝑉, 𝐸⟩) = dom 𝐸)
8 opvtxfv 29615 . . . . 5 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (Vtx‘⟨𝑉, 𝐸⟩) = 𝑉)
98pweqd 4577 . . . 4 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → 𝒫 (Vtx‘⟨𝑉, 𝐸⟩) = 𝒫 𝑉)
109difeq1d 4065 . . 3 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∖ {∅}) = (𝒫 𝑉 ∖ {∅}))
116, 7, 10feq123d 6723 . 2 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → ((iEdg‘⟨𝑉, 𝐸⟩):dom (iEdg‘⟨𝑉, 𝐸⟩)⟶(𝒫 (Vtx‘⟨𝑉, 𝐸⟩) ∖ {∅}) ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
125, 11bitrd 282 1 ((𝑉 ∈ 𝑊 ∧ 𝐸 ∈ 𝑋) → (⟨𝑉, 𝐸⟩ ∈ UHGraph ↔ 𝐸:dom 𝐸⟶(𝒫 𝑉 ∖ {∅})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2147  Vcvv 3454   ∖ cdif 4048  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ⟨cop 4838  dom cdm 5656  ⟶wf 6557  ‘cfv 6561  Vtxcvtx 29607  iEdgciedg 29608  UHGraphcuhgr 29667
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-fv 6569  df-1st 8028  df-2nd 8029  df-vtx 29609  df-iedg 29610  df-uhgr 29669
This theorem is used by:  pliguhgr  31121
  Copyright terms: Public domain W3C validator