| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > swrdlen2 | Structured version Visualization version GIF version | ||
| Description: Length of an extracted subword. (Contributed by AV, 5-May-2020.) |
| Ref | Expression |
|---|---|
| swrdlen2 | ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → (♯‘(𝑆 substr 〈𝐹, 𝐿〉)) = (𝐿 − 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1142 | . 2 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → 𝑆 ∈ Word 𝑉) | |
| 2 | simpl 483 | . . . . 5 ⊢ ((𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) → 𝐹 ∈ ℕ0) | |
| 3 | eluznn0 12858 | . . . . 5 ⊢ ((𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) → 𝐿 ∈ ℕ0) | |
| 4 | eluzle 12792 | . . . . . 6 ⊢ (𝐿 ∈ (ℤ≥‘𝐹) → 𝐹 ≤ 𝐿) | |
| 5 | 4 | adantl 482 | . . . . 5 ⊢ ((𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) → 𝐹 ≤ 𝐿) |
| 6 | 2, 3, 5 | 3jca 1134 | . . . 4 ⊢ ((𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) → (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ ℕ0 ∧ 𝐹 ≤ 𝐿)) |
| 7 | 6 | 3ad2ant2 1140 | . . 3 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ ℕ0 ∧ 𝐹 ≤ 𝐿)) |
| 8 | elfz2nn0 13563 | . . 3 ⊢ (𝐹 ∈ (0...𝐿) ↔ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ ℕ0 ∧ 𝐹 ≤ 𝐿)) | |
| 9 | 7, 8 | sylibr 235 | . 2 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → 𝐹 ∈ (0...𝐿)) |
| 10 | 3 | 3ad2ant2 1140 | . . . 4 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → 𝐿 ∈ ℕ0) |
| 11 | lencl 14486 | . . . . 5 ⊢ (𝑆 ∈ Word 𝑉 → (♯‘𝑆) ∈ ℕ0) | |
| 12 | 11 | 3ad2ant1 1139 | . . . 4 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → (♯‘𝑆) ∈ ℕ0) |
| 13 | simp3 1144 | . . . 4 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → 𝐿 ≤ (♯‘𝑆)) | |
| 14 | 10, 12, 13 | 3jca 1134 | . . 3 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → (𝐿 ∈ ℕ0 ∧ (♯‘𝑆) ∈ ℕ0 ∧ 𝐿 ≤ (♯‘𝑆))) |
| 15 | elfz2nn0 13563 | . . 3 ⊢ (𝐿 ∈ (0...(♯‘𝑆)) ↔ (𝐿 ∈ ℕ0 ∧ (♯‘𝑆) ∈ ℕ0 ∧ 𝐿 ≤ (♯‘𝑆))) | |
| 16 | 14, 15 | sylibr 235 | . 2 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → 𝐿 ∈ (0...(♯‘𝑆))) |
| 17 | swrdlen 14601 | . 2 ⊢ ((𝑆 ∈ Word 𝑉 ∧ 𝐹 ∈ (0...𝐿) ∧ 𝐿 ∈ (0...(♯‘𝑆))) → (♯‘(𝑆 substr 〈𝐹, 𝐿〉)) = (𝐿 − 𝐹)) | |
| 18 | 1, 9, 16, 17 | syl3anc 1379 | 1 ⊢ ((𝑆 ∈ Word 𝑉 ∧ (𝐹 ∈ ℕ0 ∧ 𝐿 ∈ (ℤ≥‘𝐹)) ∧ 𝐿 ≤ (♯‘𝑆)) → (♯‘(𝑆 substr 〈𝐹, 𝐿〉)) = (𝐿 − 𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 〈cop 4561 class class class wbr 5072 ‘cfv 6485 (class class class)co 7356 0cc0 11029 ≤ cle 11171 − cmin 11368 ℕ0cn0 12428 ℤ≥cuz 12779 ...cfz 13452 ♯chash 14283 Word cword 14466 substr csubstr 14594 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-hash 14284 df-word 14467 df-substr 14595 |
| This theorem is referenced by: swrdsbslen 14618 swrdspsleq 14619 |
| Copyright terms: Public domain | W3C validator |