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

Theorem numclwlk2lem2fv 30861
Description: Value of the function 𝑅. (Contributed by Alexander van der Vekens, 6-Oct-2018.) (Revised by AV, 31-May-2021.) (Revised by AV, 1-Nov-2022.)
Hypotheses
Ref Expression
numclwwlk.v 𝑉 = (Vtx‘𝐺)
numclwwlk.q 𝑄 = (𝑣𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)})
numclwwlk.h 𝐻 = (𝑣𝑉, 𝑛 ∈ (ℤ‘2) ↦ {𝑤 ∈ (𝑣(ClWWalksNOn‘𝐺)𝑛) ∣ (𝑤‘(𝑛 − 2)) ≠ 𝑣})
numclwwlk.r 𝑅 = (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↦ (𝑥 prefix (𝑁 + 1)))
Assertion
Ref Expression
numclwlk2lem2fv ((𝑋𝑉𝑁 ∈ ℕ) → (𝑊 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅𝑊) = (𝑊 prefix (𝑁 + 1))))
Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑛,𝑁,𝑣,𝑤   𝑛,𝑉,𝑣   𝑛,𝑋,𝑣,𝑤   𝑤,𝑉   𝑣,𝑊,𝑤   𝑥,𝐺,𝑤   𝑥,𝐻   𝑥,𝑁   𝑥,𝑄   𝑥,𝑉   𝑥,𝑋   𝑥,𝑊
Allowed substitution hints:   𝑄(𝑤, 𝑣, 𝑛)   𝑅(𝑥, 𝑤, 𝑣, 𝑛)   𝐻(𝑤, 𝑣, 𝑛)   𝑊(𝑛)

Proof of Theorem numclwlk2lem2fv
StepHypRef Expression
1 numclwwlk.r . . 3 𝑅 = (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↦ (𝑥 prefix (𝑁 + 1)))
2 oveq1 7421 . . 3 (𝑥 = 𝑊 → (𝑥 prefix (𝑁 + 1)) = (𝑊 prefix (𝑁 + 1)))
3 simpr 490 . . 3 (((𝑋𝑉𝑁 ∈ ℕ) ∧ 𝑊 ∈ (𝑋𝐻(𝑁 + 2))) → 𝑊 ∈ (𝑋𝐻(𝑁 + 2)))
4 ovexd 7449 . . 3 (((𝑋𝑉𝑁 ∈ ℕ) ∧ 𝑊 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑊 prefix (𝑁 + 1)) ∈ V)
51, 2, 3, 4fvmptd3 7011 . 2 (((𝑋𝑉𝑁 ∈ ℕ) ∧ 𝑊 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑅𝑊) = (𝑊 prefix (𝑁 + 1)))
65ex 418 1 ((𝑋𝑉𝑁 ∈ ℕ) → (𝑊 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅𝑊) = (𝑊 prefix (𝑁 + 1))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wne 2955  {crab 3412  Vcvv 3450  cmpt 5186  cfv 6533  (class class class)co 7414  cmpo 7416  0cc0 11127  1c1 11128   + caddc 11130  cmin 11468  cn 12260  2c2 12322  cuz 12890  lastSclsw 14630   prefix cpfx 14743  Vtxcvtx 29456   WWalksN cwwlksn 30297  ClWWalksNOncclwwlknon 30560
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417
This theorem is used by:  numclwlk2lem2f1o  30862
  Copyright terms: Public domain W3C validator