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

Theorem rusgrnumwwlklem 30389
Description: Lemma for rusgrnumwwlk 30394 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 7426 . . . . 5 (𝑛 = 𝑁 → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
21adantl 487 . . . 4 ((𝑣 = 𝑃𝑛 = 𝑁) → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
3 eqeq2 2777 . . . . 5 (𝑣 = 𝑃 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃))
43adantr 486 . . . 4 ((𝑣 = 𝑃𝑛 = 𝑁) → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑃))
52, 4rabeqbidv 3436 . . 3 ((𝑣 = 𝑃𝑛 = 𝑁) → {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃})
65fveq2d 6889 . 2 ((𝑣 = 𝑃𝑛 = 𝑁) → (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
7 rusgrnumwwlk.l . 2 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))
8 fvex 6898 . 2 (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}) ∈ V
96, 7, 8ovmpoa 7574 1 ((𝑃𝑉𝑁 ∈ ℕ0) → (𝑃𝐿𝑁) = (♯‘{𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  {crab 3418  cfv 6540  (class class class)co 7419  cmpo 7421  0cc0 11115  0cn0 12519  chash 14384  Vtxcvtx 29401   WWalksN cwwlksn 30242
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424
This theorem is used by:  rusgrnumwwlkb0  30390  rusgrnumwwlkb1  30391  rusgr0edg  30392  rusgrnumwwlks  30393  rusgrnumwwlkg  30395
  Copyright terms: Public domain W3C validator