Theorem numclwwlkovq 31032

Description: Value of operation 𝑄, mapping a vertex 𝑣 and a positive integer 𝑛 to the not closed walks v(0) ... v(n) of length 𝑛 from a fixed vertex 𝑣 = v(0). "Not closed" means v(n) =/= v(0). Remark: 𝑛 ∈ ℕ₀ would not be useful: numclwwlkqhash 31033 would not hold, because (𝐾↑0) = 1! (Contributed by Alexander van der Vekens, 27-Sep-2018.) (Revised by AV, 30-May-2021.)

Hypotheses

Ref	Expression
numclwwlk.v	⊢ 𝑉 = (Vtx‘𝐺)
numclwwlk.q	⊢ 𝑄 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)})

Assertion

Ref	Expression
numclwwlkovq	⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝑄𝑁) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)})

Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑛,𝑁,𝑣,𝑤   𝑛,𝑉,𝑣   𝑛,𝑋,𝑣,𝑤

Allowed substitution hints:   𝑄(𝑤, 𝑣, 𝑛)   𝑉(𝑤)

Proof of Theorem numclwwlkovq

Step	Hyp	Ref	Expression
1		oveq1 7458	. . . 4 ⊢ (𝑛 = 𝑁 → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
2	1	adantl 487	. . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
3		eqeq2 2775	. . . . 5 ⊢ (𝑣 = 𝑋 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑋))
4		neeq2 3022	. . . . 5 ⊢ (𝑣 = 𝑋 → ((lastS‘𝑤) ≠ 𝑣 ↔ (lastS‘𝑤) ≠ 𝑋))
5	3, 4	anbi12d 644	. . . 4 ⊢ (𝑣 = 𝑋 → (((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣) ↔ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)))
6	5	adantr 486	. . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → (((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣) ↔ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)))
7	2, 6	rabeqbidv 3433	. 2 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)})
8		numclwwlk.q	. 2 ⊢ 𝑄 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)})
9		ovex 7484	. . 3 ⊢ (𝑁 WWalksN 𝐺) ∈ V
10	9	rabex 5307	. 2 ⊢ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)} ∈ V
11	7, 8, 10	ovmpoa 7607	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝑄𝑁) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  {crab 3416  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  0cc0 11239  ℕcn 12375  lastSclsw 14748  Vtxcvtx 29631   WWalksN cwwlksn 30472

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456

This theorem is used by:  numclwwlkqhash  31033  numclwwlk2lem1  31034  numclwlk2lem2f  31035  numclwlk2lem2f1o  31037