| 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 29905 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)}) | |
| 2 | 1 | eleq2d 2822 | . 2 ⊢ (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ 𝑊 ∈ {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})) |
| 3 | fveqeq2 6849 | . . 3 ⊢ (𝑤 = 𝑊 → ((♯‘𝑤) = (𝑁 + 1) ↔ (♯‘𝑊) = (𝑁 + 1))) | |
| 4 | 3 | elrab 3634 | . 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 3389 ‘cfv 6498 (class class class)co 7367 1c1 11039 + caddc 11041 ℕ0cn0 12437 ♯chash 14292 WWalkscwwlks 29893 WWalksN cwwlksn 29894 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-iota 6454 df-fun 6500 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-wwlksn 29899 |
| This theorem is referenced by: wwlksnprcl 29907 iswwlksnx 29908 wwlknbp 29910 wwlknp 29911 wwlkswwlksn 29933 wlklnwwlkln1 29936 wlklnwwlkln2lem 29950 wlknewwlksn 29955 wwlksnred 29960 wwlksnext 29961 wwlksnextproplem3 29979 wspthsnonn0vne 29985 elwspths2spth 30038 rusgrnumwwlkl1 30039 clwwlkel 30116 clwwlkf 30117 clwwlknwwlksnb 30125 |
| Copyright terms: Public domain | W3C validator |