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

Theorem rusgrnumwwlk 27759
 Description: In a 𝐾-regular graph, the number of walks of a fixed length 𝑁 from a fixed vertex is 𝐾 to the power of 𝑁. By definition, (𝑁 WWalksN 𝐺) is the set of walks (as words) with length 𝑁, and (𝑃𝐿𝑁) is the number of walks with length 𝑁 starting at the vertex 𝑃. Because of the 𝐾-regularity, a walk can be continued in 𝐾 different ways at the end vertex of the walk, and this repeated 𝑁 times. This theorem even holds for 𝑁 = 0: in this case, the walk consists of only one vertex 𝑃, so the number of walks of length 𝑁 = 0 starting with 𝑃 is (𝐾↑0) = 1. (Contributed by Alexander van der Vekens, 24-Aug-2018.) (Revised by AV, 7-May-2021.)
Hypotheses
Ref Expression
rusgrnumwwlk.v 𝑉 = (Vtx‘𝐺)
rusgrnumwwlk.l 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))
Assertion
Ref Expression
rusgrnumwwlk ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝑃𝐿𝑁) = (𝐾𝑁))
Distinct variable groups:   𝑛,𝐺,𝑣,𝑤   𝑛,𝑁,𝑣,𝑤   𝑃,𝑛,𝑣,𝑤   𝑛,𝑉,𝑣,𝑤   𝑤,𝐾
Allowed substitution hints:   𝐾(𝑣,𝑛)   𝐿(𝑤,𝑣,𝑛)

