Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wlksnfi | Structured version Visualization version GIF version |
Description: The number of walks of fixed length is finite if the number of vertices is finite (in the graph). (Contributed by Alexander van der Vekens, 25-Aug-2018.) (Revised by AV, 20-Apr-2021.) |
Ref | Expression |
---|---|
wlksnfi | ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ0) → {𝑝 ∈ (Walks‘𝐺) ∣ (♯‘(1st ‘𝑝)) = 𝑁} ∈ Fin) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2740 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
2 | 1 | fusgrvtxfi 27684 | . . . 4 ⊢ (𝐺 ∈ FinUSGraph → (Vtx‘𝐺) ∈ Fin) |
3 | 2 | adantr 481 | . . 3 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ0) → (Vtx‘𝐺) ∈ Fin) |
4 | wwlksnfi 28267 | . . 3 ⊢ ((Vtx‘𝐺) ∈ Fin → (𝑁 WWalksN 𝐺) ∈ Fin) | |
5 | 3, 4 | syl 17 | . 2 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ0) → (𝑁 WWalksN 𝐺) ∈ Fin) |
6 | fusgrusgr 27687 | . . . 4 ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USGraph) | |
7 | usgruspgr 27546 | . . . 4 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ USPGraph) | |
8 | 6, 7 | syl 17 | . . 3 ⊢ (𝐺 ∈ FinUSGraph → 𝐺 ∈ USPGraph) |
9 | wlknwwlksnen 28250 | . . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑁 ∈ ℕ0) → {𝑝 ∈ (Walks‘𝐺) ∣ (♯‘(1st ‘𝑝)) = 𝑁} ≈ (𝑁 WWalksN 𝐺)) | |
10 | 8, 9 | sylan 580 | . 2 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ0) → {𝑝 ∈ (Walks‘𝐺) ∣ (♯‘(1st ‘𝑝)) = 𝑁} ≈ (𝑁 WWalksN 𝐺)) |
11 | enfii 8954 | . 2 ⊢ (((𝑁 WWalksN 𝐺) ∈ Fin ∧ {𝑝 ∈ (Walks‘𝐺) ∣ (♯‘(1st ‘𝑝)) = 𝑁} ≈ (𝑁 WWalksN 𝐺)) → {𝑝 ∈ (Walks‘𝐺) ∣ (♯‘(1st ‘𝑝)) = 𝑁} ∈ Fin) | |
12 | 5, 10, 11 | syl2anc 584 | 1 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑁 ∈ ℕ0) → {𝑝 ∈ (Walks‘𝐺) ∣ (♯‘(1st ‘𝑝)) = 𝑁} ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1542 ∈ wcel 2110 {crab 3070 class class class wbr 5079 ‘cfv 6432 (class class class)co 7271 1st c1st 7822 ≈ cen 8713 Fincfn 8716 ℕ0cn0 12233 ♯chash 14042 Vtxcvtx 27364 USPGraphcuspgr 27516 USGraphcusgr 27517 FinUSGraphcfusgr 27681 Walkscwlks 27961 WWalksN cwwlksn 28187 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-rep 5214 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 ax-cnex 10928 ax-resscn 10929 ax-1cn 10930 ax-icn 10931 ax-addcl 10932 ax-addrcl 10933 ax-mulcl 10934 ax-mulrcl 10935 ax-mulcom 10936 ax-addass 10937 ax-mulass 10938 ax-distr 10939 ax-i2m1 10940 ax-1ne0 10941 ax-1rid 10942 ax-rnegex 10943 ax-rrecex 10944 ax-cnre 10945 ax-pre-lttri 10946 ax-pre-lttrn 10947 ax-pre-ltadd 10948 ax-pre-mulgt0 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-ifp 1061 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-int 4886 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6201 df-ord 6268 df-on 6269 df-lim 6270 df-suc 6271 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-riota 7228 df-ov 7274 df-oprab 7275 df-mpo 7276 df-om 7707 df-1st 7824 df-2nd 7825 df-frecs 8088 df-wrecs 8119 df-recs 8193 df-rdg 8232 df-1o 8288 df-2o 8289 df-oadd 8292 df-er 8481 df-map 8600 df-pm 8601 df-en 8717 df-dom 8718 df-sdom 8719 df-fin 8720 df-dju 9660 df-card 9698 df-pnf 11012 df-mnf 11013 df-xr 11014 df-ltxr 11015 df-le 11016 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-n0 12234 df-xnn0 12306 df-z 12320 df-uz 12582 df-fz 13239 df-fzo 13382 df-seq 13720 df-exp 13781 df-hash 14043 df-word 14216 df-edg 27416 df-uhgr 27426 df-upgr 27450 df-uspgr 27518 df-usgr 27519 df-fusgr 27682 df-wlks 27964 df-wwlks 28191 df-wwlksn 28192 |
This theorem is referenced by: clwlknon2num 28728 numclwlk1lem2 28730 |
Copyright terms: Public domain | W3C validator |