MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iswwlksn Structured version   Visualization version   GIF version

Theorem iswwlksn 30128
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.)
Assertion
Ref Expression
iswwlksn (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1))))

Proof of Theorem iswwlksn
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 wwlksn 30127 . . 3 (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})
21eleq2d 2855 . 2 (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ 𝑊 ∈ {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)}))
3 fveqeq2 6891 . . 3 (𝑤 = 𝑊 → ((♯‘𝑤) = (𝑁 + 1) ↔ (♯‘𝑊) = (𝑁 + 1)))
43elrab 3659 . 2 (𝑊 ∈ {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)} ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1)))
52, 4bitrdi 290 1 (𝑁 ∈ ℕ0 → (𝑊 ∈ (𝑁 WWalksN 𝐺) ↔ (𝑊 ∈ (WWalks‘𝐺) ∧ (♯‘𝑊) = (𝑁 + 1))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  {crab 3423  cfv 6537  (class class class)co 7411  1c1 11101   + caddc 11103  0cn0 12504  chash 14366  WWalkscwwlks 30115   WWalksN cwwlksn 30116
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-wwlksn 30121
This theorem is referenced by:  wwlksnprcl  30129  iswwlksnx  30130  wwlknbp  30132  wwlknp  30133  wwlkswwlksn  30155  wlklnwwlkln1  30158  wlklnwwlkln2lem  30172  wlknewwlksn  30177  wwlksnred  30182  wwlksnext  30183  wwlksnextproplem3  30201  wspthsnonn0vne  30207  elwspths2spth  30260  rusgrnumwwlkl1  30261  clwwlkel  30338  clwwlkf  30339  clwwlknwwlksnb  30347
  Copyright terms: Public domain W3C validator