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 5347 | . . 3 ⊢ 〈𝑉, (𝐸 ∪ 𝐹)〉 ∈ V | |
9 | 8 | a1i 11 | . 2 ⊢ (𝜑 → 〈𝑉, (𝐸 ∪ 𝐹)〉 ∈ V) |
10 | 5 | fvexi 6677 | . . . 4 ⊢ 𝑉 ∈ V |
11 | 3 | fvexi 6677 | . . . . 5 ⊢ 𝐸 ∈ V |
12 | 4 | fvexi 6677 | . . . . 5 ⊢ 𝐹 ∈ V |
13 | 11, 12 | unex 7458 | . . . 4 ⊢ (𝐸 ∪ 𝐹) ∈ V |
14 | 10, 13 | pm3.2i 471 | . . 3 ⊢ (𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) |
15 | opvtxfv 26716 | . . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (Vtx‘〈𝑉, (𝐸 ∪ 𝐹)〉) = 𝑉) | |
16 | 14, 15 | mp1i 13 | . 2 ⊢ (𝜑 → (Vtx‘〈𝑉, (𝐸 ∪ 𝐹)〉) = 𝑉) |
17 | opiedgfv 26719 | . . 3 ⊢ ((𝑉 ∈ V ∧ (𝐸 ∪ 𝐹) ∈ V) → (iEdg‘〈𝑉, (𝐸 ∪ 𝐹)〉) = (𝐸 ∪ 𝐹)) | |
18 | 14, 17 | mp1i 13 | . 2 ⊢ (𝜑 → (iEdg‘〈𝑉, (𝐸 ∪ 𝐹)〉) = (𝐸 ∪ 𝐹)) |
19 | 1, 2, 3, 4, 5, 6, 7, 9, 16, 18 | umgrun 26832 | 1 ⊢ (𝜑 → 〈𝑉, (𝐸 ∪ 𝐹)〉 ∈ UMGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 Vcvv 3492 ∪ cun 3931 ∩ cin 3932 ∅c0 4288 〈cop 4563 dom cdm 5548 ‘cfv 6348 Vtxcvtx 26708 iEdgciedg 26709 UMGraphcumgr 26793 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-hash 13679 df-vtx 26710 df-iedg 26711 df-umgr 26795 |
This theorem is referenced by: usgrunop 26900 |
Copyright terms: Public domain | W3C validator |