Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > umgrunop | Structured version Visualization version GIF version |
Description: The union of two multigraphs (with the same vertex set): If 〈𝑉, 𝐸〉 and 〈𝑉, 𝐹〉 are multigraphs, then 〈𝑉, 𝐸 ∪ 𝐹〉 is a multigraph (the vertex set stays the same, but the edges from both graphs are kept). (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 25-Nov-2020.) |
Ref | Expression |
---|---|
umgrun.g | ⊢ (𝜑 → 𝐺 ∈ UMGraph) |
umgrun.h | ⊢ (𝜑 → 𝐻 ∈ UMGraph) |
umgrun.e | ⊢ 𝐸 = (iEdg‘𝐺) |
umgrun.f | ⊢ 𝐹 = (iEdg‘𝐻) |
umgrun.vg | ⊢ 𝑉 = (Vtx‘𝐺) |
umgrun.vh | ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
umgrun.i | ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) |
Ref | Expression |
---|---|
umgrunop | ⊢ (𝜑 → 〈𝑉, (𝐸 ∪ 𝐹)〉 ∈ UMGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | umgrun.g | . 2 ⊢ (𝜑 → 𝐺 ∈ UMGraph) | |
2 | umgrun.h | . 2 ⊢ (𝜑 → 𝐻 ∈ UMGraph) | |
3 | umgrun.e | . 2 ⊢ 𝐸 = (iEdg‘𝐺) | |
4 | umgrun.f | . 2 ⊢ 𝐹 = (iEdg‘𝐻) | |
5 | umgrun.vg | . 2 ⊢ 𝑉 = (Vtx‘𝐺) | |
6 | umgrun.vh | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) | |
7 | umgrun.i | . 2 ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) | |
8 | opex 5359 | . . 3 ⊢ 〈𝑉, (𝐸 ∪ 𝐹)〉 ∈ V | |
9 | 8 | a1i 11 | . 2 ⊢ (𝜑 → 〈𝑉, (𝐸 ∪ 𝐹)〉 ∈ V) |
10 | 5 | fvexi 6687 | . . . 4 ⊢ 𝑉 ∈ V |
11 | 3 | fvexi 6687 | . . . . 5 ⊢ 𝐸 ∈ V |
12 | 4 | fvexi 6687 | . . . . 5 ⊢ 𝐹 ∈ V |
13 | 11, 12 | unex 7472 | . . . 4 ⊢ (𝐸 ∪ 𝐹) ∈ V |
14 | 10, 13 | pm3.2i 473 | . . 3 ⊢ (𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) |
15 | opvtxfv 26792 | . . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (Vtx‘〈𝑉, (𝐸 ∪ 𝐹)〉) = 𝑉) | |
16 | 14, 15 | mp1i 13 | . 2 ⊢ (𝜑 → (Vtx‘〈𝑉, (𝐸 ∪ 𝐹)〉) = 𝑉) |
17 | opiedgfv 26795 | . . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (iEdg‘〈𝑉, (𝐸 ∪ 𝐹)〉) = (𝐸 ∪ 𝐹)) | |
18 | 14, 17 | mp1i 13 | . 2 ⊢ (𝜑 → (iEdg‘〈𝑉, (𝐸 ∪ 𝐹)〉) = (𝐸 ∪ 𝐹)) |
19 | 1, 2, 3, 4, 5, 6, 7, 9, 16, 18 | umgrun 26908 | 1 ⊢ (𝜑 → 〈𝑉, (𝐸 ∪ 𝐹)〉 ∈ UMGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 Vcvv 3497 ∪ cun 3937 ∩ cin 3938 ∅c0 4294 〈cop 4576 dom cdm 5558 ‘cfv 6358 Vtxcvtx 26784 iEdgciedg 26785 UMGraphcumgr 26869 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-card 9371 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-2 11703 df-n0 11901 df-z 11985 df-uz 12247 df-fz 12896 df-hash 13694 df-vtx 26786 df-iedg 26787 df-umgr 26871 |
This theorem is referenced by: usgrunop 26976 |
Copyright terms: Public domain | W3C validator |