| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > upgrspan | Structured version Visualization version GIF version | ||
| Description: A spanning subgraph 𝑆 of a pseudograph 𝐺 is a pseudograph. (Contributed by AV, 11-Oct-2020.) (Proof shortened by AV, 18-Nov-2020.) |
| Ref | Expression |
|---|---|
| uhgrspan.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| uhgrspan.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| uhgrspan.s | ⊢ (𝜑 → 𝑆 ∈ 𝑊) |
| uhgrspan.q | ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) |
| uhgrspan.r | ⊢ (𝜑 → (iEdg‘𝑆) = (𝐸 ↾ 𝐴)) |
| upgrspan.g | ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
| Ref | Expression |
|---|---|
| upgrspan | ⊢ (𝜑 → 𝑆 ∈ UPGraph) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | upgrspan.g | . 2 ⊢ (𝜑 → 𝐺 ∈ UPGraph) | |
| 2 | uhgrspan.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | uhgrspan.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 4 | uhgrspan.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑊) | |
| 5 | uhgrspan.q | . . 3 ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) | |
| 6 | uhgrspan.r | . . 3 ⊢ (𝜑 → (iEdg‘𝑆) = (𝐸 ↾ 𝐴)) | |
| 7 | upgruhgr 29175 | . . . 4 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph) | |
| 8 | 1, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝐺 ∈ UHGraph) |
| 9 | 2, 3, 4, 5, 6, 8 | uhgrspansubgr 29364 | . 2 ⊢ (𝜑 → 𝑆 SubGraph 𝐺) |
| 10 | subupgr 29360 | . 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UPGraph) | |
| 11 | 1, 9, 10 | syl2anc 584 | 1 ⊢ (𝜑 → 𝑆 ∈ UPGraph) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 class class class wbr 5098 ↾ cres 5626 ‘cfv 6492 Vtxcvtx 29069 iEdgciedg 29070 UHGraphcuhgr 29129 UPGraphcupgr 29153 SubGraph csubgr 29340 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-edg 29121 df-uhgr 29131 df-upgr 29155 df-subgr 29341 |
| This theorem is referenced by: upgrspanop 29370 |
| Copyright terms: Public domain | W3C validator |