Theorem numclwlk2lem2fv 26631

Description: Value of the function R. (Contributed by Alexander van der Vekens, 6-Oct-2018.)

Hypotheses

Ref	Expression
numclwwlk.c	⊢ 𝐶 = (𝑛 ∈ ℕ0 ↦ ((𝑉 ClWWalksN 𝐸)‘𝑛))
numclwwlk.f	⊢ 𝐹 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝐶‘𝑛) ∣ (𝑤‘0) = 𝑣})
numclwwlk.g	⊢ 𝐺 = (𝑣 ∈ 𝑉, 𝑛 ∈ (ℤ≥‘2) ↦ {𝑤 ∈ (𝐶‘𝑛) ∣ ((𝑤‘0) = 𝑣 ∧ (𝑤‘(𝑛 − 2)) = (𝑤‘0))})
numclwwlk.q	⊢ 𝑄 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ ((𝑉 WWalksN 𝐸)‘𝑛) ∣ ((𝑤‘0) = 𝑣 ∧ ( lastS ‘𝑤) ≠ 𝑣)})
numclwwlk.h	⊢ 𝐻 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ0 ↦ {𝑤 ∈ (𝐶‘𝑛) ∣ ((𝑤‘0) = 𝑣 ∧ (𝑤‘(𝑛 − 2)) ≠ (𝑤‘0))})
numclwwlk.r	⊢ 𝑅 = (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↦ (𝑥 substr ⟨0, (𝑁 + 1)⟩))

Assertion

Ref	Expression
numclwlk2lem2fv	⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑊 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑊) = (𝑊 substr ⟨0, (𝑁 + 1)⟩)))

Distinct variable groups:   𝑛,𝐸   𝑛,𝑁   𝑛,𝑉   𝑤,𝐶,𝑥   𝑥,𝐸   𝑤,𝑁,𝑥   𝑥,𝑉   𝐶,𝑛,𝑣,𝑤   𝑣,𝑁   𝑛,𝑋,𝑣,𝑤   𝑣,𝑉   𝑤,𝐸   𝑤,𝑉   𝑤,𝐹   𝑤,𝑄   𝑤,𝐺   𝑥,𝑋   𝑣,𝐸   𝑣,𝑊,𝑤   𝑥,𝐻   𝑥,𝑄   𝑥,𝑊

Allowed substitution hints:   𝑄(𝑣,𝑛)   𝑅(𝑥,𝑤,𝑣,𝑛)   𝐹(𝑥,𝑣,𝑛)   𝐺(𝑥,𝑣,𝑛)   𝐻(𝑤,𝑣,𝑛)   𝑊(𝑛)

Proof of Theorem numclwlk2lem2fv

Step	Hyp	Ref	Expression
1		ovex 6577	. . . . . 6 ⊢ (𝑊 substr ⟨0, (𝑁 + 1)⟩) ∈ V
2	1	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑊 substr ⟨0, (𝑁 + 1)⟩) ∈ V)
3	2	anim1i 590	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑊 ∈ (𝑋𝐻(𝑁 + 2))) → ((𝑊 substr ⟨0, (𝑁 + 1)⟩) ∈ V ∧ 𝑊 ∈ (𝑋𝐻(𝑁 + 2))))
4	3	ancomd 466	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑊 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑊 ∈ (𝑋𝐻(𝑁 + 2)) ∧ (𝑊 substr ⟨0, (𝑁 + 1)⟩) ∈ V))
5		oveq1 6556	. . . 4 ⊢ (𝑥 = 𝑊 → (𝑥 substr ⟨0, (𝑁 + 1)⟩) = (𝑊 substr ⟨0, (𝑁 + 1)⟩))
6		numclwwlk.r	. . . 4 ⊢ 𝑅 = (𝑥 ∈ (𝑋𝐻(𝑁 + 2)) ↦ (𝑥 substr ⟨0, (𝑁 + 1)⟩))
7	5, 6	fvmptg 6189	. . 3 ⊢ ((𝑊 ∈ (𝑋𝐻(𝑁 + 2)) ∧ (𝑊 substr ⟨0, (𝑁 + 1)⟩) ∈ V) → (𝑅‘𝑊) = (𝑊 substr ⟨0, (𝑁 + 1)⟩))
8	4, 7	syl 17	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) ∧ 𝑊 ∈ (𝑋𝐻(𝑁 + 2))) → (𝑅‘𝑊) = (𝑊 substr ⟨0, (𝑁 + 1)⟩))
9	8	ex 449	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑊 ∈ (𝑋𝐻(𝑁 + 2)) → (𝑅‘𝑊) = (𝑊 substr ⟨0, (𝑁 + 1)⟩)))

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  {crab 2900  Vcvv 3173  ⟨cop 4131   ↦ cmpt 4643  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  0cc0 9815  1c1 9816   + caddc 9818   − cmin 10145  ℕcn 10897  2c2 10947  ℕ₀cn0 11169  ℤ_≥cuz 11563   lastS clsw 13147   substr csubstr 13150   WWalksN cwwlkn 26206   ClWWalksN cclwwlkn 26277

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-ov 6552

This theorem is referenced by:  numclwlk2lem2f1o  26632