![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > swrdrndisj | Structured version Visualization version GIF version |
Description: Condition for the range of two subwords of an injective word to be disjoint. (Contributed by Thierry Arnoux, 13-Dec-2023.) |
Ref | Expression |
---|---|
swrdf1.w | ⊢ (𝜑 → 𝑊 ∈ Word 𝐷) |
swrdf1.m | ⊢ (𝜑 → 𝑀 ∈ (0...𝑁)) |
swrdf1.n | ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝑊))) |
swrdf1.1 | ⊢ (𝜑 → 𝑊:dom 𝑊–1-1→𝐷) |
swrdrndisj.1 | ⊢ (𝜑 → 𝑂 ∈ (𝑁...𝑃)) |
swrdrndisj.2 | ⊢ (𝜑 → 𝑃 ∈ (𝑁...(♯‘𝑊))) |
Ref | Expression |
---|---|
swrdrndisj | ⊢ (𝜑 → (ran (𝑊 substr ⟨𝑀, 𝑁⟩) ∩ ran (𝑊 substr ⟨𝑂, 𝑃⟩)) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | swrdf1.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ Word 𝐷) | |
2 | swrdf1.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ (0...𝑁)) | |
3 | swrdf1.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (0...(♯‘𝑊))) | |
4 | swrdrn3 32621 | . . . 4 ⊢ ((𝑊 ∈ Word 𝐷 ∧ 𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...(♯‘𝑊))) → ran (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑊 “ (𝑀..^𝑁))) | |
5 | 1, 2, 3, 4 | syl3anc 1368 | . . 3 ⊢ (𝜑 → ran (𝑊 substr ⟨𝑀, 𝑁⟩) = (𝑊 “ (𝑀..^𝑁))) |
6 | elfzuz 13500 | . . . . . 6 ⊢ (𝑁 ∈ (0...(♯‘𝑊)) → 𝑁 ∈ (ℤ≥‘0)) | |
7 | fzss1 13543 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘0) → (𝑁...𝑃) ⊆ (0...𝑃)) | |
8 | 3, 6, 7 | 3syl 18 | . . . . 5 ⊢ (𝜑 → (𝑁...𝑃) ⊆ (0...𝑃)) |
9 | swrdrndisj.1 | . . . . 5 ⊢ (𝜑 → 𝑂 ∈ (𝑁...𝑃)) | |
10 | 8, 9 | sseldd 3978 | . . . 4 ⊢ (𝜑 → 𝑂 ∈ (0...𝑃)) |
11 | fzss1 13543 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘0) → (𝑁...(♯‘𝑊)) ⊆ (0...(♯‘𝑊))) | |
12 | 3, 6, 11 | 3syl 18 | . . . . 5 ⊢ (𝜑 → (𝑁...(♯‘𝑊)) ⊆ (0...(♯‘𝑊))) |
13 | swrdrndisj.2 | . . . . 5 ⊢ (𝜑 → 𝑃 ∈ (𝑁...(♯‘𝑊))) | |
14 | 12, 13 | sseldd 3978 | . . . 4 ⊢ (𝜑 → 𝑃 ∈ (0...(♯‘𝑊))) |
15 | swrdrn3 32621 | . . . 4 ⊢ ((𝑊 ∈ Word 𝐷 ∧ 𝑂 ∈ (0...𝑃) ∧ 𝑃 ∈ (0...(♯‘𝑊))) → ran (𝑊 substr ⟨𝑂, 𝑃⟩) = (𝑊 “ (𝑂..^𝑃))) | |
16 | 1, 10, 14, 15 | syl3anc 1368 | . . 3 ⊢ (𝜑 → ran (𝑊 substr ⟨𝑂, 𝑃⟩) = (𝑊 “ (𝑂..^𝑃))) |
17 | 5, 16 | ineq12d 4208 | . 2 ⊢ (𝜑 → (ran (𝑊 substr ⟨𝑀, 𝑁⟩) ∩ ran (𝑊 substr ⟨𝑂, 𝑃⟩)) = ((𝑊 “ (𝑀..^𝑁)) ∩ (𝑊 “ (𝑂..^𝑃)))) |
18 | swrdf1.1 | . . 3 ⊢ (𝜑 → 𝑊:dom 𝑊–1-1→𝐷) | |
19 | df-f1 6541 | . . . 4 ⊢ (𝑊:dom 𝑊–1-1→𝐷 ↔ (𝑊:dom 𝑊⟶𝐷 ∧ Fun ◡𝑊)) | |
20 | 19 | simprbi 496 | . . 3 ⊢ (𝑊:dom 𝑊–1-1→𝐷 → Fun ◡𝑊) |
21 | imain 6626 | . . 3 ⊢ (Fun ◡𝑊 → (𝑊 “ ((𝑀..^𝑁) ∩ (𝑂..^𝑃))) = ((𝑊 “ (𝑀..^𝑁)) ∩ (𝑊 “ (𝑂..^𝑃)))) | |
22 | 18, 20, 21 | 3syl 18 | . 2 ⊢ (𝜑 → (𝑊 “ ((𝑀..^𝑁) ∩ (𝑂..^𝑃))) = ((𝑊 “ (𝑀..^𝑁)) ∩ (𝑊 “ (𝑂..^𝑃)))) |
23 | elfzuz 13500 | . . . . . . . . 9 ⊢ (𝑂 ∈ (𝑁...𝑃) → 𝑂 ∈ (ℤ≥‘𝑁)) | |
24 | fzoss1 13662 | . . . . . . . . 9 ⊢ (𝑂 ∈ (ℤ≥‘𝑁) → (𝑂..^𝑃) ⊆ (𝑁..^𝑃)) | |
25 | 9, 23, 24 | 3syl 18 | . . . . . . . 8 ⊢ (𝜑 → (𝑂..^𝑃) ⊆ (𝑁..^𝑃)) |
26 | elfzuz3 13501 | . . . . . . . . 9 ⊢ (𝑃 ∈ (𝑁...(♯‘𝑊)) → (♯‘𝑊) ∈ (ℤ≥‘𝑃)) | |
27 | fzoss2 13663 | . . . . . . . . 9 ⊢ ((♯‘𝑊) ∈ (ℤ≥‘𝑃) → (𝑁..^𝑃) ⊆ (𝑁..^(♯‘𝑊))) | |
28 | 13, 26, 27 | 3syl 18 | . . . . . . . 8 ⊢ (𝜑 → (𝑁..^𝑃) ⊆ (𝑁..^(♯‘𝑊))) |
29 | 25, 28 | sstrd 3987 | . . . . . . 7 ⊢ (𝜑 → (𝑂..^𝑃) ⊆ (𝑁..^(♯‘𝑊))) |
30 | sslin 4229 | . . . . . . 7 ⊢ ((𝑂..^𝑃) ⊆ (𝑁..^(♯‘𝑊)) → ((𝑀..^𝑁) ∩ (𝑂..^𝑃)) ⊆ ((𝑀..^𝑁) ∩ (𝑁..^(♯‘𝑊)))) | |
31 | 29, 30 | syl 17 | . . . . . 6 ⊢ (𝜑 → ((𝑀..^𝑁) ∩ (𝑂..^𝑃)) ⊆ ((𝑀..^𝑁) ∩ (𝑁..^(♯‘𝑊)))) |
32 | fzodisj 13669 | . . . . . 6 ⊢ ((𝑀..^𝑁) ∩ (𝑁..^(♯‘𝑊))) = ∅ | |
33 | 31, 32 | sseqtrdi 4027 | . . . . 5 ⊢ (𝜑 → ((𝑀..^𝑁) ∩ (𝑂..^𝑃)) ⊆ ∅) |
34 | ss0 4393 | . . . . 5 ⊢ (((𝑀..^𝑁) ∩ (𝑂..^𝑃)) ⊆ ∅ → ((𝑀..^𝑁) ∩ (𝑂..^𝑃)) = ∅) | |
35 | 33, 34 | syl 17 | . . . 4 ⊢ (𝜑 → ((𝑀..^𝑁) ∩ (𝑂..^𝑃)) = ∅) |
36 | 35 | imaeq2d 6052 | . . 3 ⊢ (𝜑 → (𝑊 “ ((𝑀..^𝑁) ∩ (𝑂..^𝑃))) = (𝑊 “ ∅)) |
37 | ima0 6069 | . . 3 ⊢ (𝑊 “ ∅) = ∅ | |
38 | 36, 37 | eqtrdi 2782 | . 2 ⊢ (𝜑 → (𝑊 “ ((𝑀..^𝑁) ∩ (𝑂..^𝑃))) = ∅) |
39 | 17, 22, 38 | 3eqtr2d 2772 | 1 ⊢ (𝜑 → (ran (𝑊 substr ⟨𝑀, 𝑁⟩) ∩ ran (𝑊 substr ⟨𝑂, 𝑃⟩)) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2098 ∩ cin 3942 ⊆ wss 3943 ∅c0 4317 ⟨cop 4629 ◡ccnv 5668 dom cdm 5669 ran crn 5670 “ cima 5672 Fun wfun 6530 ⟶wf 6532 –1-1→wf1 6533 ‘cfv 6536 (class class class)co 7404 0cc0 11109 ℤ≥cuz 12823 ...cfz 13487 ..^cfzo 13630 ♯chash 14292 Word cword 14467 substr csubstr 14593 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6293 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8264 df-wrecs 8295 df-recs 8369 df-rdg 8408 df-1o 8464 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-card 9933 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11447 df-neg 11448 df-nn 12214 df-n0 12474 df-z 12560 df-uz 12824 df-fz 13488 df-fzo 13631 df-hash 14293 df-word 14468 df-substr 14594 |
This theorem is referenced by: cycpmco2f1 32786 |
Copyright terms: Public domain | W3C validator |