![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wrdl1exs1 | Structured version Visualization version GIF version |
Description: A word of length 1 is a singleton word. (Contributed by AV, 24-Jan-2021.) |
Ref | Expression |
---|---|
wrdl1exs1 | ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 1) → ∃𝑠 ∈ 𝑆 𝑊 = 〈“𝑠”〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1le1 11257 | . . . 4 ⊢ 1 ≤ 1 | |
2 | breq2 5034 | . . . 4 ⊢ ((♯‘𝑊) = 1 → (1 ≤ (♯‘𝑊) ↔ 1 ≤ 1)) | |
3 | 1, 2 | mpbiri 261 | . . 3 ⊢ ((♯‘𝑊) = 1 → 1 ≤ (♯‘𝑊)) |
4 | wrdsymb1 13896 | . . 3 ⊢ ((𝑊 ∈ Word 𝑆 ∧ 1 ≤ (♯‘𝑊)) → (𝑊‘0) ∈ 𝑆) | |
5 | 3, 4 | sylan2 595 | . 2 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 1) → (𝑊‘0) ∈ 𝑆) |
6 | s1eq 13945 | . . . 4 ⊢ (𝑠 = (𝑊‘0) → 〈“𝑠”〉 = 〈“(𝑊‘0)”〉) | |
7 | 6 | adantl 485 | . . 3 ⊢ (((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 1) ∧ 𝑠 = (𝑊‘0)) → 〈“𝑠”〉 = 〈“(𝑊‘0)”〉) |
8 | 7 | eqeq2d 2809 | . 2 ⊢ (((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 1) ∧ 𝑠 = (𝑊‘0)) → (𝑊 = 〈“𝑠”〉 ↔ 𝑊 = 〈“(𝑊‘0)”〉)) |
9 | eqs1 13957 | . 2 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 1) → 𝑊 = 〈“(𝑊‘0)”〉) | |
10 | 5, 8, 9 | rspcedvd 3574 | 1 ⊢ ((𝑊 ∈ Word 𝑆 ∧ (♯‘𝑊) = 1) → ∃𝑠 ∈ 𝑆 𝑊 = 〈“𝑠”〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∃wrex 3107 class class class wbr 5030 ‘cfv 6324 0cc0 10526 1c1 10527 ≤ cle 10665 ♯chash 13686 Word cword 13857 〈“cs1 13940 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-fzo 13029 df-hash 13687 df-word 13858 df-s1 13941 |
This theorem is referenced by: ccats1alpha 13964 uhgrwkspthlem1 27542 wwlksn0 27649 clwwlkn1loopb 27828 |
Copyright terms: Public domain | W3C validator |