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

Theorem ushgrun 26873
Description: The union 𝑈 of two (undirected) simple hypergraphs 𝐺 and 𝐻 with the same vertex set 𝑉 is a (not necessarily simple) hypergraph with the vertex 𝑉 and the union (𝐸𝐹) of the (indexed) edges. (Contributed by AV, 29-Nov-2020.) (Revised by AV, 24-Oct-2021.)
Hypotheses
Ref Expression
ushgrun.g (𝜑𝐺 ∈ USHGraph)
ushgrun.h (𝜑𝐻 ∈ USHGraph)
ushgrun.e 𝐸 = (iEdg‘𝐺)
ushgrun.f 𝐹 = (iEdg‘𝐻)
ushgrun.vg 𝑉 = (Vtx‘𝐺)
ushgrun.vh (𝜑 → (Vtx‘𝐻) = 𝑉)
ushgrun.i (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)
ushgrun.u (𝜑𝑈𝑊)
ushgrun.v (𝜑 → (Vtx‘𝑈) = 𝑉)
ushgrun.un (𝜑 → (iEdg‘𝑈) = (𝐸𝐹))
Assertion
Ref Expression
ushgrun (𝜑𝑈 ∈ UHGraph)

Proof of Theorem ushgrun
StepHypRef Expression
1 ushgrun.g . . 3 (𝜑𝐺 ∈ USHGraph)
2 ushgruhgr 26866 . . 3 (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
31, 2syl 17 . 2 (𝜑𝐺 ∈ UHGraph)
4 ushgrun.h . . 3 (𝜑𝐻 ∈ USHGraph)
5 ushgruhgr 26866 . . 3 (𝐻 ∈ USHGraph → 𝐻 ∈ UHGraph)
64, 5syl 17 . 2 (𝜑𝐻 ∈ UHGraph)
7 ushgrun.e . 2 𝐸 = (iEdg‘𝐺)
8 ushgrun.f . 2 𝐹 = (iEdg‘𝐻)
9 ushgrun.vg . 2 𝑉 = (Vtx‘𝐺)
10 ushgrun.vh . 2 (𝜑 → (Vtx‘𝐻) = 𝑉)
11 ushgrun.i . 2 (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)
12 ushgrun.u . 2 (𝜑𝑈𝑊)
13 ushgrun.v . 2 (𝜑 → (Vtx‘𝑈) = 𝑉)
14 ushgrun.un . 2 (𝜑 → (iEdg‘𝑈) = (𝐸𝐹))
153, 6, 7, 8, 9, 10, 11, 12, 13, 14uhgrun 26871 1 (𝜑𝑈 ∈ UHGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1538  wcel 2112  cun 3882  cin 3883  c0 4246  dom cdm 5523  cfv 6328  Vtxcvtx 26793  iEdgciedg 26794  UHGraphcuhgr 26853  USHGraphcushgr 26854
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pr 5298
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-br 5034  df-opab 5096  df-id 5428  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fv 6336  df-uhgr 26855  df-ushgr 26856
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator