![]() |
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 29870 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)}) | |
2 | 1 | eleq2d 2830 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ 𝑊 ∈ {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})) |
3 | fveqeq2 6929 | . . 3 ⊢ (𝑤 = 𝑊 → ((♯‘𝑤) = (𝑁 + 1) ↔ (♯‘𝑊) = (𝑁 + 1))) | |
4 | 3 | elrab 3708 | . 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 1537 ∈ wcel 2108 {crab 3443 ‘cfv 6573 (class class class)co 7448 1c1 11185 + caddc 11187 ℕ0cn0 12553 ♯chash 14379 WWalkscwwlks 29858 WWalksN cwwlksn 29859 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-iota 6525 df-fun 6575 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-wwlksn 29864 |
This theorem is referenced by: wwlksnprcl 29872 iswwlksnx 29873 wwlknbp 29875 wwlknp 29876 wwlkswwlksn 29898 wlklnwwlkln1 29901 wlklnwwlkln2lem 29915 wlknewwlksn 29920 wwlksnred 29925 wwlksnext 29926 wwlksnextproplem3 29944 wspthsnonn0vne 29950 elwspths2spth 30000 rusgrnumwwlkl1 30001 clwwlkel 30078 clwwlkf 30079 clwwlknwwlksnb 30087 |
Copyright terms: Public domain | W3C validator |