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

Theorem ushgrunop 28845
Description: The union of two (undirected) simple hypergraphs (with the same vertex set) represented as ordered pair: If 𝑉, 𝐸 and 𝑉, 𝐹 are simple hypergraphs, then 𝑉, 𝐸𝐹 is a (not necessarily simple) hypergraph - the vertex set stays the same, but the edges from both graphs are kept, possibly resulting in two edges between two vertices. (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 𝐹) = ∅)
Assertion
Ref Expression
ushgrunop (𝜑 → ⟨𝑉, (𝐸𝐹)⟩ ∈ UHGraph)

Proof of Theorem ushgrunop
StepHypRef Expression
1 ushgrun.g . . 3 (𝜑𝐺 ∈ USHGraph)
2 ushgruhgr 28837 . . 3 (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
31, 2syl 17 . 2 (𝜑𝐺 ∈ UHGraph)
4 ushgrun.h . . 3 (𝜑𝐻 ∈ USHGraph)
5 ushgruhgr 28837 . . 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 𝐹) = ∅)
123, 6, 7, 8, 9, 10, 11uhgrunop 28843 1 (𝜑 → ⟨𝑉, (𝐸𝐹)⟩ ∈ UHGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2098  cun 3941  cin 3942  c0 4317  cop 4629  dom cdm 5669  cfv 6537  Vtxcvtx 28764  iEdgciedg 28765  UHGraphcuhgr 28824  USHGraphcushgr 28825
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420  ax-un 7722
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-sbc 3773  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fv 6545  df-1st 7974  df-2nd 7975  df-vtx 28766  df-iedg 28767  df-uhgr 28826  df-ushgr 28827
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator