| 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 30648 | . . 3 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ (ClWWalks‘𝐺)) | |
| 2 | clwwlknlen 30650 | . . . . . . 7 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (♯‘𝑊) = 𝑁) | |
| 3 | 2 | eqcomd 2769 | . . . . . 6 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑁 = (♯‘𝑊)) |
| 4 | 3 | oveq2d 7456 | . . . . 5 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (0...𝑁) = (0...(♯‘𝑊))) |
| 5 | 4 | eleq2d 2850 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → (𝑀 ∈ (0...𝑁) ↔ 𝑀 ∈ (0...(♯‘𝑊)))) |
| 6 | 5 | biimpa 482 | . . 3 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → 𝑀 ∈ (0...(♯‘𝑊))) |
| 7 | clwwisshclwwsn 30634 | . . 3 ⊢ ((𝑊 ∈ (ClWWalks‘𝐺) ∧ 𝑀 ∈ (0...(♯‘𝑊))) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) | |
| 8 | 1, 6, 7 | syl2an2r 698 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (𝑊 cyclShift 𝑀) ∈ (ClWWalks‘𝐺)) |
| 9 | eqid 2763 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 10 | 9 | clwwlknwrd 30652 | . . . 4 ⊢ (𝑊 ∈ (𝑁 ClWWalksN 𝐺) → 𝑊 ∈ Word (Vtx‘𝐺)) |
| 11 | elfzelz 13680 | . . . 4 ⊢ (𝑀 ∈ (0...𝑁) → 𝑀 ∈ ℤ) | |
| 12 | cshwlen 14975 | . . . 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 2798 | . 2 ⊢ ((𝑊 ∈ (𝑁 ClWWalksN 𝐺) ∧ 𝑀 ∈ (0...𝑁)) → (♯‘(𝑊 cyclShift 𝑀)) = 𝑁) |
| 16 | isclwwlkn 30645 | . 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 2147 ‘cfv 6555 (class class class)co 7440 0cc0 11224 ℤcz 12717 ...cfz 13663 ♯chash 14498 Word cword 14682 cyclShift ccsh 14964 Vtxcvtx 29601 ClWWalkscclwwlk 30599 ClWWalksN cclwwlkn 30642 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 ax-pre-sup 11302 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 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 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-1o 8501 df-er 8742 df-map 8874 df-en 8999 df-dom 9000 df-sdom 9001 df-fin 9002 df-sup 9458 df-inf 9459 df-card 10044 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-div 11998 df-nn 12360 df-2 12429 df-n0 12631 df-z 12718 df-uz 12990 df-rp 13145 df-ico 13506 df-fz 13664 df-fzo 13813 df-fl 13956 df-mod 14034 df-hash 14499 df-word 14683 df-lsw 14732 df-concat 14740 df-substr 14814 df-pfx 14846 df-csh 14965 df-clwwlk 30600 df-clwwlkn 30643 |
| This theorem is used by: clwwlknscsh 30680 |
| Copyright terms: Public domain | W3C validator |