Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > umgrun | Structured version Visualization version GIF version |
Description: The union 𝑈 of two multigraphs 𝐺 and 𝐻 with the same vertex set 𝑉 is a multigraph with the vertex 𝑉 and the union (𝐸 ∪ 𝐹) of the (indexed) edges. (Contributed 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 𝐹) = ∅) |
umgrun.u | ⊢ (𝜑 → 𝑈 ∈ 𝑊) |
umgrun.v | ⊢ (𝜑 → (Vtx‘𝑈) = 𝑉) |
umgrun.un | ⊢ (𝜑 → (iEdg‘𝑈) = (𝐸 ∪ 𝐹)) |
Ref | Expression |
---|---|
umgrun | ⊢ (𝜑 → 𝑈 ∈ UMGraph ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | umgrun.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ UMGraph ) | |
2 | umgrun.vg | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
3 | umgrun.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
4 | 2, 3 | umgrf 25993 | . . . . 5 ⊢ (𝐺 ∈ UMGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) |
5 | 1, 4 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐸:dom 𝐸⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) |
6 | umgrun.h | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ UMGraph ) | |
7 | eqid 2622 | . . . . . . 7 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻) | |
8 | umgrun.f | . . . . . . 7 ⊢ 𝐹 = (iEdg‘𝐻) | |
9 | 7, 8 | umgrf 25993 | . . . . . 6 ⊢ (𝐻 ∈ UMGraph → 𝐹:dom 𝐹⟶{𝑥 ∈ 𝒫 (Vtx‘𝐻) ∣ (#‘𝑥) = 2}) |
10 | 6, 9 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝐹:dom 𝐹⟶{𝑥 ∈ 𝒫 (Vtx‘𝐻) ∣ (#‘𝑥) = 2}) |
11 | umgrun.vh | . . . . . . . . 9 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) | |
12 | 11 | eqcomd 2628 | . . . . . . . 8 ⊢ (𝜑 → 𝑉 = (Vtx‘𝐻)) |
13 | 12 | pweqd 4163 | . . . . . . 7 ⊢ (𝜑 → 𝒫 𝑉 = 𝒫 (Vtx‘𝐻)) |
14 | 13 | rabeqdv 3194 | . . . . . 6 ⊢ (𝜑 → {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} = {𝑥 ∈ 𝒫 (Vtx‘𝐻) ∣ (#‘𝑥) = 2}) |
15 | 14 | feq3d 6032 | . . . . 5 ⊢ (𝜑 → (𝐹:dom 𝐹⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ 𝐹:dom 𝐹⟶{𝑥 ∈ 𝒫 (Vtx‘𝐻) ∣ (#‘𝑥) = 2})) |
16 | 10, 15 | mpbird 247 | . . . 4 ⊢ (𝜑 → 𝐹:dom 𝐹⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) |
17 | umgrun.i | . . . 4 ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) | |
18 | 5, 16, 17 | fun2d 6068 | . . 3 ⊢ (𝜑 → (𝐸 ∪ 𝐹):(dom 𝐸 ∪ dom 𝐹)⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) |
19 | umgrun.un | . . . 4 ⊢ (𝜑 → (iEdg‘𝑈) = (𝐸 ∪ 𝐹)) | |
20 | 19 | dmeqd 5326 | . . . . 5 ⊢ (𝜑 → dom (iEdg‘𝑈) = dom (𝐸 ∪ 𝐹)) |
21 | dmun 5331 | . . . . 5 ⊢ dom (𝐸 ∪ 𝐹) = (dom 𝐸 ∪ dom 𝐹) | |
22 | 20, 21 | syl6eq 2672 | . . . 4 ⊢ (𝜑 → dom (iEdg‘𝑈) = (dom 𝐸 ∪ dom 𝐹)) |
23 | umgrun.v | . . . . . 6 ⊢ (𝜑 → (Vtx‘𝑈) = 𝑉) | |
24 | 23 | pweqd 4163 | . . . . 5 ⊢ (𝜑 → 𝒫 (Vtx‘𝑈) = 𝒫 𝑉) |
25 | 24 | rabeqdv 3194 | . . . 4 ⊢ (𝜑 → {𝑥 ∈ 𝒫 (Vtx‘𝑈) ∣ (#‘𝑥) = 2} = {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) |
26 | 19, 22, 25 | feq123d 6034 | . . 3 ⊢ (𝜑 → ((iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ 𝒫 (Vtx‘𝑈) ∣ (#‘𝑥) = 2} ↔ (𝐸 ∪ 𝐹):(dom 𝐸 ∪ dom 𝐹)⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})) |
27 | 18, 26 | mpbird 247 | . 2 ⊢ (𝜑 → (iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ 𝒫 (Vtx‘𝑈) ∣ (#‘𝑥) = 2}) |
28 | umgrun.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑊) | |
29 | eqid 2622 | . . . 4 ⊢ (Vtx‘𝑈) = (Vtx‘𝑈) | |
30 | eqid 2622 | . . . 4 ⊢ (iEdg‘𝑈) = (iEdg‘𝑈) | |
31 | 29, 30 | isumgrs 25991 | . . 3 ⊢ (𝑈 ∈ 𝑊 → (𝑈 ∈ UMGraph ↔ (iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ 𝒫 (Vtx‘𝑈) ∣ (#‘𝑥) = 2})) |
32 | 28, 31 | syl 17 | . 2 ⊢ (𝜑 → (𝑈 ∈ UMGraph ↔ (iEdg‘𝑈):dom (iEdg‘𝑈)⟶{𝑥 ∈ 𝒫 (Vtx‘𝑈) ∣ (#‘𝑥) = 2})) |
33 | 27, 32 | mpbird 247 | 1 ⊢ (𝜑 → 𝑈 ∈ UMGraph ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 = wceq 1483 ∈ wcel 1990 {crab 2916 ∪ cun 3572 ∩ cin 3573 ∅c0 3915 𝒫 cpw 4158 dom cdm 5114 ⟶wf 5884 ‘cfv 5888 2c2 11070 #chash 13117 Vtxcvtx 25874 iEdgciedg 25875 UMGraph cumgr 25976 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-hash 13118 df-umgr 25978 |
This theorem is referenced by: umgrunop 26016 usgrun 26082 |
Copyright terms: Public domain | W3C validator |