| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cshwsdisj | Structured version Visualization version GIF version | ||
| Description: The singletons resulting by cyclically shifting a given word of length being a prime number and not consisting of identical symbols is a disjoint collection. (Contributed by Alexander van der Vekens, 19-May-2018.) (Revised by Alexander van der Vekens, 8-Jun-2018.) |
| Ref | Expression |
|---|---|
| cshwshash.0 | ⊢ (𝜑 → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ)) |
| Ref | Expression |
|---|---|
| cshwsdisj | ⊢ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → Disj 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orc 868 | . . . . 5 ⊢ (𝑛 = 𝑗 → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) | |
| 2 | 1 | a1d 25 | . . . 4 ⊢ (𝑛 = 𝑗 → (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅))) |
| 3 | simprl 771 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → (𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0))) | |
| 4 | simprrl 781 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → 𝑛 ∈ (0..^(♯‘𝑊))) | |
| 5 | simprrr 782 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → 𝑗 ∈ (0..^(♯‘𝑊))) | |
| 6 | necom 2985 | . . . . . . . . . 10 ⊢ (𝑛 ≠ 𝑗 ↔ 𝑗 ≠ 𝑛) | |
| 7 | 6 | biimpi 216 | . . . . . . . . 9 ⊢ (𝑛 ≠ 𝑗 → 𝑗 ≠ 𝑛) |
| 8 | 7 | adantr 480 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → 𝑗 ≠ 𝑛) |
| 9 | cshwshash.0 | . . . . . . . . . 10 ⊢ (𝜑 → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ)) | |
| 10 | 9 | cshwshashlem3 17068 | . . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → ((𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ≠ 𝑛) → (𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗))) |
| 11 | 10 | imp 406 | . . . . . . . 8 ⊢ (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ≠ 𝑛)) → (𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗)) |
| 12 | 3, 4, 5, 8, 11 | syl13anc 1375 | . . . . . . 7 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → (𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗)) |
| 13 | disjsn2 4656 | . . . . . . 7 ⊢ ((𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗) → ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅) | |
| 14 | 12, 13 | syl 17 | . . . . . 6 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅) |
| 15 | 14 | olcd 875 | . . . . 5 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
| 16 | 15 | ex 412 | . . . 4 ⊢ (𝑛 ≠ 𝑗 → (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅))) |
| 17 | 2, 16 | pm2.61ine 3015 | . . 3 ⊢ (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
| 18 | 17 | ralrimivva 3180 | . 2 ⊢ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → ∀𝑛 ∈ (0..^(♯‘𝑊))∀𝑗 ∈ (0..^(♯‘𝑊))(𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
| 19 | oveq2 7375 | . . . 4 ⊢ (𝑛 = 𝑗 → (𝑊 cyclShift 𝑛) = (𝑊 cyclShift 𝑗)) | |
| 20 | 19 | sneqd 4579 | . . 3 ⊢ (𝑛 = 𝑗 → {(𝑊 cyclShift 𝑛)} = {(𝑊 cyclShift 𝑗)}) |
| 21 | 20 | disjor 5067 | . 2 ⊢ (Disj 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)} ↔ ∀𝑛 ∈ (0..^(♯‘𝑊))∀𝑗 ∈ (0..^(♯‘𝑊))(𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
| 22 | 18, 21 | sylibr 234 | 1 ⊢ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → Disj 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∀wral 3051 ∃wrex 3061 ∩ cin 3888 ∅c0 4273 {csn 4567 Disj wdisj 5052 ‘cfv 6498 (class class class)co 7367 0cc0 11038 ..^cfzo 13608 ♯chash 14292 Word cword 14475 cyclShift ccsh 14750 ℙcprime 16640 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-disj 5053 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-oadd 8409 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-inf 9356 df-dju 9825 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-xnn0 12511 df-z 12525 df-uz 12789 df-rp 12943 df-fz 13462 df-fzo 13609 df-fl 13751 df-mod 13829 df-seq 13964 df-exp 14024 df-hash 14293 df-word 14476 df-concat 14533 df-substr 14604 df-pfx 14634 df-reps 14731 df-csh 14751 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-dvds 16222 df-gcd 16464 df-prm 16641 df-phi 16736 |
| This theorem is referenced by: cshwshashnsame 17074 |
| Copyright terms: Public domain | W3C validator |