![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > umgrspan | Structured version Visualization version GIF version |
Description: A spanning subgraph 𝑆 of a multigraph 𝐺 is a multigraph. (Contributed by AV, 27-Nov-2020.) |
Ref | Expression |
---|---|
uhgrspan.v | ⊢ 𝑉 = (Vtx‘𝐺) |
uhgrspan.e | ⊢ 𝐸 = (iEdg‘𝐺) |
uhgrspan.s | ⊢ (𝜑 → 𝑆 ∈ 𝑊) |
uhgrspan.q | ⊢ (𝜑 → (Vtx‘𝑆) = 𝑉) |
uhgrspan.r | ⊢ (𝜑 → (iEdg‘𝑆) = (𝐸 ↾ 𝐴)) |
umgrspan.g | ⊢ (𝜑 → 𝐺 ∈ UMGraph) |
Ref | Expression |
---|---|
umgrspan | ⊢ (𝜑 → 𝑆 ∈ UMGraph) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | umgrspan.g | . 2 ⊢ (𝜑 → 𝐺 ∈ UMGraph) | |
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 | umgruhgr 28119 | . . . 4 ⊢ (𝐺 ∈ UMGraph → 𝐺 ∈ UHGraph) | |
8 | 1, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝐺 ∈ UHGraph) |
9 | 2, 3, 4, 5, 6, 8 | uhgrspansubgr 28303 | . 2 ⊢ (𝜑 → 𝑆 SubGraph 𝐺) |
10 | subumgr 28300 | . 2 ⊢ ((𝐺 ∈ UMGraph ∧ 𝑆 SubGraph 𝐺) → 𝑆 ∈ UMGraph) | |
11 | 1, 9, 10 | syl2anc 585 | 1 ⊢ (𝜑 → 𝑆 ∈ UMGraph) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2107 class class class wbr 5111 ↾ cres 5641 ‘cfv 6502 Vtxcvtx 28011 iEdgciedg 28012 UHGraphcuhgr 28071 UMGraphcumgr 28096 SubGraph csubgr 28279 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2703 ax-sep 5262 ax-nul 5269 ax-pow 5326 ax-pr 5390 ax-un 7678 ax-cnex 11117 ax-resscn 11118 ax-1cn 11119 ax-icn 11120 ax-addcl 11121 ax-addrcl 11122 ax-mulcl 11123 ax-mulrcl 11124 ax-mulcom 11125 ax-addass 11126 ax-mulass 11127 ax-distr 11128 ax-i2m1 11129 ax-1ne0 11130 ax-1rid 11131 ax-rnegex 11132 ax-rrecex 11133 ax-cnre 11134 ax-pre-lttri 11135 ax-pre-lttrn 11136 ax-pre-ltadd 11137 ax-pre-mulgt0 11138 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3353 df-rab 3407 df-v 3449 df-sbc 3744 df-csb 3860 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3933 df-nul 4289 df-if 4493 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4872 df-int 4914 df-iun 4962 df-br 5112 df-opab 5174 df-mpt 5195 df-tr 5229 df-id 5537 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5594 df-we 5596 df-xp 5645 df-rel 5646 df-cnv 5647 df-co 5648 df-dm 5649 df-rn 5650 df-res 5651 df-ima 5652 df-pred 6259 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7319 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7809 df-1st 7927 df-2nd 7928 df-frecs 8218 df-wrecs 8249 df-recs 8323 df-rdg 8362 df-1o 8418 df-er 8656 df-en 8892 df-dom 8893 df-sdom 8894 df-fin 8895 df-card 9885 df-pnf 11201 df-mnf 11202 df-xr 11203 df-ltxr 11204 df-le 11205 df-sub 11397 df-neg 11398 df-nn 12164 df-2 12226 df-n0 12424 df-z 12510 df-uz 12774 df-fz 13436 df-hash 14242 df-edg 28063 df-uhgr 28073 df-upgr 28097 df-umgr 28098 df-subgr 28280 |
This theorem is referenced by: umgrspanop 28310 |
Copyright terms: Public domain | W3C validator |