| 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 29609 | . . . . 5 ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph) | |
| 2 | 1 | adantr 485 | . . . 4 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → 𝐺 ∈ USGraph) |
| 3 | numclwwlk3.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 4 | 3 | clwwlknun 30400 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝑁 ClWWalksN 𝐺) = ∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) |
| 5 | 2, 4 | syl 18 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (𝑁 ClWWalksN 𝐺) = ∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) |
| 6 | 5 | fveq2d 6883 | . 2 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (♯‘(𝑁 ClWWalksN 𝐺)) = (♯‘∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁))) |
| 7 | 3 | fusgrvtxfi 29606 | . . . 4 ⊢ (𝐺 ∈ FinUSGraph → 𝑉 ∈ Fin) |
| 8 | 7 | adantr 485 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → 𝑉 ∈ Fin) |
| 9 | 3 | clwwlknonfin 30382 | . . . . . 6 ⊢ (𝑉 ∈ Fin → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
| 10 | 7, 9 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ FinUSGraph → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
| 11 | 10 | adantr 485 | . . . 4 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
| 12 | 11 | adantr 485 | . . 3 ⊢ (((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ 𝑉) → (𝑥(ClWWalksNOn‘𝐺)𝑁) ∈ Fin) |
| 13 | clwwlknondisj 30399 | . . . 4 ⊢ Disj 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁) | |
| 14 | 13 | a1i 11 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → Disj 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) |
| 15 | 8, 12, 14 | hashiun 15870 | . 2 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (♯‘∪ 𝑥 ∈ 𝑉 (𝑥(ClWWalksNOn‘𝐺)𝑁)) = Σ𝑥 ∈ 𝑉 (♯‘(𝑥(ClWWalksNOn‘𝐺)𝑁))) |
| 16 | 6, 15 | eqtrd 2804 | 1 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ) → (♯‘(𝑁 ClWWalksN 𝐺)) = Σ𝑥 ∈ 𝑉 (♯‘(𝑥(ClWWalksNOn‘𝐺)𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∪ ciun 4957 Disj wdisj 5077 ‘cfv 6534 (class class class)co 7408 Fincfn 8939 ℕcn 12229 ♯chash 14362 Σcsu 15733 Vtxcvtx 29283 USGraphcusgr 29436 FinUSGraphcfusgr 29603 ClWWalksN cclwwlkn 30312 ClWWalksNOncclwwlknon 30375 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-inf2 9606 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 ax-pre-sup 11174 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-disj 5078 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-isom 6543 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-oadd 8453 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-oi 9468 df-dju 9883 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-3 12300 df-n0 12501 df-xnn0 12574 df-z 12588 df-uz 12859 df-rp 13013 df-fz 13532 df-fzo 13679 df-seq 14034 df-exp 14094 df-hash 14363 df-word 14547 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-clim 15535 df-sum 15734 df-edg 29335 df-umgr 29370 df-usgr 29438 df-fusgr 29604 df-clwwlk 30270 df-clwwlkn 30313 df-clwwlknon 30376 |
| This theorem is referenced by: numclwwlk6 30678 |
| Copyright terms: Public domain | W3C validator |