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

Theorem rusgrnumwwlklem 27741
Description: Lemma for rusgrnumwwlk 27746 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 7155 . . . . 5 (𝑛 = 𝑁 → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
21adantl 484 . . . 4 ((𝑣 = 𝑃𝑛 = 𝑁) → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
3 eqeq2 2831 . . . . 5 (𝑣 = 𝑃 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃))
43adantr 483 . . . 4 ((𝑣 = 𝑃𝑛 = 𝑁) → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃))
52, 4rabeqbidv 3484 . . 3 ((𝑣 = 𝑃𝑛 = 𝑁) → {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃})
65fveq2d 6667 . 2 ((𝑣 = 𝑃𝑛 = 𝑁) → (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
7 rusgrnumwwlk.l . 2 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))
8 fvex 6676 . 2 (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}) ∈ V
96, 7, 8ovmpoa 7297 1 ((𝑃𝑉𝑁 ∈ ℕ0) → (𝑃𝐿𝑁) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1531  wcel 2108  {crab 3140  cfv 6348  (class class class)co 7148  cmpo 7150  0cc0 10529  0cn0 11889  chash 13682  Vtxcvtx 26773   WWalksN cwwlksn 27596
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pr 5320
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-sbc 3771  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-br 5058  df-opab 5120  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-iota 6307  df-fun 6350  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153
This theorem is referenced by:  rusgrnumwwlkb0  27742  rusgrnumwwlkb1  27743  rusgr0edg  27744  rusgrnumwwlks  27745  rusgrnumwwlkg  27747
  Copyright terms: Public domain W3C validator