| 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 13716 | . . . 4 ⊢ (0 ∈ (0..^𝐿) ↔ 𝐿 ∈ ℕ) | |
| 2 | ne0i 4296 | . . . 4 ⊢ (0 ∈ (0..^𝐿) → (0..^𝐿) ≠ ∅) | |
| 3 | 1, 2 | sylbir 238 | . . 3 ⊢ (𝐿 ∈ ℕ → (0..^𝐿) ≠ ∅) |
| 4 | 3 | 3ad2ant2 1150 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (0..^𝐿) ≠ ∅) |
| 5 | simp1 1152 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝑊 ∈ Word 𝑉) | |
| 6 | nnnn0 12499 | . . . . . . 7 ⊢ (𝐿 ∈ ℕ → 𝐿 ∈ ℕ0) | |
| 7 | 6 | 3ad2ant2 1150 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝐿 ∈ ℕ0) |
| 8 | lencl 14558 | . . . . . . 7 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 9 | 8 | 3ad2ant1 1149 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (♯‘𝑊) ∈ ℕ0) |
| 10 | simp3 1154 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝐿 ≤ (♯‘𝑊)) | |
| 11 | elfz2nn0 13634 | . . . . . 6 ⊢ (𝐿 ∈ (0...(♯‘𝑊)) ↔ (𝐿 ∈ ℕ0 ∧ (♯‘𝑊) ∈ ℕ0 ∧ 𝐿 ≤ (♯‘𝑊))) | |
| 12 | 7, 9, 10, 11 | syl3anbrc 1360 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → 𝐿 ∈ (0...(♯‘𝑊))) |
| 13 | pfxf 14706 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ (0...(♯‘𝑊))) → (𝑊 prefix 𝐿):(0..^𝐿)⟶𝑉) | |
| 14 | 5, 12, 13 | syl2anc 595 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (𝑊 prefix 𝐿):(0..^𝐿)⟶𝑉) |
| 15 | f0dom0 6752 | . . . . 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 3004 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → ((𝑊 prefix 𝐿) ≠ ∅ ↔ (0..^𝐿) ≠ ∅)) |
| 19 | 4, 18 | mpbird 260 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝐿 ∈ ℕ ∧ 𝐿 ≤ (♯‘𝑊)) → (𝑊 prefix 𝐿) ≠ ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∅c0 4288 class class class wbr 5104 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 0cc0 11088 ≤ cle 11232 ℕcn 12221 ℕ0cn0 12492 ...cfz 13523 ..^cfzo 13670 ♯chash 14354 Word cword 14538 prefix cpfx 14696 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12222 df-n0 12493 df-z 12580 df-uz 12851 df-fz 13524 df-fzo 13671 df-hash 14355 df-word 14539 df-substr 14667 df-pfx 14697 |
| This theorem is referenced by: wwlksnred 30146 clwlkclwwlk 30258 clwwlkinwwlk 30296 pfxlsw2ccat 33178 |
| Copyright terms: Public domain | W3C validator |