| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iswwlksn | Structured version Visualization version GIF version | ||
| Description: A word over the set of vertices representing a walk of a fixed length (in an undirected graph). (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.) |
| Ref | Expression |
|---|---|
| iswwlksn | ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wwlksn 29923 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)}) | |
| 2 | 1 | eleq2d 2823 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ 𝑊 ∈ {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})) |
| 3 | fveqeq2 6844 | . . 3 ⊢ (𝑤 = 𝑊 → ((♯‘𝑤) = (𝑁 + 1) ↔ (♯‘𝑊) = (𝑁 + 1))) | |
| 4 | 3 | elrab 3635 | . 2 ⊢ (𝑊 ∈ {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)} ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1))) |
| 5 | 2, 4 | bitrdi 287 | 1 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3390 ‘cfv 6493 (class class class)co 7361 1c1 11033 + caddc 11035 ℕ0cn0 12431 ♯chash 14286 WWalkscwwlks 29911 WWalksN cwwlksn 29912 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6449 df-fun 6495 df-fv 6501 df-ov 7364 df-oprab 7365 df-mpo 7366 df-wwlksn 29917 |
| This theorem is referenced by: wwlksnprcl 29925 iswwlksnx 29926 wwlknbp 29928 wwlknp 29929 wwlkswwlksn 29951 wlklnwwlkln1 29954 wlklnwwlkln2lem 29968 wlknewwlksn 29973 wwlksnred 29978 wwlksnext 29979 wwlksnextproplem3 29997 wspthsnonn0vne 30003 elwspths2spth 30056 rusgrnumwwlkl1 30057 clwwlkel 30134 clwwlkf 30135 clwwlknwwlksnb 30143 |
| Copyright terms: Public domain | W3C validator |