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 27810 | . . 3 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ (ClWWalks‘𝐺)) | |
2 | clwwlknlen 27812 | . . . . . . 7 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (♯‘𝑊) = 𝑁) | |
3 | 2 | eqcomd 2829 | . . . . . 6 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑁 = (♯‘𝑊)) |
4 | 3 | oveq2d 7174 | . . . . 5 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (0...𝑁) = (0...(♯‘𝑊))) |
5 | 4 | eleq2d 2900 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (𝑀 ∈ (0...𝑁) ↔ 𝑀 ∈ (0...(♯‘𝑊)))) |
6 | 5 | biimpa 479 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ (0...(♯‘𝑊))) |
7 | clwwisshclwwsn 27796 | . . 3 ⊢ ((𝑊 ∈ (ClWWalks‘𝐺) ∧ 𝑀 ∈ (0...(♯‘𝑊))) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) | |
8 | 1, 6, 7 | syl2an2r 683 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) |
9 | eqid 2823 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
10 | 9 | clwwlknwrd 27814 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ Word (Vtx‘𝐺)) |
11 | elfzelz 12911 | . . . 4 ⊢ (𝑀 ∈ (0...𝑁) → 𝑀 ∈ ℤ) | |
12 | cshwlen 14163 | . . . 4 ⊢ ((𝑊 ∈ Word (Vtx‘𝐺) ∧ 𝑀 ∈ ℤ) → (♯‘(𝑊 cyclShift 𝑀)) = (♯‘𝑊)) | |
13 | 10, 11, 12 | syl2an 597 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘(𝑊 cyclShift 𝑀)) = (♯‘𝑊)) |
14 | 2 | adantr 483 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘𝑊) = 𝑁) |
15 | 13, 14 | eqtrd 2858 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘(𝑊 cyclShift 𝑀)) = 𝑁) |
16 | isclwwlkn 27807 | . 2 ⊢ ((𝑊 cyclShift 𝑀) ∈ (𝑁 ClWWalksN 𝐺) ↔ ((𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺) ∧ (♯‘(𝑊 cyclShift 𝑀)) = 𝑁)) | |
17 | 8, 15, 16 | sylanbrc 585 | 1 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (𝑁 ClWWalksN 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ‘cfv 6357 (class class class)co 7158 0cc0 10539 ℤcz 11984 ...cfz 12895 ♯chash 13693 Word cword 13864 cyclShift ccsh 14152 Vtxcvtx 26783 ClWWalkscclwwlk 27761 ClWWalksN cclwwlkn 27804 |
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 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-inf 8909 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-ico 12747 df-fz 12896 df-fzo 13037 df-fl 13165 df-mod 13241 df-hash 13694 df-word 13865 df-lsw 13917 df-concat 13925 df-substr 14005 df-pfx 14035 df-csh 14153 df-clwwlk 27762 df-clwwlkn 27805 |
This theorem is referenced by: clwwlknscsh 27843 |
Copyright terms: Public domain | W3C validator |