![]() |
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 865 | . . . . 5 ⊢ (𝑛 = 𝑗 → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) | |
2 | 1 | a1d 25 | . . . 4 ⊢ (𝑛 = 𝑗 → (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅))) |
3 | simprl 769 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → (𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0))) | |
4 | simprrl 779 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → 𝑛 ∈ (0..^(♯‘𝑊))) | |
5 | simprrr 780 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → 𝑗 ∈ (0..^(♯‘𝑊))) | |
6 | necom 2997 | . . . . . . . . . 10 ⊢ (𝑛 ≠ 𝑗 ↔ 𝑗 ≠ 𝑛) | |
7 | 6 | biimpi 215 | . . . . . . . . 9 ⊢ (𝑛 ≠ 𝑗 → 𝑗 ≠ 𝑛) |
8 | 7 | adantr 481 | . . . . . . . 8 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → 𝑗 ≠ 𝑛) |
9 | cshwshash.0 | . . . . . . . . . 10 ⊢ (𝜑 → (𝑊 ∈ Word 𝑉 ∧ (♯‘𝑊) ∈ ℙ)) | |
10 | 9 | cshwshashlem3 16969 | . . . . . . . . 9 ⊢ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → ((𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ≠ 𝑛) → (𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗))) |
11 | 10 | imp 407 | . . . . . . . 8 ⊢ (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ≠ 𝑛)) → (𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗)) |
12 | 3, 4, 5, 8, 11 | syl13anc 1372 | . . . . . . 7 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → (𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗)) |
13 | disjsn2 4673 | . . . . . . 7 ⊢ ((𝑊 cyclShift 𝑛) ≠ (𝑊 cyclShift 𝑗) → ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅) | |
14 | 12, 13 | syl 17 | . . . . . 6 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅) |
15 | 14 | olcd 872 | . . . . 5 ⊢ ((𝑛 ≠ 𝑗 ∧ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊))))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
16 | 15 | ex 413 | . . . 4 ⊢ (𝑛 ≠ 𝑗 → (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅))) |
17 | 2, 16 | pm2.61ine 3028 | . . 3 ⊢ (((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) ∧ (𝑛 ∈ (0..^(♯‘𝑊)) ∧ 𝑗 ∈ (0..^(♯‘𝑊)))) → (𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
18 | 17 | ralrimivva 3197 | . 2 ⊢ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → ∀𝑛 ∈ (0..^(♯‘𝑊))∀𝑗 ∈ (0..^(♯‘𝑊))(𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
19 | oveq2 7364 | . . . 4 ⊢ (𝑛 = 𝑗 → (𝑊 cyclShift 𝑛) = (𝑊 cyclShift 𝑗)) | |
20 | 19 | sneqd 4598 | . . 3 ⊢ (𝑛 = 𝑗 → {(𝑊 cyclShift 𝑛)} = {(𝑊 cyclShift 𝑗)}) |
21 | 20 | disjor 5085 | . 2 ⊢ (Disj 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)} ↔ ∀𝑛 ∈ (0..^(♯‘𝑊))∀𝑗 ∈ (0..^(♯‘𝑊))(𝑛 = 𝑗 ∨ ({(𝑊 cyclShift 𝑛)} ∩ {(𝑊 cyclShift 𝑗)}) = ∅)) |
22 | 18, 21 | sylibr 233 | 1 ⊢ ((𝜑 ∧ ∃𝑖 ∈ (0..^(♯‘𝑊))(𝑊‘𝑖) ≠ (𝑊‘0)) → Disj 𝑛 ∈ (0..^(♯‘𝑊)){(𝑊 cyclShift 𝑛)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∨ wo 845 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3073 ∩ cin 3909 ∅c0 4282 {csn 4586 Disj wdisj 5070 ‘cfv 6496 (class class class)co 7356 0cc0 11050 ..^cfzo 13566 ♯chash 14229 Word cword 14401 cyclShift ccsh 14675 ℙcprime 16546 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 ax-cnex 11106 ax-resscn 11107 ax-1cn 11108 ax-icn 11109 ax-addcl 11110 ax-addrcl 11111 ax-mulcl 11112 ax-mulrcl 11113 ax-mulcom 11114 ax-addass 11115 ax-mulass 11116 ax-distr 11117 ax-i2m1 11118 ax-1ne0 11119 ax-1rid 11120 ax-rnegex 11121 ax-rrecex 11122 ax-cnre 11123 ax-pre-lttri 11124 ax-pre-lttrn 11125 ax-pre-ltadd 11126 ax-pre-mulgt0 11127 ax-pre-sup 11128 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-disj 5071 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7312 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7802 df-1st 7920 df-2nd 7921 df-frecs 8211 df-wrecs 8242 df-recs 8316 df-rdg 8355 df-1o 8411 df-2o 8412 df-oadd 8415 df-er 8647 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-sup 9377 df-inf 9378 df-dju 9836 df-card 9874 df-pnf 11190 df-mnf 11191 df-xr 11192 df-ltxr 11193 df-le 11194 df-sub 11386 df-neg 11387 df-div 11812 df-nn 12153 df-2 12215 df-3 12216 df-n0 12413 df-xnn0 12485 df-z 12499 df-uz 12763 df-rp 12915 df-fz 13424 df-fzo 13567 df-fl 13696 df-mod 13774 df-seq 13906 df-exp 13967 df-hash 14230 df-word 14402 df-concat 14458 df-substr 14528 df-pfx 14558 df-reps 14656 df-csh 14676 df-cj 14983 df-re 14984 df-im 14985 df-sqrt 15119 df-abs 15120 df-dvds 16136 df-gcd 16374 df-prm 16547 df-phi 16637 |
This theorem is referenced by: cshwshashnsame 16975 |
Copyright terms: Public domain | W3C validator |