| 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 30122 | . . 3 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ (ClWWalks‘𝐺)) | |
| 2 | clwwlknlen 30124 | . . . . . . 7 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (♯‘𝑊) = 𝑁) | |
| 3 | 2 | eqcomd 2747 | . . . . . 6 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑁 = (♯‘𝑊)) |
| 4 | 3 | oveq2d 7376 | . . . . 5 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (0...𝑁) = (0...(♯‘𝑊))) |
| 5 | 4 | eleq2d 2827 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (𝑀 ∈ (0...𝑁) ↔ 𝑀 ∈ (0...(♯‘𝑊)))) |
| 6 | 5 | biimpa 478 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ (0...(♯‘𝑊))) |
| 7 | clwwisshclwwsn 30108 | . . 3 ⊢ ((𝑊 ∈ (ClWWalks‘𝐺) ∧ 𝑀 ∈ (0...(♯‘𝑊))) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) | |
| 8 | 1, 6, 7 | syl2an2r 692 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) |
| 9 | eqid 2741 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 10 | 9 | clwwlknwrd 30126 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ Word (Vtx‘𝐺)) |
| 11 | elfzelz 13473 | . . . 4 ⊢ (𝑀 ∈ (0...𝑁) → 𝑀 ∈ ℤ) | |
| 12 | cshwlen 14756 | . . . 4 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 𝑀 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑀)) = (♯‘𝑊)) | |
| 13 | 10, 11, 12 | syl2an 603 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘(𝑊 cyclShift 𝑀)) = (♯‘𝑊)) |
| 14 | 2 | adantr 482 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘𝑊) = 𝑁) |
| 15 | 13, 14 | eqtrd 2776 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘(𝑊 cyclShift 𝑀)) = 𝑁) |
| 16 | isclwwlkn 30119 | . 2 ⊢ ((𝑊 cyclShift 𝑀) ∈ (𝑁 ClWWalksN 𝐺) ↔ ((𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺) ∧ (♯‘(𝑊 cyclShift 𝑀)) = 𝑁)) | |
| 17 | 8, 15, 16 | sylanbrc 590 | 1 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (𝑁 ClWWalksN 𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ‘cfv 6489 (class class class)co 7360 0cc0 11033 ℤcz 12519 ...cfz 13456 ♯chash 14287 Word cword 14470 cyclShift ccsh 14745 Vtxcvtx 29087 ClWWalkscclwwlk 30073 ClWWalksN cclwwlkn 30116 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 ax-pre-sup 11111 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-div 11803 df-nn 12170 df-2 12239 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-ico 13299 df-fz 13457 df-fzo 13604 df-fl 13746 df-mod 13824 df-hash 14288 df-word 14471 df-lsw 14520 df-concat 14528 df-substr 14599 df-pfx 14629 df-csh 14746 df-clwwlk 30074 df-clwwlkn 30117 |
| This theorem is referenced by: clwwlknscsh 30154 |
| Copyright terms: Public domain | W3C validator |