| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > clwwnisshclwwsn | Structured version Visualization version GIF version | ||
| Description: Cyclically shifting a closed walk as word of fixed length results in a closed walk as word of the same length (in an undirected graph). (Contributed by Alexander van der Vekens, 10-Jun-2018.) (Revised by AV, 29-Apr-2021.) (Proof shortened by AV, 22-Mar-2022.) |
| Ref | Expression |
|---|---|
| clwwnisshclwwsn | ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (𝑁 ClWWalksN 𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clwwlkclwwlkn 30532 | . . 3 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ (ClWWalks‘𝐺)) | |
| 2 | clwwlknlen 30534 | . . . . . . 7 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (♯‘𝑊) = 𝑁) | |
| 3 | 2 | eqcomd 2766 | . . . . . 6 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑁 = (♯‘𝑊)) |
| 4 | 3 | oveq2d 7432 | . . . . 5 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (0...𝑁) = (0...(♯‘𝑊))) |
| 5 | 4 | eleq2d 2846 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (𝑀 ∈ (0...𝑁) ↔ 𝑀 ∈ (0...(♯‘𝑊)))) |
| 6 | 5 | biimpa 482 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ (0...(♯‘𝑊))) |
| 7 | clwwisshclwwsn 30518 | . . 3 ⊢ ((𝑊 ∈ (ClWWalks‘𝐺) ∧ 𝑀 ∈ (0...(♯‘𝑊))) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) | |
| 8 | 1, 6, 7 | syl2an2r 698 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) |
| 9 | eqid 2760 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 10 | 9 | clwwlknwrd 30536 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ Word (Vtx‘𝐺)) |
| 11 | elfzelz 13603 | . . . 4 ⊢ (𝑀 ∈ (0...𝑁) → 𝑀 ∈ ℤ) | |
| 12 | cshwlen 14895 | . . . 4 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 𝑀 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑀)) = (♯‘𝑊)) | |
| 13 | 10, 11, 12 | syl2an 608 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘(𝑊 cyclShift 𝑀)) = (♯‘𝑊)) |
| 14 | 2 | adantr 486 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘𝑊) = 𝑁) |
| 15 | 13, 14 | eqtrd 2795 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘(𝑊 cyclShift 𝑀)) = 𝑁) |
| 16 | isclwwlkn 30529 | . 2 ⊢ ((𝑊 cyclShift 𝑀) ∈ (𝑁 ClWWalksN 𝐺) ↔ ((𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺) ∧ (♯‘(𝑊 cyclShift 𝑀)) = 𝑁)) | |
| 17 | 8, 15, 16 | sylanbrc 595 | 1 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (𝑁 ClWWalksN 𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6535 (class class class)co 7416 0cc0 11149 ℤcz 12640 ...cfz 13586 ♯chash 14419 Word cword 14603 cyclShift ccsh 14884 Vtxcvtx 29485 ClWWalkscclwwlk 30483 ClWWalksN cclwwlkn 30526 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7742 ax-cnex 11205 ax-resscn 11206 ax-1cn 11207 ax-icn 11208 ax-addcl 11209 ax-addrcl 11210 ax-mulcl 11211 ax-mulrcl 11212 ax-mulcom 11213 ax-addass 11214 ax-mulass 11215 ax-distr 11216 ax-i2m1 11217 ax-1ne0 11218 ax-1rid 11219 ax-rnegex 11220 ax-rrecex 11221 ax-cnre 11222 ax-pre-lttri 11223 ax-pre-lttrn 11224 ax-pre-ltadd 11225 ax-pre-mulgt0 11226 ax-pre-sup 11227 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6301 df-ord 6362 df-on 6363 df-lim 6364 df-suc 6365 df-iota 6491 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8365 df-rdg 8404 df-1o 8462 df-er 8703 df-map 8835 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-sup 9419 df-inf 9420 df-card 9969 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11492 df-neg 11493 df-div 11921 df-nn 12283 df-2 12352 df-n0 12554 df-z 12641 df-uz 12913 df-rp 13068 df-ico 13429 df-fz 13587 df-fzo 13735 df-fl 13878 df-mod 13956 df-hash 14420 df-word 14604 df-lsw 14653 df-concat 14661 df-substr 14734 df-pfx 14766 df-csh 14885 df-clwwlk 30484 df-clwwlkn 30527 |
| This theorem is used by: clwwlknscsh 30564 |
| Copyright terms: Public domain | W3C validator |