Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wspthsswwlknon | Structured version Visualization version GIF version |
Description: The set of simple paths of a fixed length between two vertices is a subset of the set of walks of the fixed length between the two vertices. (Contributed by AV, 15-May-2021.) |
Ref | Expression |
---|---|
wspthsswwlknon | ⊢ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ⊆ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2738 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | 1 | wspthnonp 28232 | . . 3 ⊢ (𝑤 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) → ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺)) ∧ (𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤))) |
3 | simp3l 1200 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺)) ∧ (𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤)) → 𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵)) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝑤 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) → 𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵)) |
5 | 4 | ssriv 3924 | 1 ⊢ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ⊆ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 ∧ w3a 1086 ∃wex 1782 ∈ wcel 2106 Vcvv 3429 ⊆ wss 3886 class class class wbr 5073 ‘cfv 6426 (class class class)co 7267 ℕ0cn0 12243 Vtxcvtx 27376 SPathsOncspthson 28091 WWalksNOn cwwlksnon 28200 WSPathsNOn cwwspthsnon 28202 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5208 ax-sep 5221 ax-nul 5228 ax-pow 5286 ax-pr 5350 ax-un 7578 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3071 df-rab 3073 df-v 3431 df-sbc 3716 df-csb 3832 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5074 df-opab 5136 df-mpt 5157 df-id 5484 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-rn 5595 df-res 5596 df-ima 5597 df-iota 6384 df-fun 6428 df-fn 6429 df-f 6430 df-f1 6431 df-fo 6432 df-f1o 6433 df-fv 6434 df-ov 7270 df-oprab 7271 df-mpo 7272 df-1st 7820 df-2nd 7821 df-wwlksnon 28205 df-wspthsnon 28207 |
This theorem is referenced by: wspthnonfi 28295 |
Copyright terms: Public domain | W3C validator |