Theorem numclwwlkovq 30984

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 30985 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 7431	. . . 4 ⊢ (𝑛 = 𝑁 → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
2	1	adantl 487	. . 3 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
3		eqeq2 2772	. . . . 5 ⊢ (𝑣 = 𝑋 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑋))
4		neeq2 3018	. . . . 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 3429	. 2 ⊢ ((𝑣 = 𝑋 ∧ 𝑛 = 𝑁) → {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)})
8		numclwwlk.q	. 2 ⊢ 𝑄 = (𝑣 ∈ 𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ (lastS‘𝑤) ≠ 𝑣)})
9		ovex 7457	. . 3 ⊢ (𝑁 WWalksN 𝐺) ∈ V
10	9	rabex 5300	. 2 ⊢ {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)} ∈ V
11	7, 8, 10	ovmpoa 7579	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ ℕ) → (𝑋𝑄𝑁) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ (lastS‘𝑤) ≠ 𝑋)})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  {crab 3412  ‘cfv 6543  (class class class)co 7424   ∈ cmpo 7426  0cc0 11207  ℕcn 12342  lastSclsw 14714  Vtxcvtx 29583   WWalksN cwwlksn 30424

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6497  df-fun 6545  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429

This theorem is used by:  numclwwlkqhash  30985  numclwwlk2lem1  30986  numclwlk2lem2f  30987  numclwlk2lem2f1o  30989