| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cshnz | Structured version Visualization version GIF version | ||
| Description: A cyclical shift is the empty set if the number of shifts is not an integer. (Contributed by Alexander van der Vekens, 21-May-2018.) (Revised by AV, 17-Nov-2018.) |
| Ref | Expression |
|---|---|
| cshnz | ⊢ (¬ 𝑁 ∈ ℤ → (𝑊 cyclShift 𝑁) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-csh 14713 | . . 3 ⊢ cyclShift = (𝑤 ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)}, 𝑛 ∈ ℤ ↦ if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤)))))) | |
| 2 | 0ex 5249 | . . . 4 ⊢ ∅ ∈ V | |
| 3 | ovex 7386 | . . . 4 ⊢ ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤)))) ∈ V | |
| 4 | 2, 3 | ifex 4529 | . . 3 ⊢ if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤))))) ∈ V |
| 5 | 1, 4 | dmmpo 8013 | . 2 ⊢ dom cyclShift = ({𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} × ℤ) |
| 6 | id 22 | . . 3 ⊢ (¬ 𝑁 ∈ ℤ → ¬ 𝑁 ∈ ℤ) | |
| 7 | 6 | intnand 488 | . 2 ⊢ (¬ 𝑁 ∈ ℤ → ¬ (𝑊 ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} ∧ 𝑁 ∈ ℤ)) |
| 8 | ndmovg 7536 | . 2 ⊢ ((dom cyclShift = ({𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} × ℤ) ∧ ¬ (𝑊 ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} ∧ 𝑁 ∈ ℤ)) → (𝑊 cyclShift 𝑁) = ∅) | |
| 9 | 5, 7, 8 | sylancr 587 | 1 ⊢ (¬ 𝑁 ∈ ℤ → (𝑊 cyclShift 𝑁) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {cab 2707 ∃wrex 3053 ∅c0 4286 ifcif 4478 〈cop 4585 × cxp 5621 dom cdm 5623 Fn wfn 6481 ‘cfv 6486 (class class class)co 7353 0cc0 11028 ℕ0cn0 12402 ℤcz 12489 ..^cfzo 13575 mod cmo 13791 ♯chash 14255 ++ cconcat 14495 substr csubstr 14565 prefix cpfx 14595 cyclShift ccsh 14712 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 ax-un 7675 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-fv 6494 df-ov 7356 df-oprab 7357 df-mpo 7358 df-1st 7931 df-2nd 7932 df-csh 14713 |
| This theorem is referenced by: 0csh0 14717 cshwcl 14722 |
| Copyright terms: Public domain | W3C validator |