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 14142 | . . . 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 4431 | . . . 4 ⊢ (𝑤 = ∅ → if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤))))) = ∅) | |
4 | 3 | ad2antrl 727 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ (𝑤 = ∅ ∧ 𝑛 = 𝑁)) → if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (♯‘𝑤)), (♯‘𝑤)〉) ++ (𝑤 prefix (𝑛 mod (♯‘𝑤))))) = ∅) |
5 | 0nn0 11900 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
6 | f0 6534 | . . . . . . 7 ⊢ ∅:∅⟶V | |
7 | ffn 6487 | . . . . . . . 8 ⊢ (∅:∅⟶V → ∅ Fn ∅) | |
8 | fzo0 13056 | . . . . . . . . . 10 ⊢ (0..^0) = ∅ | |
9 | 8 | eqcomi 2807 | . . . . . . . . 9 ⊢ ∅ = (0..^0) |
10 | 9 | fneq2i 6421 | . . . . . . . 8 ⊢ (∅ Fn ∅ ↔ ∅ Fn (0..^0)) |
11 | 7, 10 | sylib 221 | . . . . . . 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 7143 | . . . . . . . . 9 ⊢ (𝑙 = 0 → (0..^𝑙) = (0..^0)) | |
15 | 14 | fneq2d 6417 | . . . . . . . 8 ⊢ (𝑙 = 0 → (∅ Fn (0..^𝑙) ↔ ∅ Fn (0..^0))) |
16 | 15 | adantl 485 | . . . . . . 7 ⊢ ((0 ∈ ℕ0 ∧ 𝑙 = 0) → (∅ Fn (0..^𝑙) ↔ ∅ Fn (0..^0))) |
17 | 13, 16 | rspcedv 3564 | . . . . . 6 ⊢ (0 ∈ ℕ0 → (∅ Fn (0..^0) → ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙))) |
18 | 5, 12, 17 | mp2 9 | . . . . 5 ⊢ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙) |
19 | 0ex 5175 | . . . . . 6 ⊢ ∅ ∈ V | |
20 | fneq1 6414 | . . . . . . 7 ⊢ (𝑓 = ∅ → (𝑓 Fn (0..^𝑙) ↔ ∅ Fn (0..^𝑙))) | |
21 | 20 | rexbidv 3256 | . . . . . 6 ⊢ (𝑓 = ∅ → (∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙) ↔ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙))) |
22 | 19, 21 | elab 3615 | . . . . 5 ⊢ (∅ ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} ↔ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙)) |
23 | 18, 22 | mpbir 234 | . . . 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 7281 | . 2 ⊢ (𝑁 ∈ ℤ → (∅ cyclShift 𝑁) = ∅) |
28 | cshnz 14145 | . 2 ⊢ (¬ 𝑁 ∈ ℤ → (∅ cyclShift 𝑁) = ∅) | |
29 | 27, 28 | pm2.61i 185 | 1 ⊢ (∅ cyclShift 𝑁) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 = wceq 1538 ∈ wcel 2111 {cab 2776 ∃wrex 3107 Vcvv 3441 ∅c0 4243 ifcif 4425 〈cop 4531 Fn wfn 6319 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 0cc0 10526 ℕ0cn0 11885 ℤcz 11969 ..^cfzo 13028 mod cmo 13232 ♯chash 13686 ++ cconcat 13913 substr csubstr 13993 prefix cpfx 14023 cyclShift ccsh 14141 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-csh 14142 |
This theorem is referenced by: cshw0 14147 cshwmodn 14148 cshwn 14150 cshwlen 14152 repswcshw 14165 |
Copyright terms: Public domain | W3C validator |