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

Theorem numclwwlkovq 27094
 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). (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
StepHypRef Expression
1 oveq1 6614 . . . 4 (𝑛 = 𝑁 → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
21adantl 482 . . 3 ((𝑣 = 𝑋𝑛 = 𝑁) → (𝑛 WWalksN 𝐺) = (𝑁 WWalksN 𝐺))
3 eqeq2 2632 . . . . 5 (𝑣 = 𝑋 → ((𝑤‘0) = 𝑣 ↔ (𝑤‘0) = 𝑋))
4 neeq2 2853 . . . . 5 (𝑣 = 𝑋 → (( lastS ‘𝑤) ≠ 𝑣 ↔ ( lastS ‘𝑤) ≠ 𝑋))
53, 4anbi12d 746 . . . 4 (𝑣 = 𝑋 → (((𝑤‘0) = 𝑣 ∧ ( lastS ‘𝑤) ≠ 𝑣) ↔ ((𝑤‘0) = 𝑋 ∧ ( lastS ‘𝑤) ≠ 𝑋)))
65adantr 481 . . 3 ((𝑣 = 𝑋𝑛 = 𝑁) → (((𝑤‘0) = 𝑣 ∧ ( lastS ‘𝑤) ≠ 𝑣) ↔ ((𝑤‘0) = 𝑋 ∧ ( lastS ‘𝑤) ≠ 𝑋)))
72, 6rabeqbidv 3181 . 2 ((𝑣 = 𝑋𝑛 = 𝑁) → {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ ( lastS ‘𝑤) ≠ 𝑣)} = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ ( lastS ‘𝑤) ≠ 𝑋)})
8 numclwwlk.q . 2 𝑄 = (𝑣𝑉, 𝑛 ∈ ℕ ↦ {𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑣 ∧ ( lastS ‘𝑤) ≠ 𝑣)})
9 ovex 6635 . . 3 (𝑁 WWalksN 𝐺) ∈ V
109rabex 4775 . 2 {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ ( lastS ‘𝑤) ≠ 𝑋)} ∈ V
117, 8, 10ovmpt2a 6747 1 ((𝑋𝑉𝑁 ∈ ℕ) → (𝑋𝑄𝑁) = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ ((𝑤‘0) = 𝑋 ∧ ( lastS ‘𝑤) ≠ 𝑋)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1480   ∈ wcel 1987   ≠ wne 2790  {crab 2911  ‘cfv 5849  (class class class)co 6607   ↦ cmpt2 6609  0cc0 9883  ℕcn 10967   lastS clsw 13234  Vtxcvtx 25781   WWalksN cwwlksn 26594 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4743  ax-nul 4751  ax-pr 4869 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3419  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-nul 3894  df-if 4061  df-sn 4151  df-pr 4153  df-op 4157  df-uni 4405  df-br 4616  df-opab 4676  df-id 4991  df-xp 5082  df-rel 5083  df-cnv 5084  df-co 5085  df-dm 5086  df-iota 5812  df-fun 5851  df-fv 5857  df-ov 6610  df-oprab 6611  df-mpt2 6612 This theorem is referenced by:  numclwwlkqhash  27095  numclwwlk2lem1  27097  numclwlk2lem2f  27098  numclwlk2lem2f1o  27100
 Copyright terms: Public domain W3C validator