| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ccats1pfxeqbi | Structured version Visualization version GIF version | ||
| Description: A word is a prefix of a word with length greater by 1 than the first word iff the second word is the first word concatenated with the last symbol of the second word. (Contributed by AV, 24-Oct-2018.) (Revised by AV, 10-May-2020.) |
| Ref | Expression |
|---|---|
| ccats1pfxeqbi | ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → (𝑊 = (𝑈 prefix (♯‘𝑊)) ↔ 𝑈 = (𝑊 ++ 〈“(lastS‘𝑈)”〉))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ccats1pfxeq 14904 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → (𝑊 = (𝑈 prefix (♯‘𝑊)) → 𝑈 = (𝑊 ++ 〈“(lastS‘𝑈)”〉))) | |
| 2 | simp1 1155 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → 𝑊 ∈ Word 𝑉) | |
| 3 | lencl 14718 | . . . . . . . . 9 ⊢ (𝑊 ∈ Word 𝑉 → (♯‘𝑊) ∈ ℕ0) | |
| 4 | nn0p1nn 12684 | . . . . . . . . 9 ⊢ ((♯‘𝑊) ∈ ℕ0 → ((♯‘𝑊) + 1) ∈ ℕ) | |
| 5 | 3, 4 | syl 18 | . . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑉 → ((♯‘𝑊) + 1) ∈ ℕ) |
| 6 | 5 | 3ad2ant1 1152 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → ((♯‘𝑊) + 1) ∈ ℕ) |
| 7 | 3simpc 1169 | . . . . . . 7 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → (𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1))) | |
| 8 | lswlgt0cl 14754 | . . . . . . 7 ⊢ ((((♯‘𝑊) + 1) ∈ ℕ ∧ (𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1))) → (lastS‘𝑈) ∈ 𝑉) | |
| 9 | 6, 7, 8 | syl2anc 596 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → (lastS‘𝑈) ∈ 𝑉) |
| 10 | 9 | s1cld 14790 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → 〈“(lastS‘𝑈)”〉 ∈ Word 𝑉) |
| 11 | eqidd 2767 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → (♯‘𝑊) = (♯‘𝑊)) | |
| 12 | pfxccatid 14931 | . . . . . 6 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 〈“(lastS‘𝑈)”〉 ∈ Word 𝑉 ∧ (♯‘𝑊) = (♯‘𝑊)) → ((𝑊 ++ 〈“(lastS‘𝑈)”〉) prefix (♯‘𝑊)) = 𝑊) | |
| 13 | 12 | eqcomd 2772 | . . . . 5 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 〈“(lastS‘𝑈)”〉 ∈ Word 𝑉 ∧ (♯‘𝑊) = (♯‘𝑊)) → 𝑊 = ((𝑊 ++ 〈“(lastS‘𝑈)”〉) prefix (♯‘𝑊))) |
| 14 | 2, 10, 11, 13 | syl3anc 1401 | . . . 4 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → 𝑊 = ((𝑊 ++ 〈“(lastS‘𝑈)”〉) prefix (♯‘𝑊))) |
| 15 | oveq1 7457 | . . . . 5 ⊢ (𝑈 = (𝑊 ++ 〈“(lastS‘𝑈)”〉) → (𝑈 prefix (♯‘𝑊)) = ((𝑊 ++ 〈“(lastS‘𝑈)”〉) prefix (♯‘𝑊))) | |
| 16 | 15 | eqcomd 2772 | . . . 4 ⊢ (𝑈 = (𝑊 ++ 〈“(lastS‘𝑈)”〉) → ((𝑊 ++ 〈“(lastS‘𝑈)”〉) prefix (♯‘𝑊)) = (𝑈 prefix (♯‘𝑊))) |
| 17 | 14, 16 | sylan9eq 2821 | . . 3 ⊢ (((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) ∧ 𝑈 = (𝑊 ++ 〈“(lastS‘𝑈)”〉)) → 𝑊 = (𝑈 prefix (♯‘𝑊))) |
| 18 | 17 | ex 418 | . 2 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → (𝑈 = (𝑊 ++ 〈“(lastS‘𝑈)”〉) → 𝑊 = (𝑈 prefix (♯‘𝑊)))) |
| 19 | 1, 18 | impbid 215 | 1 ⊢ ((𝑊 ∈ Word 𝑉 ∧ 𝑈 ∈ Word 𝑉 ∧ (♯‘𝑈) = ((♯‘𝑊) + 1)) → (𝑊 = (𝑈 prefix (♯‘𝑊)) ↔ 𝑈 = (𝑊 ++ 〈“(lastS‘𝑈)”〉))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ‘cfv 6565 (class class class)co 7450 1c1 11239 + caddc 11241 ℕcn 12374 ℕ0cn0 12645 ♯chash 14514 Word cword 14698 lastSclsw 14747 ++ cconcat 14755 〈“cs1 14782 prefix cpfx 14861 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-lsw 14748 df-concat 14756 df-s1 14783 df-substr 14830 df-pfx 14862 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |