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

Theorem uhgr0e 29144
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 6715 . . 3 ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})
2 dm0 5869 . . . 4 dom ∅ = ∅
32feq2i 6654 . . 3 (∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}) ↔ ∅:∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
41, 3mpbir 231 . 2 ∅:dom ∅⟶(𝒫 (Vtx‘𝐺) ∖ {∅})
5 uhgr0e.g . . . 4 (𝜑𝐺𝑊)
6 eqid 2736 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
7 eqid 2736 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
86, 7isuhgr 29133 . . . 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 5852 . . . . 5 ((iEdg‘𝐺) = ∅ → dom (iEdg‘𝐺) = dom ∅)
1311, 12feq12d 6650 . . . 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 1541  wcel 2113  cdif 3898  c0 4285  𝒫 cpw 4554  {csn 4580  dom cdm 5624  wf 6488  cfv 6492  Vtxcvtx 29069  iEdgciedg 29070  UHGraphcuhgr 29129
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-mo 2539  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-uhgr 29131
This theorem is referenced by:  uhgr0vb  29145
  Copyright terms: Public domain W3C validator