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

Theorem uhgrunop 29710
Description: The union of two (undirected) hypergraphs (with the same vertex set) represented as ordered pair: If ⟨𝑉, 𝐸⟩ and ⟨𝑉, 𝐹⟩ are hypergraphs, then ⟨𝑉, 𝐸 ∪ 𝐹⟩ is a 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 Alexander van der Vekens, 27-Dec-2017.) (Revised by AV, 11-Oct-2020.) (Revised by AV, 24-Oct-2021.)
Hypotheses
Ref Expression
uhgrun.g (𝜑 → 𝐺 ∈ UHGraph)
uhgrun.h (𝜑 → 𝐻 ∈ UHGraph)
uhgrun.e 𝐸 = (iEdg‘𝐺)
uhgrun.f 𝐹 = (iEdg‘𝐻)
uhgrun.vg 𝑉 = (Vtx‘𝐺)
uhgrun.vh (𝜑 → (Vtx‘𝐻) = 𝑉)
uhgrun.i (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)
Assertion
Ref Expression
uhgrunop (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ UHGraph)

Proof of Theorem uhgrunop
StepHypRef Expression
1 uhgrun.g . 2 (𝜑 → 𝐺 ∈ UHGraph)
2 uhgrun.h . 2 (𝜑 → 𝐻 ∈ UHGraph)
3 uhgrun.e . 2 𝐸 = (iEdg‘𝐺)
4 uhgrun.f . 2 𝐹 = (iEdg‘𝐻)
5 uhgrun.vg . 2 𝑉 = (Vtx‘𝐺)
6 uhgrun.vh . 2 (𝜑 → (Vtx‘𝐻) = 𝑉)
7 uhgrun.i . 2 (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)
8 opex 5439 . . 3 ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ V
98a1i 11 . 2 (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ V)
105fvexi 6930 . . . 4 𝑉 ∈ V
113fvexi 6930 . . . . 5 𝐸 ∈ V
124fvexi 6930 . . . . 5 𝐹 ∈ V
1311, 12unex 7793 . . . 4 (𝐸 ∪ 𝐹) ∈ V
1410, 13pm3.2i 476 . . 3 (𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V)
15 opvtxfv 29639 . . 3 ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (Vtx‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = 𝑉)
1614, 15mp1i 14 . 2 (𝜑 → (Vtx‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = 𝑉)
17 opiedgfv 29642 . . 3 ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (iEdg‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = (𝐸 ∪ 𝐹))
1814, 17mp1i 14 . 2 (𝜑 → (iEdg‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = (𝐸 ∪ 𝐹))
191, 2, 3, 4, 5, 6, 7, 9, 16, 18uhgrun 29709 1 (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ UHGraph)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  ⟨cop 4840  dom cdm 5658  ‘cfv 6566  Vtxcvtx 29631  iEdgciedg 29632  UHGraphcuhgr 29691
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 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-1st 8035  df-2nd 8036  df-vtx 29633  df-iedg 29634  df-uhgr 29693
This theorem is used by:  ushgrunop  29712
  Copyright terms: Public domain W3C validator