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 13386 | . . . 4 ⊢ cyclShift = (𝑤 ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)}, 𝑛 ∈ ℤ ↦ if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (#‘𝑤)), (#‘𝑤)〉) ++ (𝑤 substr 〈0, (𝑛 mod (#‘𝑤))〉)))) | |
2 | 1 | a1i 11 | . . 3 ⊢ (𝑁 ∈ ℤ → cyclShift = (𝑤 ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)}, 𝑛 ∈ ℤ ↦ if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (#‘𝑤)), (#‘𝑤)〉) ++ (𝑤 substr 〈0, (𝑛 mod (#‘𝑤))〉))))) |
3 | iftrue 4042 | . . . 4 ⊢ (𝑤 = ∅ → if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (#‘𝑤)), (#‘𝑤)〉) ++ (𝑤 substr 〈0, (𝑛 mod (#‘𝑤))〉))) = ∅) | |
4 | 3 | ad2antrl 760 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ (𝑤 = ∅ ∧ 𝑛 = 𝑁)) → if(𝑤 = ∅, ∅, ((𝑤 substr 〈(𝑛 mod (#‘𝑤)), (#‘𝑤)〉) ++ (𝑤 substr 〈0, (𝑛 mod (#‘𝑤))〉))) = ∅) |
5 | 0nn0 11184 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
6 | f0 5999 | . . . . . . 7 ⊢ ∅:∅⟶V | |
7 | ffn 5958 | . . . . . . . 8 ⊢ (∅:∅⟶V → ∅ Fn ∅) | |
8 | fzo0 12361 | . . . . . . . . . 10 ⊢ (0..^0) = ∅ | |
9 | 8 | eqcomi 2619 | . . . . . . . . 9 ⊢ ∅ = (0..^0) |
10 | 9 | fneq2i 5900 | . . . . . . . 8 ⊢ (∅ Fn ∅ ↔ ∅ Fn (0..^0)) |
11 | 7, 10 | sylib 207 | . . . . . . 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 6557 | . . . . . . . . 9 ⊢ (𝑙 = 0 → (0..^𝑙) = (0..^0)) | |
15 | 14 | fneq2d 5896 | . . . . . . . 8 ⊢ (𝑙 = 0 → (∅ Fn (0..^𝑙) ↔ ∅ Fn (0..^0))) |
16 | 15 | adantl 481 | . . . . . . 7 ⊢ ((0 ∈ ℕ0 ∧ 𝑙 = 0) → (∅ Fn (0..^𝑙) ↔ ∅ Fn (0..^0))) |
17 | 13, 16 | rspcedv 3286 | . . . . . 6 ⊢ (0 ∈ ℕ0 → (∅ Fn (0..^0) → ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙))) |
18 | 5, 12, 17 | mp2 9 | . . . . 5 ⊢ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙) |
19 | 0ex 4718 | . . . . . 6 ⊢ ∅ ∈ V | |
20 | fneq1 5893 | . . . . . . 7 ⊢ (𝑓 = ∅ → (𝑓 Fn (0..^𝑙) ↔ ∅ Fn (0..^𝑙))) | |
21 | 20 | rexbidv 3034 | . . . . . 6 ⊢ (𝑓 = ∅ → (∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙) ↔ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙))) |
22 | 19, 21 | elab 3319 | . . . . 5 ⊢ (∅ ∈ {𝑓 ∣ ∃𝑙 ∈ ℕ0 𝑓 Fn (0..^𝑙)} ↔ ∃𝑙 ∈ ℕ0 ∅ Fn (0..^𝑙)) |
23 | 18, 22 | mpbir 220 | . . . 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 | ovmpt2d 6686 | . 2 ⊢ (𝑁 ∈ ℤ → (∅ cyclShift 𝑁) = ∅) |
28 | cshnz 13389 | . 2 ⊢ (¬ 𝑁 ∈ ℤ → (∅ cyclShift 𝑁) = ∅) | |
29 | 27, 28 | pm2.61i 175 | 1 ⊢ (∅ cyclShift 𝑁) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 = wceq 1475 ∈ wcel 1977 {cab 2596 ∃wrex 2897 Vcvv 3173 ∅c0 3874 ifcif 4036 〈cop 4131 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 ↦ cmpt2 6551 0cc0 9815 ℕ0cn0 11169 ℤcz 11254 ..^cfzo 12334 mod cmo 12530 #chash 12979 ++ cconcat 13148 substr csubstr 13150 cyclShift ccsh 13385 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335 df-csh 13386 |
This theorem is referenced by: cshw0 13391 cshwmodn 13392 cshwn 13394 cshwlen 13396 repswcshw 13409 |
Copyright terms: Public domain | W3C validator |