Theorem uspgrunop 29635

Description: The union of two simple pseudographs (with the same vertex set): If ⟨𝑉, 𝐸⟩ and ⟨𝑉, 𝐹⟩ are simple pseudographs, then ⟨𝑉, 𝐸 ∪ 𝐹⟩ is a pseudograph (the vertex set stays the same, but the edges from both graphs are kept, maybe resulting in two edges between two vertices). (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 16-Oct-2020.) (Revised by AV, 24-Oct-2021.)

Hypotheses

Ref	Expression
uspgrun.g	⊢ (𝜑 → 𝐺 ∈ USPGraph)
uspgrun.h	⊢ (𝜑 → 𝐻 ∈ USPGraph)
uspgrun.e	⊢ 𝐸 = (iEdg‘𝐺)
uspgrun.f	⊢ 𝐹 = (iEdg‘𝐻)
uspgrun.vg	⊢ 𝑉 = (Vtx‘𝐺)
uspgrun.vh	⊢ (𝜑 → (Vtx‘𝐻) = 𝑉)
uspgrun.i	⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)

Assertion

Ref	Expression
uspgrunop	⊢ (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ UPGraph)

Proof of Theorem uspgrunop

Step	Hyp	Ref	Expression
1		uspgrun.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ USPGraph)
2		uspgrupgr 29624	. . 3 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
3	1, 2	syl 18	. 2 ⊢ (𝜑 → 𝐺 ∈ UPGraph)
4		uspgrun.h	. . 3 ⊢ (𝜑 → 𝐻 ∈ USPGraph)
5		uspgrupgr 29624	. . 3 ⊢ (𝐻 ∈ USPGraph → 𝐻 ∈ UPGraph)
6	4, 5	syl 18	. 2 ⊢ (𝜑 → 𝐻 ∈ UPGraph)
7		uspgrun.e	. 2 ⊢ 𝐸 = (iEdg‘𝐺)
8		uspgrun.f	. 2 ⊢ 𝐹 = (iEdg‘𝐻)
9		uspgrun.vg	. 2 ⊢ 𝑉 = (Vtx‘𝐺)
10		uspgrun.vh	. 2 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉)
11		uspgrun.i	. 2 ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅)
12	3, 6, 7, 8, 9, 10, 11	upgrunop 29562	1 ⊢ (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ UPGraph)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ∪ cun 3900   ∩ cin 3901  ∅c0 4282  ⟨cop 4593  dom cdm 5659  ‘cfv 6537  Vtxcvtx 29439  iEdgciedg 29440  UPGraphcupgr 29523  USPGraphcuspgr 29594

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fv 6545  df-1st 7989  df-2nd 7990  df-vtx 29441  df-iedg 29442  df-upgr 29525  df-uspgr 29596

This theorem is used by: (None)