Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > numclwwlk4 | Structured version Visualization version GIF version |
Description: The total number of closed walks in a finite simple graph is the sum of the numbers of closed walks starting at each of its vertices. (Contributed by Alexander van der Vekens, 7-Oct-2018.) (Revised by AV, 2-Jun-2021.) (Revised by AV, 7-Mar-2022.) (Proof shortened by AV, 28-Mar-2022.) |
Ref | Expression |
---|---|
numclwwlk3.v | ⊢ 𝑉 = (Vtx‘𝐺) |
Ref | Expression |
---|---|
numclwwlk4 | ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (♯‘(𝑁 ClWWalksN 𝐺)) = Σ𝑥 ∈ 𝑉 (♯‘(𝑥(ClWWalksNOn‘𝐺)𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fusgrusgr 27085 | . . . . 5 ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph) | |
2 | 1 | adantr 483 | . . . 4 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → 𝐺 ∈ USGraph) |
3 | numclwwlk3.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
4 | 3 | clwwlknun 27870 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝑁 ClWWalksN 𝐺) = ∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) |
5 | 2, 4 | syl 17 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (𝑁 ClWWalksN 𝐺) = ∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) |
6 | 5 | fveq2d 6655 | . 2 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (♯‘(𝑁 ClWWalksN 𝐺)) = (♯‘∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁))) |
7 | 3 | fusgrvtxfi 27082 | . . . 4 ⊢ (𝐺 ∈ FinUSGraph → 𝑉 ∈ Fin) |
8 | 7 | adantr 483 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → 𝑉 ∈ Fin) |
9 | 3 | clwwlknonfin 27852 | . . . . . 6 ⊢ (𝑉 ∈ Fin → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
10 | 7, 9 | syl 17 | . . . . 5 ⊢ (𝐺 ∈ FinUSGraph → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
11 | 10 | adantr 483 | . . . 4 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
12 | 11 | adantr 483 | . . 3 ⊢ (((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ 𝑉) → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
13 | clwwlknondisj 27869 | . . . 4 ⊢ Disj 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁) | |
14 | 13 | a1i 11 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → Disj 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) |
15 | 8, 12, 14 | hashiun 15157 | . 2 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (♯‘∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) = Σ𝑥 ∈ 𝑉 (♯‘(𝑥(ClWWalksNOn‘𝐺)𝑁))) |
16 | 6, 15 | eqtrd 2855 | 1 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (♯‘(𝑁 ClWWalksN 𝐺)) = Σ𝑥 ∈ 𝑉 (♯‘(𝑥(ClWWalksNOn‘𝐺)𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∪ ciun 4900 Disj wdisj 5012 ‘cfv 6336 (class class class)co 7137 Fincfn 8490 ℕcn 11619 ♯chash 13675 Σcsu 15022 Vtxcvtx 26762 USGraphcusgr 26915 FinUSGraphcfusgr 27079 ClWWalksN cclwwlkn 27782 ClWWalksNOncclwwlknon 27845 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2792 ax-rep 5171 ax-sep 5184 ax-nul 5191 ax-pow 5247 ax-pr 5311 ax-un 7442 ax-inf2 9085 ax-cnex 10574 ax-resscn 10575 ax-1cn 10576 ax-icn 10577 ax-addcl 10578 ax-addrcl 10579 ax-mulcl 10580 ax-mulrcl 10581 ax-mulcom 10582 ax-addass 10583 ax-mulass 10584 ax-distr 10585 ax-i2m1 10586 ax-1ne0 10587 ax-1rid 10588 ax-rnegex 10589 ax-rrecex 10590 ax-cnre 10591 ax-pre-lttri 10592 ax-pre-lttrn 10593 ax-pre-ltadd 10594 ax-pre-mulgt0 10595 ax-pre-sup 10596 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2891 df-nfc 2959 df-ne 3012 df-nel 3119 df-ral 3138 df-rex 3139 df-reu 3140 df-rmo 3141 df-rab 3142 df-v 3483 df-sbc 3759 df-csb 3867 df-dif 3922 df-un 3924 df-in 3926 df-ss 3935 df-pss 3937 df-nul 4275 df-if 4449 df-pw 4522 df-sn 4549 df-pr 4551 df-tp 4553 df-op 4555 df-uni 4820 df-int 4858 df-iun 4902 df-disj 5013 df-br 5048 df-opab 5110 df-mpt 5128 df-tr 5154 df-id 5441 df-eprel 5446 df-po 5455 df-so 5456 df-fr 5495 df-se 5496 df-we 5497 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6295 df-fun 6338 df-fn 6339 df-f 6340 df-f1 6341 df-fo 6342 df-f1o 6343 df-fv 6344 df-isom 6345 df-riota 7095 df-ov 7140 df-oprab 7141 df-mpo 7142 df-om 7562 df-1st 7670 df-2nd 7671 df-wrecs 7928 df-recs 7989 df-rdg 8027 df-1o 8083 df-2o 8084 df-oadd 8087 df-er 8270 df-map 8389 df-pm 8390 df-en 8491 df-dom 8492 df-sdom 8493 df-fin 8494 df-sup 8887 df-oi 8955 df-dju 9311 df-card 9349 df-pnf 10658 df-mnf 10659 df-xr 10660 df-ltxr 10661 df-le 10662 df-sub 10853 df-neg 10854 df-div 11279 df-nn 11620 df-2 11682 df-3 11683 df-n0 11880 df-xnn0 11950 df-z 11964 df-uz 12226 df-rp 12372 df-fz 12878 df-fzo 13019 df-seq 13355 df-exp 13415 df-hash 13676 df-word 13847 df-cj 14438 df-re 14439 df-im 14440 df-sqrt 14574 df-abs 14575 df-clim 14825 df-sum 15023 df-edg 26814 df-umgr 26849 df-usgr 26917 df-fusgr 27080 df-clwwlk 27740 df-clwwlkn 27783 df-clwwlknon 27846 |
This theorem is referenced by: numclwwlk6 28148 |
Copyright terms: Public domain | W3C validator |