| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cshwidx0 | Structured version Visualization version GIF version | ||
| Description: The symbol at index 0 of a cyclically shifted nonempty word is the symbol at index N of the original word. (Contributed by AV, 15-May-2018.) (Revised by AV, 21-May-2018.) (Revised by AV, 30-Oct-2018.) |
| Ref | Expression |
|---|---|
| cshwidx0 | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊))) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hasheq0 14406 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → ((♯‘𝑊) = 0 ↔ 𝑊 = ∅)) | |
| 2 | elfzo0 13736 | . . . . . . . 8 ⊢ (𝑁 ∈ (0..^(♯‘𝑊)) ↔ (𝑁 ∈ ℕ0 ∧ (♯‘𝑊) ∈ ℕ ∧ 𝑁 < (♯‘𝑊))) | |
| 3 | elnnne0 12524 | . . . . . . . . . 10 ⊢ ((♯‘𝑊) ∈ ℕ ↔ ((♯‘𝑊) ∈ ℕ0 ∧ (♯‘𝑊) ≠ 0)) | |
| 4 | eqneqall 2968 | . . . . . . . . . . . 12 ⊢ ((♯‘𝑊) = 0 → ((♯‘𝑊) ≠ 0 → (𝑊 ∈ Word 𝑉 → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) | |
| 5 | 4 | com12 33 | . . . . . . . . . . 11 ⊢ ((♯‘𝑊) ≠ 0 → ((♯‘𝑊) = 0 → (𝑊 ∈ Word 𝑉 → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 6 | 5 | adantl 486 | . . . . . . . . . 10 ⊢ (((♯‘𝑊) ∈ ℕ0 ∧ (♯‘𝑊) ≠ 0) → ((♯‘𝑊) = 0 → (𝑊 ∈ Word 𝑉 → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 7 | 3, 6 | sylbi 220 | . . . . . . . . 9 ⊢ ((♯‘𝑊) ∈ ℕ → ((♯‘𝑊) = 0 → (𝑊 ∈ Word 𝑉 → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 8 | 7 | 3ad2ant2 1151 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (♯‘𝑊) ∈ ℕ ∧ 𝑁 < (♯‘𝑊)) → ((♯‘𝑊) = 0 → (𝑊 ∈ Word 𝑉 → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 9 | 2, 8 | sylbi 220 | . . . . . . 7 ⊢ (𝑁 ∈ (0..^(♯‘𝑊)) → ((♯‘𝑊) = 0 → (𝑊 ∈ Word 𝑉 → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 10 | 9 | com13 89 | . . . . . 6 ⊢ (𝑊 ∈ Word 𝑉 → ((♯‘𝑊) = 0 → (𝑁 ∈ (0..^(♯‘𝑊)) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 11 | 1, 10 | sylbird 263 | . . . . 5 ⊢ (𝑊 ∈ Word 𝑉 → (𝑊 = ∅ → (𝑁 ∈ (0..^(♯‘𝑊)) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 12 | 11 | com23 87 | . . . 4 ⊢ (𝑊 ∈ Word 𝑉 → (𝑁 ∈ (0..^(♯‘𝑊)) → (𝑊 = ∅ → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)))) |
| 13 | 12 | imp 411 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊))) → (𝑊 = ∅ → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁))) |
| 14 | 13 | com12 33 | . 2 ⊢ (𝑊 = ∅ → ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊))) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁))) |
| 15 | simpl 487 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊))) → 𝑊 ∈ Word 𝑉) | |
| 16 | 15 | adantl 486 | . . . . 5 ⊢ ((𝑊 ≠ ∅ ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊)))) → 𝑊 ∈ Word 𝑉) |
| 17 | simpl 487 | . . . . 5 ⊢ ((𝑊 ≠ ∅ ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊)))) → 𝑊 ≠ ∅) | |
| 18 | elfzoelz 13694 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝑊)) → 𝑁 ∈ ℤ) | |
| 19 | 18 | ad2antll 741 | . . . . 5 ⊢ ((𝑊 ≠ ∅ ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊)))) → 𝑁 ∈ ℤ) |
| 20 | cshwidx0mod 14849 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑊 ≠ ∅ ∧ 𝑁 ∈ ℤ) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘(𝑁 mod (♯‘𝑊)))) | |
| 21 | 16, 17, 19, 20 | syl3anc 1397 | . . . 4 ⊢ ((𝑊 ≠ ∅ ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊)))) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘(𝑁 mod (♯‘𝑊)))) |
| 22 | zmodidfzoimp 13941 | . . . . . 6 ⊢ (𝑁 ∈ (0..^(♯‘𝑊)) → (𝑁 mod (♯‘𝑊)) = 𝑁) | |
| 23 | 22 | ad2antll 741 | . . . . 5 ⊢ ((𝑊 ≠ ∅ ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊)))) → (𝑁 mod (♯‘𝑊)) = 𝑁) |
| 24 | 23 | fveq2d 6885 | . . . 4 ⊢ ((𝑊 ≠ ∅ ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊)))) → (𝑊‘(𝑁 mod (♯‘𝑊))) = (𝑊‘𝑁)) |
| 25 | 21, 24 | eqtrd 2797 | . . 3 ⊢ ((𝑊 ≠ ∅ ∧ (𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊)))) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)) |
| 26 | 25 | ex 417 | . 2 ⊢ (𝑊 ≠ ∅ → ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊))) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁))) |
| 27 | 14, 26 | pm2.61ine 3040 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑁 ∈ (0..^(♯‘𝑊))) → ((𝑊 cyclShift 𝑁)‘0) = (𝑊‘𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 ∅c0 4285 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 0cc0 11106 < clt 11249 ℕcn 12239 ℕ0cn0 12510 ℤcz 12597 ..^cfzo 13689 mod cmo 13909 ♯chash 14373 Word cword 14557 cyclShift ccsh 14832 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9400 df-inf 9401 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-fz 13542 df-fzo 13690 df-fl 13832 df-mod 13910 df-hash 14374 df-word 14558 df-concat 14615 df-substr 14686 df-pfx 14716 df-csh 14833 |
| This theorem is used by: clwwisshclwws 30377 |
| Copyright terms: Public domain | W3C validator |