| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uspgrun | Structured version Visualization version GIF version | ||
| Description: The union 𝑈 of two simple pseudographs 𝐺 and 𝐻 with the same vertex set 𝑉 is a pseudograph with the vertex 𝑉 and the union (𝐸 ∪ 𝐹) of the (indexed) edges. (Contributed by AV, 16-Oct-2020.) |
| Ref | Expression |
|---|---|
| uspgrun.g | ⊢ (𝜑 → 𝐺 ∈ USPGraph) |
| uspgrun.h | ⊢ (𝜑 → 𝐻 ∈ USPGraph) |
| uspgrun.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| uspgrun.f | ⊢ 𝐹 = (iEdg‘𝐻) |
| uspgrun.vg | ⊢ 𝑉 = (Vtx‘𝐺) |
| uspgrun.vh | ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
| uspgrun.i | ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) |
| uspgrun.u | ⊢ (𝜑 → 𝑈 ∈ 𝑊) |
| uspgrun.v | ⊢ (𝜑 → (Vtx‘𝑈) = 𝑉) |
| uspgrun.un | ⊢ (𝜑 → (iEdg‘𝑈) = (𝐸 ∪ 𝐹)) |
| Ref | Expression |
|---|---|
| uspgrun | ⊢ (𝜑 → 𝑈 ∈ UPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uspgrun.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ USPGraph) | |
| 2 | uspgrupgr 29765 | . . 3 ⊢ (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
| 4 | uspgrun.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ USPGraph) | |
| 5 | uspgrupgr 29765 | . . 3 ⊢ (𝐻 ∈ USPGraph → 𝐻 ∈ UPGraph) | |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝜑 → 𝐻 ∈ UPGraph) |
| 7 | uspgrun.e | . 2 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 8 | uspgrun.f | . 2 ⊢ 𝐹 = (iEdg‘𝐻) | |
| 9 | uspgrun.vg | . 2 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 10 | uspgrun.vh | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) | |
| 11 | uspgrun.i | . 2 ⊢ (𝜑 → (dom 𝐸 ∩ dom 𝐹) = ∅) | |
| 12 | uspgrun.u | . 2 ⊢ (𝜑 → 𝑈 ∈ 𝑊) | |
| 13 | uspgrun.v | . 2 ⊢ (𝜑 → (Vtx‘𝑈) = 𝑉) | |
| 14 | uspgrun.un | . 2 ⊢ (𝜑 → (iEdg‘𝑈) = (𝐸 ∪ 𝐹)) | |
| 15 | 3, 6, 7, 8, 9, 10, 11, 12, 13, 14 | upgrun 29702 | 1 ⊢ (𝜑 → 𝑈 ∈ UPGraph) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ∩ cin 4089 ∪ cun 4149 ∅c0 4278 dom cdm 5650 ‘cfv 6539 Vtxcvtx 29580 iEdgciedg 29581 UPGraphcupgr 29664 USPGraphcuspgr 29735 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fv 6547 df-upgr 29666 df-uspgr 29737 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |