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

Theorem wwlksnexthasheq 30042
Description: The number of the extensions of a walk (as word) by an edge equals the number of vertices being connected to the trailing vertex of the walk. (Contributed by Alexander van der Vekens, 23-Aug-2018.) (Revised by AV, 19-Apr-2021.) (Revised by AV, 27-Oct-2022.)
Hypotheses
Ref Expression
wwlksnexthasheq.v 𝑉 = (Vtx‘𝐺)
wwlksnexthasheq.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
wwlksnexthasheq (𝑊 ∈ (𝑁 WWalksN 𝐺) → (♯‘{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}) = (♯‘{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}))
Distinct variable groups:   𝑛,𝐸,𝑤   𝑤,𝐺   𝑤,𝑁   𝑛,𝑉,𝑤   𝑛,𝑊,𝑤
Allowed substitution hints:   𝐺(𝑛)   𝑁(𝑛)

Proof of Theorem wwlksnexthasheq
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 ovex 7418 . . 3 ((𝑁 + 1) WWalksN 𝐺) ∈ V
21rabex 5289 . 2 {𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∈ V
3 wwlksnexthasheq.v . . 3 𝑉 = (Vtx‘𝐺)
4 wwlksnexthasheq.e . . 3 𝐸 = (Edg‘𝐺)
53, 4wwlksnextbij 30041 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∃𝑓 𝑓:{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})
6 hasheqf1oi 14354 . 2 ({𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)} ∈ V → (∃𝑓 𝑓:{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸} → (♯‘{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}) = (♯‘{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})))
72, 5, 6mpsyl 68 1 (𝑊 ∈ (𝑁 WWalksN 𝐺) → (♯‘{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}) = (♯‘{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1554  wex 1793  wcel 2136  {crab 3408  Vcvv 3448  {cpr 4578  1-1-ontowf1o 6509  cfv 6510  (class class class)co 7385  1c1 11064   + caddc 11066  chash 14333  lastSclsw 14565   prefix cpfx 14674  Vtxcvtx 29136  Edgcedg 29187   WWalksN cwwlksn 29965
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-rep 5221  ax-sep 5240  ax-nul 5250  ax-pow 5316  ax-pr 5384  ax-un 7707  ax-cnex 11119  ax-resscn 11120  ax-1cn 11121  ax-icn 11122  ax-addcl 11123  ax-addrcl 11124  ax-mulcl 11125  ax-mulrcl 11126  ax-mulcom 11127  ax-addass 11128  ax-mulass 11129  ax-distr 11130  ax-i2m1 11131  ax-1ne0 11132  ax-1rid 11133  ax-rnegex 11134  ax-rrecex 11135  ax-cnre 11136  ax-pre-lttri 11137  ax-pre-lttrn 11138  ax-pre-ltadd 11139  ax-pre-mulgt0 11140
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-nel 3056  df-ral 3071  df-rex 3081  df-reu 3362  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4900  df-iun 4945  df-br 5095  df-opab 5157  df-mpt 5176  df-tr 5202  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-riota 7342  df-ov 7388  df-oprab 7389  df-mpo 7390  df-om 7836  df-1st 7959  df-2nd 7960  df-frecs 8250  df-wrecs 8281  df-recs 8330  df-rdg 8369  df-1o 8425  df-er 8666  df-map 8798  df-en 8917  df-dom 8918  df-sdom 8919  df-fin 8920  df-card 9887  df-pnf 11208  df-mnf 11209  df-xr 11210  df-ltxr 11211  df-le 11212  df-sub 11406  df-neg 11407  df-nn 12201  df-2 12270  df-n0 12472  df-xnn0 12545  df-z 12559  df-uz 12830  df-rp 12984  df-fz 13503  df-fzo 13650  df-hash 14334  df-word 14517  df-lsw 14566  df-concat 14574  df-s1 14600  df-substr 14645  df-pfx 14675  df-wwlks 29969  df-wwlksn 29970
This theorem is referenced by:  rusgrnumwwlks  30116
  Copyright terms: Public domain W3C validator