| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ushgrun | Structured version Visualization version GIF version | ||
| Description: The union 𝑈 of two (undirected) simple hypergraphs 𝐺 and 𝐻 with the same vertex set 𝑉 is a (not necessarily simple) hypergraph with the vertex set 𝑉 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 | ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) |
| ushgrun.u | ⊢ (𝜑 → 𝑈 ∈ 𝑊) |
| ushgrun.v | ⊢ (𝜑 → (Vtx‘𝑈) = 𝑉) |
| ushgrun.un | ⊢ (𝜑 → (iEdg‘𝑈) = (𝐸 ∪ 𝐹)) |
| Ref | Expression |
|---|---|
| ushgrun | ⊢ (𝜑 → 𝑈 ∈ UHGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ushgrun.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ USHGraph) | |
| 2 | ushgruhgr 29324 | . . 3 ⊢ (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝜑 → 𝐺 ∈ UHGraph) |
| 4 | ushgrun.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ USHGraph) | |
| 5 | ushgruhgr 29324 | . . 3 ⊢ (𝐻 ∈ USHGraph → 𝐻 ∈ UHGraph) | |
| 6 | 4, 5 | syl 18 | . 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 ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) | |
| 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 29329 | 1 ⊢ (𝜑 → 𝑈 ∈ UHGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 ∪ cun 3905 ∩ cin 3906 ∅c0 4288 dom cdm 5651 ‘cfv 6525 Vtxcvtx 29251 iEdgciedg 29252 UHGraphcuhgr 29311 USHGraphcushgr 29312 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pr 5394 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fv 6533 df-uhgr 29313 df-ushgr 29314 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |