Theorem uhgrunop 29148

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

Step	Hyp	Ref	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 5412	. . 3 ⊢ ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ V
9	8	a1i 11	. 2 ⊢ (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ V)
10	5	fvexi 6848	. . . 4 ⊢ 𝑉 ∈ V
11	3	fvexi 6848	. . . . 5 ⊢ 𝐸 ∈ V
12	4	fvexi 6848	. . . . 5 ⊢ 𝐹 ∈ V
13	11, 12	unex 7689	. . . 4 ⊢ (𝐸 ∪ 𝐹) ∈ V
14	10, 13	pm3.2i 470	. . 3 ⊢ (𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V)
15		opvtxfv 29077	. . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (Vtx‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = 𝑉)
16	14, 15	mp1i 13	. 2 ⊢ (𝜑 → (Vtx‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = 𝑉)
17		opiedgfv 29080	. . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (iEdg‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = (𝐸 ∪ 𝐹))
18	14, 17	mp1i 13	. 2 ⊢ (𝜑 → (iEdg‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = (𝐸 ∪ 𝐹))
19	1, 2, 3, 4, 5, 6, 7, 9, 16, 18	uhgrun 29147	1 ⊢ (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ UHGraph)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  Vcvv 3440   ∪ cun 3899   ∩ cin 3900  ∅c0 4285  ⟨cop 4586  dom cdm 5624  ‘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-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680

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-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  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-in 3908  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-mpt 5180  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-1st 7933  df-2nd 7934  df-vtx 29071  df-iedg 29072  df-uhgr 29131

This theorem is referenced by:  ushgrunop  29150