![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > upgrunop | Structured version Visualization version GIF version |
Description: The union of two pseudographs (with the same vertex set): If ⟨𝑉, 𝐸⟩ and ⟨𝑉, 𝐹⟩ are pseudographs, then ⟨𝑉, 𝐸 ∪ 𝐹⟩ is a pseudograph (the vertex set stays the same, but the edges from both graphs are kept). (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 12-Oct-2020.) (Revised by AV, 24-Oct-2021.) |
Ref | Expression |
---|---|
upgrun.g | ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
upgrun.h | ⊢ (𝜑 → 𝐻 ∈ UPGraph) |
upgrun.e | ⊢ 𝐸 = (iEdg‘𝐺) |
upgrun.f | ⊢ 𝐹 = (iEdg‘𝐻) |
upgrun.vg | ⊢ 𝑉 = (Vtx‘𝐺) |
upgrun.vh | ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
upgrun.i | ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) |
Ref | Expression |
---|---|
upgrunop | ⊢ (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ UPGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | upgrun.g | . 2 ⊢ (𝜑 → 𝐺 ∈ UPGraph) | |
2 | upgrun.h | . 2 ⊢ (𝜑 → 𝐻 ∈ UPGraph) | |
3 | upgrun.e | . 2 ⊢ 𝐸 = (iEdg‘𝐺) | |
4 | upgrun.f | . 2 ⊢ 𝐹 = (iEdg‘𝐻) | |
5 | upgrun.vg | . 2 ⊢ 𝑉 = (Vtx‘𝐺) | |
6 | upgrun.vh | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) | |
7 | upgrun.i | . 2 ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) | |
8 | opex 5464 | . . 3 ⊢ ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ V | |
9 | 8 | a1i 11 | . 2 ⊢ (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ V) |
10 | 5 | fvexi 6905 | . . . 4 ⊢ 𝑉 ∈ V |
11 | 3 | fvexi 6905 | . . . . 5 ⊢ 𝐸 ∈ V |
12 | 4 | fvexi 6905 | . . . . 5 ⊢ 𝐹 ∈ V |
13 | 11, 12 | unex 7736 | . . . 4 ⊢ (𝐸 ∪ 𝐹) ∈ V |
14 | 10, 13 | pm3.2i 470 | . . 3 ⊢ (𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) |
15 | opvtxfv 28532 | . . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (Vtx‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = 𝑉) | |
16 | 14, 15 | mp1i 13 | . 2 ⊢ (𝜑 → (Vtx‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = 𝑉) |
17 | opiedgfv 28535 | . . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (iEdg‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = (𝐸 ∪ 𝐹)) | |
18 | 14, 17 | mp1i 13 | . 2 ⊢ (𝜑 → (iEdg‘⟨𝑉, (𝐸 ∪ 𝐹)⟩) = (𝐸 ∪ 𝐹)) |
19 | 1, 2, 3, 4, 5, 6, 7, 9, 16, 18 | upgrun 28646 | 1 ⊢ (𝜑 → ⟨𝑉, (𝐸 ∪ 𝐹)⟩ ∈ UPGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2105 Vcvv 3473 ∪ cun 3946 ∩ cin 3947 ∅c0 4322 ⟨cop 4634 dom cdm 5676 ‘cfv 6543 Vtxcvtx 28524 iEdgciedg 28525 UPGraphcupgr 28608 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pr 5427 ax-un 7728 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-sbc 3778 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-1st 7978 df-2nd 7979 df-vtx 28526 df-iedg 28527 df-upgr 28610 |
This theorem is referenced by: uspgrunop 28714 |
Copyright terms: Public domain | W3C validator |