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

Theorem rusgrnumwwlklem 30061
Description: Lemma for rusgrnumwwlk 30066 etc. (Contributed by Alexander van der Vekens, 21-Jul-2018.) (Revised by AV, 7-May-2021.)
Hypotheses
Ref Expression
rusgrnumwwlk.v 𝑉 = (Vtx‘𝐺)
rusgrnumwwlk.l 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))
Assertion
Ref Expression
rusgrnumwwlklem ((𝑃𝑉𝑁 ∈ ℕ0) → (𝑃𝐿𝑁) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑛,𝑁,𝑣,𝑤   𝑃,𝑛,𝑣,𝑤   𝑛,𝑉,𝑣,𝑤
Allowed substitution hints:   𝐿(𝑤,𝑣,𝑛)

Proof of Theorem rusgrnumwwlklem
StepHypRef Expression
1 oveq1 7366 . . . . 5 (𝑛 = 𝑁 → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
21adantl 483 . . . 4 ((𝑣 = 𝑃𝑛 = 𝑁) → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
3 eqeq2 2753 . . . . 5 (𝑣 = 𝑃 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃))
43adantr 482 . . . 4 ((𝑣 = 𝑃𝑛 = 𝑁) → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃))
52, 4rabeqbidv 3411 . . 3 ((𝑣 = 𝑃𝑛 = 𝑁) → {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃})
65fveq2d 6834 . 2 ((𝑣 = 𝑃𝑛 = 𝑁) → (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
7 rusgrnumwwlk.l . 2 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))
8 fvex 6843 . 2 (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}) ∈ V
96, 7, 8ovmpoa 7514 1 ((𝑃𝑉𝑁 ∈ ℕ0) → (𝑃𝐿𝑁) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  {crab 3393  cfv 6488  (class class class)co 7359  cmpo 7361  0cc0 11034  0cn0 12432  chash 14287  Vtxcvtx 29085   WWalksN cwwlksn 29914
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5220  ax-nul 5230  ax-pr 5364
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-sbc 3725  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-br 5075  df-opab 5137  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-iota 6444  df-fun 6490  df-fv 6496  df-ov 7362  df-oprab 7363  df-mpo 7364
This theorem is referenced by:  rusgrnumwwlkb0  30062  rusgrnumwwlkb1  30063  rusgr0edg  30064  rusgrnumwwlks  30065  rusgrnumwwlkg  30067
  Copyright terms: Public domain W3C validator