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

Theorem wwlksnexthasheq 29884
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 7402 . . 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 29883 . 2 (𝑊 ∈ (𝑁 WWalksN 𝐺) → ∃𝑓 𝑓:{𝑤 ∈ ((𝑁 + 1) WWalksN 𝐺) ∣ ((𝑤 prefix (𝑁 + 1)) = 𝑊 ∧ {(lastS‘𝑊), (lastS‘𝑤)} ∈ 𝐸)}–1-1-onto→{𝑛𝑉 ∣ {(lastS‘𝑊), 𝑛} ∈ 𝐸})
6 hasheqf1oi 14294 . 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 395   = wceq 1540  wex 1779  wcel 2109  {crab 3402  Vcvv 3444  {cpr 4587  1-1-ontowf1o 6498  cfv 6499  (class class class)co 7369  1c1 11047   + caddc 11049  chash 14273  lastSclsw 14505   prefix cpfx 14613  Vtxcvtx 28977  Edgcedg 29028   WWalksN cwwlksn 29807
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-cnex 11102  ax-resscn 11103  ax-1cn 11104  ax-icn 11105  ax-addcl 11106  ax-addrcl 11107  ax-mulcl 11108  ax-mulrcl 11109  ax-mulcom 11110  ax-addass 11111  ax-mulass 11112  ax-distr 11113  ax-i2m1 11114  ax-1ne0 11115  ax-1rid 11116  ax-rnegex 11117  ax-rrecex 11118  ax-cnre 11119  ax-pre-lttri 11120  ax-pre-lttrn 11121  ax-pre-ltadd 11122  ax-pre-mulgt0 11123
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-1o 8411  df-er 8648  df-map 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-card 9870  df-pnf 11188  df-mnf 11189  df-xr 11190  df-ltxr 11191  df-le 11192  df-sub 11385  df-neg 11386  df-nn 12165  df-2 12227  df-n0 12421  df-xnn0 12494  df-z 12508  df-uz 12772  df-rp 12930  df-fz 13447  df-fzo 13594  df-hash 14274  df-word 14457  df-lsw 14506  df-concat 14514  df-s1 14539  df-substr 14584  df-pfx 14614  df-wwlks 29811  df-wwlksn 29812
This theorem is referenced by:  rusgrnumwwlks  29955
  Copyright terms: Public domain W3C validator