![]() |
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 2778 | . . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | 1 | wspthnonp 27225 | . . 3 ⊢ (𝑤 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) → ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺)) ∧ (𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤))) |
3 | simp3l 1215 | . . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) ∧ (𝐴 ∈ (Vtx‘𝐺) ∧ 𝐵 ∈ (Vtx‘𝐺)) ∧ (𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) ∧ ∃𝑓 𝑓(𝐴(SPathsOn‘𝐺)𝐵)𝑤)) → 𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵)) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (𝑤 ∈ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) → 𝑤 ∈ (𝐴(𝑁 WWalksNOn 𝐺)𝐵)) |
5 | 4 | ssriv 3825 | 1 ⊢ (𝐴(𝑁 WSPathsNOn 𝐺)𝐵) ⊆ (𝐴(𝑁 WWalksNOn 𝐺)𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 386 ∧ w3a 1071 ∃wex 1823 ∈ wcel 2107 Vcvv 3398 ⊆ wss 3792 class class class wbr 4888 ‘cfv 6137 (class class class)co 6924 ℕ0cn0 11647 Vtxcvtx 26361 SPathsOncspthson 27084 WWalksNOn cwwlksnon 27193 WSPathsNOn cwwspthsnon 27195 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5008 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3an 1073 df-tru 1605 df-fal 1615 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-op 4405 df-uni 4674 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-id 5263 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-ov 6927 df-oprab 6928 df-mpt2 6929 df-1st 7447 df-2nd 7448 df-wwlksnon 27198 df-wspthsnon 27200 |
This theorem is referenced by: wspthnonfi 27319 |
Copyright terms: Public domain | W3C validator |