| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wrdl2exs2 | Structured version Visualization version GIF version | ||
| Description: A word of length two is a doubleton word. (Contributed by AV, 25-Jan-2021.) |
| Ref | Expression |
|---|---|
| wrdl2exs2 | ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2) → ∃𝑠 ∈ 𝑆 ∃𝑡 ∈ 𝑆 𝑊 = 〈“𝑠𝑡”〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1le2 12535 | . . . 4 ⊢ 1 ≤ 2 | |
| 2 | breq2 5107 | . . . 4 ⊢ ((♯‘𝑊) = 2 → (1 ≤ (♯‘𝑊) ↔ 1 ≤ 2)) | |
| 3 | 1, 2 | mpbiri 261 | . . 3 ⊢ ((♯‘𝑊) = 2 → 1 ≤ (♯‘𝑊)) |
| 4 | wrdsymb1 14678 | . . 3 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 1 ≤ (♯‘𝑊)) → (𝑊‘0) ∈ 𝑆) | |
| 5 | 3, 4 | sylan2 605 | . 2 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2) → (𝑊‘0) ∈ 𝑆) |
| 6 | lsw 14689 | . . . 4 ⊢ (𝑊 ∈ Word 𝑆 → (lastS‘𝑊) = (𝑊‘((♯‘𝑊) − 1))) | |
| 7 | oveq1 7419 | . . . . . 6 ⊢ ((♯‘𝑊) = 2 → ((♯‘𝑊) − 1) = (2 − 1)) | |
| 8 | 2m1e1 12448 | . . . . . 6 ⊢ (2 − 1) = 1 | |
| 9 | 7, 8 | eqtrdi 2812 | . . . . 5 ⊢ ((♯‘𝑊) = 2 → ((♯‘𝑊) − 1) = 1) |
| 10 | 9 | fveq2d 6881 | . . . 4 ⊢ ((♯‘𝑊) = 2 → (𝑊‘((♯‘𝑊) − 1)) = (𝑊‘1)) |
| 11 | 6, 10 | sylan9eq 2816 | . . 3 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2) → (lastS‘𝑊) = (𝑊‘1)) |
| 12 | 2nn 12397 | . . . 4 ⊢ 2 ∈ ℕ | |
| 13 | lswlgt0cl 14694 | . . . 4 ⊢ ((2 ∈ ℕ ∧ (𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2)) → (lastS‘𝑊) ∈ 𝑆) | |
| 14 | 12, 13 | mpan 703 | . . 3 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2) → (lastS‘𝑊) ∈ 𝑆) |
| 15 | 11, 14 | eqeltrrd 2862 | . 2 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2) → (𝑊‘1) ∈ 𝑆) |
| 16 | wrdlen2s2 15076 | . 2 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2) → 𝑊 = 〈“(𝑊‘0)(𝑊‘1)”〉) | |
| 17 | id 23 | . . . . 5 ⊢ (𝑠 = (𝑊‘0) → 𝑠 = (𝑊‘0)) | |
| 18 | eqidd 2762 | . . . . 5 ⊢ (𝑠 = (𝑊‘0) → 𝑡 = 𝑡) | |
| 19 | 17, 18 | s2eqd 14994 | . . . 4 ⊢ (𝑠 = (𝑊‘0) → 〈“𝑠𝑡”〉 = 〈“(𝑊‘0)𝑡”〉) |
| 20 | 19 | eqeq2d 2772 | . . 3 ⊢ (𝑠 = (𝑊‘0) → (𝑊 = 〈“𝑠𝑡”〉 ↔ 𝑊 = 〈“(𝑊‘0)𝑡”〉)) |
| 21 | eqidd 2762 | . . . . 5 ⊢ (𝑡 = (𝑊‘1) → (𝑊‘0) = (𝑊‘0)) | |
| 22 | id 23 | . . . . 5 ⊢ (𝑡 = (𝑊‘1) → 𝑡 = (𝑊‘1)) | |
| 23 | 21, 22 | s2eqd 14994 | . . . 4 ⊢ (𝑡 = (𝑊‘1) → 〈“(𝑊‘0)𝑡”〉 = 〈“(𝑊‘0)(𝑊‘1)”〉) |
| 24 | 23 | eqeq2d 2772 | . . 3 ⊢ (𝑡 = (𝑊‘1) → (𝑊 = 〈“(𝑊‘0)𝑡”〉 ↔ 𝑊 = 〈“(𝑊‘0)(𝑊‘1)”〉)) |
| 25 | 20, 24 | rspc2ev 3589 | . 2 ⊢ (((𝑊‘0) ∈ 𝑆 ∧ (𝑊‘1) ∈ 𝑆 ∧ 𝑊 = 〈“(𝑊‘0)(𝑊‘1)”〉) → ∃𝑠 ∈ 𝑆 ∃𝑡 ∈ 𝑆 𝑊 = 〈“𝑠𝑡”〉) |
| 26 | 5, 15, 16, 25 | syl3anc 1398 | 1 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 2) → ∃𝑠 ∈ 𝑆 ∃𝑡 ∈ 𝑆 𝑊 = 〈“𝑠𝑡”〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 class class class wbr 5103 ‘cfv 6531 (class class class)co 7412 0cc0 11181 1c1 11182 ≤ cle 11325 − cmin 11522 ℕcn 12316 2c2 12378 ♯chash 14454 Word cword 14638 lastSclsw 14687 〈“cs2 14972 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 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 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-n0 12588 df-z 12675 df-uz 12947 df-fz 13621 df-fzo 13769 df-hash 14455 df-word 14639 df-lsw 14688 df-concat 14696 df-s1 14723 df-s2 14979 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |