Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ushgrun | Structured version Visualization version Unicode version |
Description: The union of two (undirected) simple hypergraphs and with the same vertex set is a (not necessarily simple) hypergraph with the vertex and the union of the (indexed) edges. (Contributed by AV, 29-Nov-2020.) (Revised by AV, 24-Oct-2021.) |
Ref | Expression |
---|---|
ushgrun.g | USHGraph |
ushgrun.h | USHGraph |
ushgrun.e | iEdg |
ushgrun.f | iEdg |
ushgrun.vg | Vtx |
ushgrun.vh | Vtx |
ushgrun.i | |
ushgrun.u | |
ushgrun.v | Vtx |
ushgrun.un | iEdg |
Ref | Expression |
---|---|
ushgrun | UHGraph |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ushgrun.g | . . 3 USHGraph | |
2 | ushgruhgr 25964 | . . 3 USHGraph UHGraph | |
3 | 1, 2 | syl 17 | . 2 UHGraph |
4 | ushgrun.h | . . 3 USHGraph | |
5 | ushgruhgr 25964 | . . 3 USHGraph UHGraph | |
6 | 4, 5 | syl 17 | . 2 UHGraph |
7 | ushgrun.e | . 2 iEdg | |
8 | ushgrun.f | . 2 iEdg | |
9 | ushgrun.vg | . 2 Vtx | |
10 | ushgrun.vh | . 2 Vtx | |
11 | ushgrun.i | . 2 | |
12 | ushgrun.u | . 2 | |
13 | ushgrun.v | . 2 Vtx | |
14 | ushgrun.un | . 2 iEdg | |
15 | 3, 6, 7, 8, 9, 10, 11, 12, 13, 14 | uhgrun 25969 | 1 UHGraph |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wceq 1483 wcel 1990 cun 3572 cin 3573 c0 3915 cdm 5114 cfv 5888 Vtxcvtx 25874 iEdgciedg 25875 UHGraph cuhgr 25951 USHGraph cushgr 25952 |
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-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 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-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-id 5024 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fv 5896 df-uhgr 25953 df-ushgr 25954 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |