Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0csh0 | Structured version Visualization version GIF version |
Description: Cyclically shifting an empty set/word always results in the empty word/set. (Contributed by AV, 25-Oct-2018.) (Revised by AV, 17-Nov-2018.) |
Ref | Expression |
---|---|
0csh0 | ⊢ (∅ cyclShift 𝑁) = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-csh 14139 | . . . 4 ⊢ cyclShift = (𝑤 ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)}, 𝑛 ∈ ℤ ↦ if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤)))))) | |
2 | 1 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℤ → cyclShift = (𝑤 ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)}, 𝑛 ∈ ℤ ↦ if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤))))))) |
3 | iftrue 4469 | . . . 4 ⊢ (𝑤 = ∅ → if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤))))) = ∅) | |
4 | 3 | ad2antrl 724 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ (𝑤 = ∅ ∧ 𝑛 = 𝑁)) → if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤))))) = ∅) |
5 | 0nn0 11900 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
6 | f0 6553 | . . . . . . 7 ⊢ ∅:∅⟶V | |
7 | ffn 6507 | . . . . . . . 8 ⊢ (∅:∅⟶V → ∅ Fn ∅) | |
8 | fzo0 13049 | . . . . . . . . . 10 ⊢ (0..^0) = ∅ | |
9 | 8 | eqcomi 2827 | . . . . . . . . 9 ⊢ ∅ = (0..^0) |
10 | 9 | fneq2i 6444 | . . . . . . . 8 ⊢ (∅ Fn ∅ ↔ ∅ Fn (0..^0)) |
11 | 7, 10 | sylib 219 | . . . . . . 7 ⊢ (∅:∅⟶V → ∅ Fn (0..^0)) |
12 | 6, 11 | ax-mp 5 | . . . . . 6 ⊢ ∅ Fn (0..^0) |
13 | id 22 | . . . . . . 7 ⊢ (0 ∈ ℕ0 → 0 ∈ ℕ0) | |
14 | oveq2 7153 | . . . . . . . . 9 ⊢ (𝑙 = 0 → (0..^𝑙) = (0..^0)) | |
15 | 14 | fneq2d 6440 | . . . . . . . 8 ⊢ (𝑙 = 0 → (∅ Fn (0..^𝑙) ↔ ∅ Fn (0..^0))) |
16 | 15 | adantl 482 | . . . . . . 7 ⊢ ((0 ∈ ℕ0 ∧ 𝑙 = 0) → (∅ Fn (0..^𝑙) ↔ ∅ Fn (0..^0))) |
17 | 13, 16 | rspcedv 3613 | . . . . . 6 ⊢ (0 ∈ ℕ0 → (∅ Fn (0..^0) → ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙))) |
18 | 5, 12, 17 | mp2 9 | . . . . 5 ⊢ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙) |
19 | 0ex 5202 | . . . . . 6 ⊢ ∅ ∈ V | |
20 | fneq1 6437 | . . . . . . 7 ⊢ (𝑓 = ∅ → (𝑓 Fn (0..^𝑙) ↔ ∅ Fn (0..^𝑙))) | |
21 | 20 | rexbidv 3294 | . . . . . 6 ⊢ (𝑓 = ∅ → (∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙) ↔ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙))) |
22 | 19, 21 | elab 3664 | . . . . 5 ⊢ (∅ ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} ↔ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙)) |
23 | 18, 22 | mpbir 232 | . . . 4 ⊢ ∅ ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} |
24 | 23 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℤ → ∅ ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)}) |
25 | id 22 | . . 3 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℤ) | |
26 | 19 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℤ → ∅ ∈ V) |
27 | 2, 4, 24, 25, 26 | ovmpod 7291 | . 2 ⊢ (𝑁 ∈ ℤ → (∅ cyclShift 𝑁) = ∅) |
28 | cshnz 14142 | . 2 ⊢ (¬ 𝑁 ∈ ℤ → (∅ cyclShift 𝑁) = ∅) | |
29 | 27, 28 | pm2.61i 183 | 1 ⊢ (∅ cyclShift 𝑁) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 207 = wceq 1528 ∈ wcel 2105 {cab 2796 ∃wrex 3136 Vcvv 3492 ∅c0 4288 ifcif 4463 〈cop 4563 Fn wfn 6343 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 ∈ cmpo 7147 0cc0 10525 ℕ0cn0 11885 ℤcz 11969 ..^cfzo 13021 mod cmo 13225 ♯chash 13678 ++ cconcat 13910 substr csubstr 13990 prefix cpfx 14020 cyclShift ccsh 14138 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-fzo 13022 df-csh 14139 |
This theorem is referenced by: cshw0 14144 cshwmodn 14145 cshwn 14147 cshwlen 14149 repswcshw 14162 |
Copyright terms: Public domain | W3C validator |