Proof of Theorem rusgrnumwwlk
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7148 . . . . . . . 8 (𝑥 = 0 → (𝑃𝐿𝑥) = (𝑃𝐿0))
2 oveq2 7148 . . . . . . . 8 (𝑥 = 0 → (𝐾𝑥) = (𝐾↑0))
31, 2eqeq12d 2838 . . . . . . 7 (𝑥 = 0 → ((𝑃𝐿𝑥) = (𝐾𝑥) ↔ (𝑃𝐿0) = (𝐾↑0)))
43imbi2d 344 . . . . . 6 (𝑥 = 0 → ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑥) = (𝐾𝑥)) ↔ (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿0) = (𝐾↑0))))
5 oveq2 7148 . . . . . . . 8 (𝑥 = 𝑦 → (𝑃𝐿𝑥) = (𝑃𝐿𝑦))
6 oveq2 7148 . . . . . . . 8 (𝑥 = 𝑦 → (𝐾𝑥) = (𝐾𝑦))
75, 6eqeq12d 2838 . . . . . . 7 (𝑥 = 𝑦 → ((𝑃𝐿𝑥) = (𝐾𝑥) ↔ (𝑃𝐿𝑦) = (𝐾𝑦)))
87imbi2d 344 . . . . . 6 (𝑥 = 𝑦 → ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑥) = (𝐾𝑥)) ↔ (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑦) = (𝐾𝑦))))
9 oveq2 7148 . . . . . . . 8 (𝑥 = (𝑦 + 1) → (𝑃𝐿𝑥) = (𝑃𝐿(𝑦 + 1)))
10 oveq2 7148 . . . . . . . 8 (𝑥 = (𝑦 + 1) → (𝐾𝑥) = (𝐾↑(𝑦 + 1)))
119, 10eqeq12d 2838 . . . . . . 7 (𝑥 = (𝑦 + 1) → ((𝑃𝐿𝑥) = (𝐾𝑥) ↔ (𝑃𝐿(𝑦 + 1)) = (𝐾↑(𝑦 + 1))))
1211imbi2d 344 . . . . . 6 (𝑥 = (𝑦 + 1) → ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑥) = (𝐾𝑥)) ↔ (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿(𝑦 + 1)) = (𝐾↑(𝑦 + 1)))))
13 oveq2 7148 . . . . . . . 8 (𝑥 = 𝑁 → (𝑃𝐿𝑥) = (𝑃𝐿𝑁))
14 oveq2 7148 . . . . . . . 8 (𝑥 = 𝑁 → (𝐾𝑥) = (𝐾𝑁))
1513, 14eqeq12d 2838 . . . . . . 7 (𝑥 = 𝑁 → ((𝑃𝐿𝑥) = (𝐾𝑥) ↔ (𝑃𝐿𝑁) = (𝐾𝑁)))
1615imbi2d 344 . . . . . 6 (𝑥 = 𝑁 → ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑥) = (𝐾𝑥)) ↔ (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑁) = (𝐾𝑁))))
17 rusgrusgr 27352 . . . . . . . . 9 (𝐺 RegUSGraph 𝐾𝐺 ∈ USGraph)
18 usgruspgr 26969 . . . . . . . . 9 (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph)
1917, 18syl 17 . . . . . . . 8 (𝐺 RegUSGraph 𝐾𝐺 ∈ USPGraph)
20 simpr 488 . . . . . . . 8 ((𝑉 ∈ Fin ∧ 𝑃𝑉) → 𝑃𝑉)
21 rusgrnumwwlk.v . . . . . . . . 9 𝑉 = (Vtx‘𝐺)
22 rusgrnumwwlk.l . . . . . . . . 9 𝐿 = (𝑣𝑉, 𝑛 ∈ ℕ0 ↦ (♯‘{𝑤 ∈ (𝑛 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑣}))
2321, 22rusgrnumwwlkb0 27755 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ 𝑃𝑉) → (𝑃𝐿0) = 1)
2419, 20, 23syl2anr 599 . . . . . . 7 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿0) = 1)
25 simpl 486 . . . . . . . . . . 11 ((𝑉 ∈ Fin ∧ 𝑃𝑉) → 𝑉 ∈ Fin)
2625, 17anim12ci 616 . . . . . . . . . 10 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin))
2721isfusgr 27106 . . . . . . . . . 10 (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin))
2826, 27sylibr 237 . . . . . . . . 9 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → 𝐺 ∈ FinUSGraph)
29 simpr 488 . . . . . . . . 9 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → 𝐺 RegUSGraph 𝐾)
30 ne0i 4272 . . . . . . . . . 10 (𝑃𝑉𝑉 ≠ ∅)
3130ad2antlr 726 . . . . . . . . 9 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → 𝑉 ≠ ∅)
3221frusgrnn0 27359 . . . . . . . . . 10 ((𝐺 ∈ FinUSGraph ∧ 𝐺 RegUSGraph 𝐾𝑉 ≠ ∅) → 𝐾 ∈ ℕ0)
3332nn0cnd 11945 . . . . . . . . 9 ((𝐺 ∈ FinUSGraph ∧ 𝐺 RegUSGraph 𝐾𝑉 ≠ ∅) → 𝐾 ∈ ℂ)
3428, 29, 31, 33syl3anc 1368 . . . . . . . 8 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → 𝐾 ∈ ℂ)
3534exp0d 13500 . . . . . . 7 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝐾↑0) = 1)
3624, 35eqtr4d 2860 . . . . . 6 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿0) = (𝐾↑0))
37 simpl 486 . . . . . . . . . . 11 (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑉 ∈ Fin ∧ 𝑃𝑉))
3837anim1i 617 . . . . . . . . . 10 ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) ∧ 𝑦 ∈ ℕ0) → ((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝑦 ∈ ℕ0))
39 df-3an 1086 . . . . . . . . . 10 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑦 ∈ ℕ0) ↔ ((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝑦 ∈ ℕ0))
4038, 39sylibr 237 . . . . . . . . 9 ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) ∧ 𝑦 ∈ ℕ0) → (𝑉 ∈ Fin ∧ 𝑃𝑉𝑦 ∈ ℕ0))
4121, 22rusgrnumwwlks 27758 . . . . . . . . 9 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑦 ∈ ℕ0)) → ((𝑃𝐿𝑦) = (𝐾𝑦) → (𝑃𝐿(𝑦 + 1)) = (𝐾↑(𝑦 + 1))))
4229, 40, 41syl2an2r 684 . . . . . . . 8 ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) ∧ 𝑦 ∈ ℕ0) → ((𝑃𝐿𝑦) = (𝐾𝑦) → (𝑃𝐿(𝑦 + 1)) = (𝐾↑(𝑦 + 1))))
4342expcom 417 . . . . . . 7 (𝑦 ∈ ℕ0 → (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → ((𝑃𝐿𝑦) = (𝐾𝑦) → (𝑃𝐿(𝑦 + 1)) = (𝐾↑(𝑦 + 1)))))
4443a2d 29 . . . . . 6 (𝑦 ∈ ℕ0 → ((((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑦) = (𝐾𝑦)) → (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿(𝑦 + 1)) = (𝐾↑(𝑦 + 1)))))
454, 8, 12, 16, 36, 44nn0ind 12065 . . . . 5 (𝑁 ∈ ℕ0 → (((𝑉 ∈ Fin ∧ 𝑃𝑉) ∧ 𝐺 RegUSGraph 𝐾) → (𝑃𝐿𝑁) = (𝐾𝑁)))
4645expd 419 . . . 4 (𝑁 ∈ ℕ0 → ((𝑉 ∈ Fin ∧ 𝑃𝑉) → (𝐺 RegUSGraph 𝐾 → (𝑃𝐿𝑁) = (𝐾𝑁))))
4746com12 32 . . 3 ((𝑉 ∈ Fin ∧ 𝑃𝑉) → (𝑁 ∈ ℕ0 → (𝐺 RegUSGraph 𝐾 → (𝑃𝐿𝑁) = (𝐾𝑁))))
48473impia 1114 . 2 ((𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0) → (𝐺 RegUSGraph 𝐾 → (𝑃𝐿𝑁) = (𝐾𝑁)))
4948impcom 411 1 ((𝐺 RegUSGraph 𝐾 ∧ (𝑉 ∈ Fin ∧ 𝑃𝑉𝑁 ∈ ℕ0)) → (𝑃𝐿𝑁) = (𝐾𝑁))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2114   ≠ wne 3011  {crab 3134  ∅c0 4265   class class class wbr 5042  ‘cfv 6334  (class class class)co 7140   ∈ cmpo 7142  Fincfn 8496  ℂcc 10524  0cc0 10526  1c1 10527   + caddc 10529  ℕ0cn0 11885  ↑cexp 13425  ♯chash 13686  Vtxcvtx 26787  USPGraphcuspgr 26939  USGraphcusgr 26940  FinUSGraphcfusgr 27104   RegUSGraph crusgr 27344   WWalksN cwwlksn 27610 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446  ax-inf2 9092  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-nel 3116  df-ral 3135  df-rex 3136  df-reu 3137  df-rmo 3138  df-rab 3139  df-v 3471  df-sbc 3748  df-csb 3856  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-tp 4544  df-op 4546  df-uni 4814  df-int 4852  df-iun 4896  df-disj 5008  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5437  df-eprel 5442  df-po 5451  df-so 5452  df-fr 5491  df-se 5492  df-we 5493  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-res 5544  df-ima 5545  df-pred 6126  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6293  df-fun 6336  df-fn 6337  df-f 6338  df-f1 6339  df-fo 6340  df-f1o 6341  df-fv 6342  df-isom 6343  df-riota 7098  df-ov 7143  df-oprab 7144  df-mpo 7145  df-om 7566  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-1o 8089  df-2o 8090  df-oadd 8093  df-er 8276  df-map 8395  df-pm 8396  df-en 8497  df-dom 8498  df-sdom 8499  df-fin 8500  df-sup 8894  df-oi 8962  df-dju 9318  df-card 9356  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11626  df-2 11688  df-3 11689  df-n0 11886  df-xnn0 11956  df-z 11970  df-uz 12232  df-rp 12378  df-xadd 12496  df-fz 12886  df-fzo 13029  df-seq 13365  df-exp 13426  df-hash 13687  df-word 13858  df-lsw 13906  df-concat 13914  df-s1 13941  df-substr 13994  df-pfx 14024  df-cj 14449  df-re 14450  df-im 14451  df-sqrt 14585  df-abs 14586  df-clim 14836  df-sum 15034  df-vtx 26789  df-iedg 26790  df-edg 26839  df-uhgr 26849  df-ushgr 26850  df-upgr 26873  df-umgr 26874  df-uspgr 26941  df-usgr 26942  df-fusgr 27105  df-nbgr 27121  df-vtxdg 27254  df-rgr 27345  df-rusgr 27346  df-wwlks 27614  df-wwlksn 27615 This theorem is referenced by:  rusgrnumwwlkg  27760
 Copyright terms: Public domain W3C validator