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

Theorem uspgrun 29516
Description: The union 𝑈 of two simple pseudographs 𝐺 and 𝐻 with the same vertex set 𝑉 is a pseudograph with the vertex 𝑉 and the union (𝐸𝐹) of the (indexed) edges. (Contributed by AV, 16-Oct-2020.)
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 𝐹) = ∅)
uspgrun.u (𝜑𝑈𝑊)
uspgrun.v (𝜑 → (Vtx‘𝑈) = 𝑉)
uspgrun.un (𝜑 → (iEdg‘𝑈) = (𝐸𝐹))
Assertion
Ref Expression
uspgrun (𝜑𝑈 ∈ UPGraph)

Proof of Theorem uspgrun
StepHypRef Expression
1 uspgrun.g . . 3 (𝜑𝐺 ∈ USPGraph)
2 uspgrupgr 29506 . . 3 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
31, 2syl 18 . 2 (𝜑𝐺 ∈ UPGraph)
4 uspgrun.h . . 3 (𝜑𝐻 ∈ USPGraph)
5 uspgrupgr 29506 . . 3 (𝐻 ∈ USPGraph → 𝐻 ∈ UPGraph)
64, 5syl 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 uspgrun.u . 2 (𝜑𝑈𝑊)
13 uspgrun.v . 2 (𝜑 → (Vtx‘𝑈) = 𝑉)
14 uspgrun.un . 2 (𝜑 → (iEdg‘𝑈) = (𝐸𝐹))
153, 6, 7, 8, 9, 10, 11, 12, 13, 14upgrun 29446 1 (𝜑𝑈 ∈ UPGraph)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  cun 3904  cin 3905  c0 4287  dom cdm 5663  cfv 6538  Vtxcvtx 29324  iEdgciedg 29325  UPGraphcupgr 29408  USPGraphcuspgr 29476
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fv 6546  df-upgr 29410  df-uspgr 29478
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator