| 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 29782 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)}) | |
| 2 | 1 | eleq2d 2814 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ 𝑊 ∈ {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})) |
| 3 | fveqeq2 6831 | . . 3 ⊢ (𝑤 = 𝑊 → ((♯‘𝑤) = (𝑁 + 1) ↔ (♯‘𝑊) = (𝑁 + 1))) | |
| 4 | 3 | elrab 3648 | . 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 1540 ∈ wcel 2109 {crab 3394 ‘cfv 6482 (class class class)co 7349 1c1 11010 + caddc 11012 ℕ0cn0 12384 ♯chash 14237 WWalkscwwlks 29770 WWalksN cwwlksn 29771 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3395 df-v 3438 df-sbc 3743 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-br 5093 df-opab 5155 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-iota 6438 df-fun 6484 df-fv 6490 df-ov 7352 df-oprab 7353 df-mpo 7354 df-wwlksn 29776 |
| This theorem is referenced by: wwlksnprcl 29784 iswwlksnx 29785 wwlknbp 29787 wwlknp 29788 wwlkswwlksn 29810 wlklnwwlkln1 29813 wlklnwwlkln2lem 29827 wlknewwlksn 29832 wwlksnred 29837 wwlksnext 29838 wwlksnextproplem3 29856 wspthsnonn0vne 29862 elwspths2spth 29912 rusgrnumwwlkl1 29913 clwwlkel 29990 clwwlkf 29991 clwwlknwwlksnb 29999 |
| Copyright terms: Public domain | W3C validator |