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

Theorem wwlksn 30485
Description: The set of walks (in an undirected graph) of a fixed length as words over the set of vertices. (Contributed by Alexander van der Vekens, 15-Jul-2018.) (Revised by AV, 8-Apr-2021.)
Assertion
Ref Expression
wwlksn (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})
Distinct variable groups:   𝑤,𝐺   𝑤,𝑁

Proof of Theorem wwlksn
Dummy variables 𝑔 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6915 . . . . . 6 (𝑔 = 𝐺 → (WWalks‘𝑔) = (WWalks‘𝐺))
21adantl 487 . . . . 5 ((𝑛 = 𝑁 ∧ 𝑔 = 𝐺) → (WWalks‘𝑔) = (WWalks‘𝐺))
3 oveq1 7457 . . . . . . 7 (𝑛 = 𝑁 → (𝑛 + 1) = (𝑁 + 1))
43eqeq2d 2777 . . . . . 6 (𝑛 = 𝑁 → ((♯‘𝑤) = (𝑛 + 1) ↔ (♯‘𝑤) = (𝑁 + 1)))
54adantr 486 . . . . 5 ((𝑛 = 𝑁 ∧ 𝑔 = 𝐺) → ((♯‘𝑤) = (𝑛 + 1) ↔ (♯‘𝑤) = (𝑁 + 1)))
62, 5rabeqbidv 3432 . . . 4 ((𝑛 = 𝑁 ∧ 𝑔 = 𝐺) → {𝑤 ∈ (WWalks‘𝑔) ∣ (♯‘𝑤) = (𝑛 + 1)} = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})
7 df-wwlksn 30479 . . . 4 WWalksN = (𝑛 ∈ ℕ0, 𝑔 ∈ V ↦ {𝑤 ∈ (WWalks‘𝑔) ∣ (♯‘𝑤) = (𝑛 + 1)})
8 fvex 6928 . . . . 5 (WWalks‘𝐺) ∈ V
98rabex 5306 . . . 4 {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)} ∈ V
106, 7, 9ovmpoa 7606 . . 3 ((𝑁 ∈ ℕ0 ∧ 𝐺 ∈ V) → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})
1110expcom 419 . 2 (𝐺 ∈ V → (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)}))
127reldmmpo 7583 . . . . 5 Rel dom WWalksN
1312ovprc2 7490 . . . 4 (¬ 𝐺 ∈ V → (𝑁 WWalksN 𝐺) = ∅)
14 fvprc 6907 . . . . . 6 (¬ 𝐺 ∈ V → (WWalks‘𝐺) = ∅)
1514rabeqdv 3430 . . . . 5 (¬ 𝐺 ∈ V → {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)} = {𝑤 ∈ ∅ ∣ (♯‘𝑤) = (𝑁 + 1)})
16 rab0 4337 . . . . 5 {𝑤 ∈ ∅ ∣ (♯‘𝑤) = (𝑁 + 1)} = ∅
1715, 16eqtrdi 2817 . . . 4 (¬ 𝐺 ∈ V → {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)} = ∅)
1813, 17eqtr4d 2804 . . 3 (¬ 𝐺 ∈ V → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})
1918a1d 26 . 2 (¬ 𝐺 ∈ V → (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)}))
2011, 19pm2.61i 184 1 (𝑁 ∈ ℕ0 → (𝑁 WWalksN 𝐺) = {𝑤 ∈ (WWalks‘𝐺) ∣ (♯‘𝑤) = (𝑁 + 1)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  {crab 3415  Vcvv 3453  ∅c0 4280  ‘cfv 6565  (class class class)co 7450  1c1 11239   + caddc 11241  ℕ0cn0 12645  ♯chash 14514  WWalkscwwlks 30473   WWalksN cwwlksn 30474
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-iota 6519  df-fun 6567  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-wwlksn 30479
This theorem is used by:  iswwlksn  30486  wwlksn0s  30509  0enwwlksnge1  30512  wlknwwlksnbij  30536  wwlksnfi  30554
  Copyright terms: Public domain W3C validator