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

Theorem uhgr0e 29156
Description: The empty graph, with vertices but no edges, is a hypergraph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 25-Nov-2020.)
Hypotheses
Ref Expression
uhgr0e.g (𝜑𝐺𝑊)
uhgr0e.e (𝜑 → (iEdg‘𝐺) = ∅)
Assertion
Ref Expression
uhgr0e (𝜑𝐺 ∈ UHGraph)

Proof of Theorem uhgr0e
StepHypRef Expression
1 f0 6723 . . 3 ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})
2 dm0 5877 . . . 4 dom ∅ = ∅
32feq2i 6662 . . 3 (∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
41, 3mpbir 231 . 2 ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})
5 uhgr0e.g . . . 4 (𝜑𝐺𝑊)
6 eqid 2737 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
7 eqid 2737 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
86, 7isuhgr 29145 . . . 4 (𝐺𝑊 → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
95, 8syl 17 . . 3 (𝜑 → (𝐺 ∈ UHGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
10 uhgr0e.e . . . 4 (𝜑 → (iEdg‘𝐺) = ∅)
11 id 22 . . . . 5 ((iEdg‘𝐺) = ∅ → (iEdg‘𝐺) = ∅)
12 dmeq 5860 . . . . 5 ((iEdg‘𝐺) = ∅ → dom (iEdg‘𝐺) = dom ∅)
1311, 12feq12d 6658 . . . 4 ((iEdg‘𝐺) = ∅ → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
1410, 13syl 17 . . 3 (𝜑 → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
159, 14bitrd 279 . 2 (𝜑 → (𝐺 ∈ UHGraph ↔ ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})))
164, 15mpbiri 258 1 (𝜑𝐺 ∈ UHGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  cdif 3900  c0 4287  𝒫 cpw 4556  {csn 4582  dom cdm 5632  wf 6496  cfv 6500  Vtxcvtx 29081  iEdgciedg 29082  UHGraphcuhgr 29141
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-uhgr 29143
This theorem is referenced by:  uhgr0vb  29157
  Copyright terms: Public domain W3C validator