![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > cshws0 | Structured version Visualization version GIF version |
Description: The size of the set of (different!) words resulting by cyclically shifting an empty word is 0. (Contributed by AV, 8-Nov-2018.) |
Ref | Expression |
---|---|
cshwrepswhash1.m | ⊢ 𝑀 = {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} |
Ref | Expression |
---|---|
cshws0 | ⊢ (𝑊 = ∅ → (♯‘𝑀) = 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cshwrepswhash1.m | . . . 4 ⊢ 𝑀 = {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} | |
2 | 0ex 5269 | . . . . . . . . . . . 12 ⊢ ∅ ∈ V | |
3 | eleq1 2826 | . . . . . . . . . . . 12 ⊢ (𝑊 = ∅ → (𝑊 ∈ V ↔ ∅ ∈ V)) | |
4 | 2, 3 | mpbiri 258 | . . . . . . . . . . 11 ⊢ (𝑊 = ∅ → 𝑊 ∈ V) |
5 | hasheq0 14270 | . . . . . . . . . . . 12 ⊢ (𝑊 ∈ V → ((♯‘𝑊) = 0 ↔ 𝑊 = ∅)) | |
6 | 5 | bicomd 222 | . . . . . . . . . . 11 ⊢ (𝑊 ∈ V → (𝑊 = ∅ ↔ (♯‘𝑊) = 0)) |
7 | 4, 6 | syl 17 | . . . . . . . . . 10 ⊢ (𝑊 = ∅ → (𝑊 = ∅ ↔ (♯‘𝑊) = 0)) |
8 | 7 | ibi 267 | . . . . . . . . 9 ⊢ (𝑊 = ∅ → (♯‘𝑊) = 0) |
9 | 8 | oveq2d 7378 | . . . . . . . 8 ⊢ (𝑊 = ∅ → (0..^(♯‘𝑊)) = (0..^0)) |
10 | fzo0 13603 | . . . . . . . 8 ⊢ (0..^0) = ∅ | |
11 | 9, 10 | eqtrdi 2793 | . . . . . . 7 ⊢ (𝑊 = ∅ → (0..^(♯‘𝑊)) = ∅) |
12 | 11 | rexeqdv 3317 | . . . . . 6 ⊢ (𝑊 = ∅ → (∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤 ↔ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤)) |
13 | 12 | rabbidv 3418 | . . . . 5 ⊢ (𝑊 = ∅ → {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} = {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤}) |
14 | rex0 4322 | . . . . . . . 8 ⊢ ¬ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤 | |
15 | 14 | a1i 11 | . . . . . . 7 ⊢ (𝑊 = ∅ → ¬ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤) |
16 | 15 | ralrimivw 3148 | . . . . . 6 ⊢ (𝑊 = ∅ → ∀𝑤 ∈ Word 𝑉 ¬ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤) |
17 | rabeq0 4349 | . . . . . 6 ⊢ ({𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤} = ∅ ↔ ∀𝑤 ∈ Word 𝑉 ¬ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤) | |
18 | 16, 17 | sylibr 233 | . . . . 5 ⊢ (𝑊 = ∅ → {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ ∅ (𝑊 cyclShift 𝑛) = 𝑤} = ∅) |
19 | 13, 18 | eqtrd 2777 | . . . 4 ⊢ (𝑊 = ∅ → {𝑤 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(♯‘𝑊))(𝑊 cyclShift 𝑛) = 𝑤} = ∅) |
20 | 1, 19 | eqtrid 2789 | . . 3 ⊢ (𝑊 = ∅ → 𝑀 = ∅) |
21 | 20 | fveq2d 6851 | . 2 ⊢ (𝑊 = ∅ → (♯‘𝑀) = (♯‘∅)) |
22 | hash0 14274 | . 2 ⊢ (♯‘∅) = 0 | |
23 | 21, 22 | eqtrdi 2793 | 1 ⊢ (𝑊 = ∅ → (♯‘𝑀) = 0) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1542 ∈ wcel 2107 ∀wral 3065 ∃wrex 3074 {crab 3410 Vcvv 3448 ∅c0 4287 ‘cfv 6501 (class class class)co 7362 0cc0 11058 ..^cfzo 13574 ♯chash 14237 Word cword 14409 cyclShift ccsh 14683 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2708 ax-sep 5261 ax-nul 5268 ax-pow 5325 ax-pr 5389 ax-un 7677 ax-cnex 11114 ax-resscn 11115 ax-1cn 11116 ax-icn 11117 ax-addcl 11118 ax-addrcl 11119 ax-mulcl 11120 ax-mulrcl 11121 ax-mulcom 11122 ax-addass 11123 ax-mulass 11124 ax-distr 11125 ax-i2m1 11126 ax-1ne0 11127 ax-1rid 11128 ax-rnegex 11129 ax-rrecex 11130 ax-cnre 11131 ax-pre-lttri 11132 ax-pre-lttrn 11133 ax-pre-ltadd 11134 ax-pre-mulgt0 11135 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3066 df-rex 3075 df-reu 3357 df-rab 3411 df-v 3450 df-sbc 3745 df-csb 3861 df-dif 3918 df-un 3920 df-in 3922 df-ss 3932 df-pss 3934 df-nul 4288 df-if 4492 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-int 4913 df-iun 4961 df-br 5111 df-opab 5173 df-mpt 5194 df-tr 5228 df-id 5536 df-eprel 5542 df-po 5550 df-so 5551 df-fr 5593 df-we 5595 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6258 df-ord 6325 df-on 6326 df-lim 6327 df-suc 6328 df-iota 6453 df-fun 6503 df-fn 6504 df-f 6505 df-f1 6506 df-fo 6507 df-f1o 6508 df-fv 6509 df-riota 7318 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7808 df-1st 7926 df-2nd 7927 df-frecs 8217 df-wrecs 8248 df-recs 8322 df-rdg 8361 df-1o 8417 df-er 8655 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-card 9882 df-pnf 11198 df-mnf 11199 df-xr 11200 df-ltxr 11201 df-le 11202 df-sub 11394 df-neg 11395 df-nn 12161 df-n0 12421 df-z 12507 df-uz 12771 df-fz 13432 df-fzo 13575 df-hash 14238 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |