| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > wrdeqs1cat | GIF version | ||
| Description: Decompose a nonempty word by separating off the first symbol. (Contributed by Stefan O'Rear, 25-Aug-2015.) (Revised by Mario Carneiro, 1-Oct-2015.) (Proof shortened by AV, 12-Oct-2022.) |
| Ref | Expression |
|---|---|
| wrdeqs1cat | ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 𝑊 = (〈“(𝑊‘0)”〉 ++ (𝑊 substr 〈1, (♯‘𝑊)〉))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 𝑊 ∈ Word 𝐴) | |
| 2 | wrdfin 11136 | . . . 4 ⊢ (𝑊 ∈ Word 𝐴 → 𝑊 ∈ Fin) | |
| 3 | 1elfz0hash 11071 | . . . 4 ⊢ ((𝑊 ∈ Fin ∧ 𝑊 ≠ ∅) → 1 ∈ (0...(♯‘𝑊))) | |
| 4 | 2, 3 | sylan 283 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 1 ∈ (0...(♯‘𝑊))) |
| 5 | lennncl 11137 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ) | |
| 6 | 5 | nnnn0d 9455 | . . . 4 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ ℕ0) |
| 7 | eluzfz2 10267 | . . . . 5 ⊢ ((♯‘𝑊) ∈ (ℤ≥‘0) → (♯‘𝑊) ∈ (0...(♯‘𝑊))) | |
| 8 | nn0uz 9791 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 9 | 7, 8 | eleq2s 2326 | . . . 4 ⊢ ((♯‘𝑊) ∈ ℕ0 → (♯‘𝑊) ∈ (0...(♯‘𝑊))) |
| 10 | 6, 9 | syl 14 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (♯‘𝑊) ∈ (0...(♯‘𝑊))) |
| 11 | ccatpfx 11286 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 1 ∈ (0...(♯‘𝑊)) ∧ (♯‘𝑊) ∈ (0...(♯‘𝑊))) → ((𝑊 prefix 1) ++ (𝑊 substr 〈1, (♯‘𝑊)〉)) = (𝑊 prefix (♯‘𝑊))) | |
| 12 | 1, 4, 10, 11 | syl3anc 1273 | . 2 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → ((𝑊 prefix 1) ++ (𝑊 substr 〈1, (♯‘𝑊)〉)) = (𝑊 prefix (♯‘𝑊))) |
| 13 | pfx1 11288 | . . 3 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (𝑊 prefix 1) = 〈“(𝑊‘0)”〉) | |
| 14 | 13 | oveq1d 6033 | . 2 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → ((𝑊 prefix 1) ++ (𝑊 substr 〈1, (♯‘𝑊)〉)) = (〈“(𝑊‘0)”〉 ++ (𝑊 substr 〈1, (♯‘𝑊)〉))) |
| 15 | pfxid 11271 | . . 3 ⊢ (𝑊 ∈ Word 𝐴 → (𝑊 prefix (♯‘𝑊)) = 𝑊) | |
| 16 | 15 | adantr 276 | . 2 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → (𝑊 prefix (♯‘𝑊)) = 𝑊) |
| 17 | 12, 14, 16 | 3eqtr3rd 2273 | 1 ⊢ ((𝑊 ∈ Word 𝐴 ∧ 𝑊 ≠ ∅) → 𝑊 = (〈“(𝑊‘0)”〉 ++ (𝑊 substr 〈1, (♯‘𝑊)〉))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ≠ wne 2402 ∅c0 3494 〈cop 3672 ‘cfv 5326 (class class class)co 6018 Fincfn 6909 0cc0 8032 1c1 8033 ℕ0cn0 9402 ℤ≥cuz 9755 ...cfz 10243 ♯chash 11038 Word cword 11117 ++ cconcat 11171 〈“cs1 11196 substr csubstr 11230 prefix cpfx 11257 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-1o 6582 df-er 6702 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-n0 9403 df-z 9480 df-uz 9756 df-fz 10244 df-fzo 10378 df-ihash 11039 df-word 11118 df-concat 11172 df-s1 11197 df-substr 11231 df-pfx 11258 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |