| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pfxn0 | Structured version Visualization version GIF version | ||
| Description: A prefix consisting of at least one symbol is not empty. (Contributed by Alexander van der Vekens, 4-Aug-2018.) (Revised by AV, 2-May-2020.) |
| Ref | Expression |
|---|---|
| pfxn0 | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (𝑊 prefix 𝐿) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lbfzo0 13838 | . . . 4 ⊢ (0 ∈ (0..^𝐿) ↔ 𝐿 ∈ ℕ) | |
| 2 | ne0i 4286 | . . . 4 ⊢ (0 ∈ (0..^𝐿) → (0..^𝐿) ≠ ∅) | |
| 3 | 1, 2 | sylbir 238 | . . 3 ⊢ (𝐿 ∈ ℕ → (0..^𝐿) ≠ ∅) |
| 4 | 3 | 3ad2ant2 1152 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (0..^𝐿) ≠ ∅) |
| 5 | simp1 1154 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝑊 ∈ Word 𝑉) | |
| 6 | nnnn0 12617 | . . . . . . 7 ⊢ (𝐿 ∈ ℕ → 𝐿 ∈ ℕ0) | |
| 7 | 6 | 3ad2ant2 1152 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝐿 ∈ ℕ0) |
| 8 | lencl 14682 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 9 | 8 | 3ad2ant1 1151 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (♯‘𝑊) ∈ ℕ0) |
| 10 | simp3 1156 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝐿 ≤ (♯‘𝑊)) | |
| 11 | elfz2nn0 13756 | . . . . . 6 ⊢ (𝐿 ∈ (0...(♯‘𝑊)) ↔ (𝐿 ∈ ℕ0 ∧ (♯‘𝑊) ∈ ℕ0 ∧ 𝐿 ≤ (♯‘𝑊))) | |
| 12 | 7, 9, 10, 11 | syl3anbrc 1362 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝐿 ∈ (0...(♯‘𝑊))) |
| 13 | pfxf 14835 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ (0...(♯‘𝑊))) → (𝑊 prefix 𝐿):(0..^𝐿)⟶𝑉) | |
| 14 | 5, 12, 13 | syl2anc 596 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (𝑊 prefix 𝐿):(0..^𝐿)⟶𝑉) |
| 15 | f0dom0 6767 | . . . . 5 ⊢ ((𝑊 prefix 𝐿):(0..^𝐿)⟶𝑉 → ((0..^𝐿) = ∅ ↔ (𝑊 prefix 𝐿) = ∅)) | |
| 16 | 15 | bicomd 226 | . . . 4 ⊢ ((𝑊 prefix 𝐿):(0..^𝐿)⟶𝑉 → ((𝑊 prefix 𝐿) = ∅ ↔ (0..^𝐿) = ∅)) |
| 17 | 14, 16 | syl 18 | . . 3 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → ((𝑊 prefix 𝐿) = ∅ ↔ (0..^𝐿) = ∅)) |
| 18 | 17 | necon3bid 2999 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → ((𝑊 prefix 𝐿) ≠ ∅ ↔ (0..^𝐿) ≠ ∅)) |
| 19 | 4, 18 | mpbird 260 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (𝑊 prefix 𝐿) ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∅c0 4278 class class class wbr 5102 ⟶wf 6535 ‘cfv 6539 (class class class)co 7421 0cc0 11204 ≤ cle 11348 ℕcn 12339 ℕ0cn0 12610 ...cfz 13643 ..^cfzo 13792 ♯chash 14478 Word cword 14662 prefix cpfx 14825 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-fin 8981 df-card 10024 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-nn 12340 df-n0 12611 df-z 12698 df-uz 12970 df-fz 13644 df-fzo 13793 df-hash 14479 df-word 14663 df-substr 14794 df-pfx 14826 |
| This theorem is used by: wwlksnred 30487 clwlkclwwlk 30599 clwwlkinwwlk 30637 pfxlsw2ccat 33560 |
| Copyright terms: Public domain | W3C validator |