| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > revs1 | Structured version Visualization version GIF version | ||
| Description: Singleton words are their own reverses. (Contributed by Stefan O'Rear, 26-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) |
| Ref | Expression |
|---|---|
| revs1 | ⊢ (reverse‘〈“𝑆”〉) = 〈“𝑆”〉 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | s1cli 14639 | . . . . 5 ⊢ 〈“𝑆”〉 ∈ Word V | |
| 2 | s1len 14640 | . . . . . . 7 ⊢ (♯‘〈“𝑆”〉) = 1 | |
| 3 | 1nn 12240 | . . . . . . 7 ⊢ 1 ∈ ℕ | |
| 4 | 2, 3 | eqeltri 2865 | . . . . . 6 ⊢ (♯‘〈“𝑆”〉) ∈ ℕ |
| 5 | lbfzo0 13724 | . . . . . 6 ⊢ (0 ∈ (0..^(♯‘〈“𝑆”〉)) ↔ (♯‘〈“𝑆”〉) ∈ ℕ) | |
| 6 | 4, 5 | mpbir 234 | . . . . 5 ⊢ 0 ∈ (0..^(♯‘〈“𝑆”〉)) |
| 7 | revfv 14796 | . . . . 5 ⊢ ((〈“𝑆”〉 ∈ Word V ∧ 0 ∈ (0..^(♯‘〈“𝑆”〉))) → ((reverse‘〈“𝑆”〉)‘0) = (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0))) | |
| 8 | 1, 6, 7 | mp2an 704 | . . . 4 ⊢ ((reverse‘〈“𝑆”〉)‘0) = (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) |
| 9 | 2 | oveq1i 7418 | . . . . . . . . 9 ⊢ ((♯‘〈“𝑆”〉) − 1) = (1 − 1) |
| 10 | 1m1e0 12309 | . . . . . . . . 9 ⊢ (1 − 1) = 0 | |
| 11 | 9, 10 | eqtri 2792 | . . . . . . . 8 ⊢ ((♯‘〈“𝑆”〉) − 1) = 0 |
| 12 | 11 | oveq1i 7418 | . . . . . . 7 ⊢ (((♯‘〈“𝑆”〉) − 1) − 0) = (0 − 0) |
| 13 | 0m0e0 12355 | . . . . . . 7 ⊢ (0 − 0) = 0 | |
| 14 | 12, 13 | eqtri 2792 | . . . . . 6 ⊢ (((♯‘〈“𝑆”〉) − 1) − 0) = 0 |
| 15 | 14 | fveq2i 6882 | . . . . 5 ⊢ (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) = (〈“𝑆”〉‘0) |
| 16 | ids1 14631 | . . . . . . 7 ⊢ 〈“𝑆”〉 = 〈“( I ‘𝑆)”〉 | |
| 17 | 16 | fveq1i 6880 | . . . . . 6 ⊢ (〈“𝑆”〉‘0) = (〈“( I ‘𝑆)”〉‘0) |
| 18 | fvex 6892 | . . . . . . 7 ⊢ ( I ‘𝑆) ∈ V | |
| 19 | s1fv 14644 | . . . . . . 7 ⊢ (( I ‘𝑆) ∈ V → (〈“( I ‘𝑆)”〉‘0) = ( I ‘𝑆)) | |
| 20 | 18, 19 | ax-mp 5 | . . . . . 6 ⊢ (〈“( I ‘𝑆)”〉‘0) = ( I ‘𝑆) |
| 21 | 17, 20 | eqtri 2792 | . . . . 5 ⊢ (〈“𝑆”〉‘0) = ( I ‘𝑆) |
| 22 | 15, 21 | eqtri 2792 | . . . 4 ⊢ (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) = ( I ‘𝑆) |
| 23 | 8, 22 | eqtri 2792 | . . 3 ⊢ ((reverse‘〈“𝑆”〉)‘0) = ( I ‘𝑆) |
| 24 | s1eq 14634 | . . 3 ⊢ (((reverse‘〈“𝑆”〉)‘0) = ( I ‘𝑆) → 〈“((reverse‘〈“𝑆”〉)‘0)”〉 = 〈“( I ‘𝑆)”〉) | |
| 25 | 23, 24 | ax-mp 5 | . 2 ⊢ 〈“((reverse‘〈“𝑆”〉)‘0)”〉 = 〈“( I ‘𝑆)”〉 |
| 26 | revcl 14794 | . . . 4 ⊢ (〈“𝑆”〉 ∈ Word V → (reverse‘〈“𝑆”〉) ∈ Word V) | |
| 27 | 1, 26 | ax-mp 5 | . . 3 ⊢ (reverse‘〈“𝑆”〉) ∈ Word V |
| 28 | revlen 14795 | . . . . 5 ⊢ (〈“𝑆”〉 ∈ Word V → (♯‘(reverse‘〈“𝑆”〉)) = (♯‘〈“𝑆”〉)) | |
| 29 | 1, 28 | ax-mp 5 | . . . 4 ⊢ (♯‘(reverse‘〈“𝑆”〉)) = (♯‘〈“𝑆”〉) |
| 30 | 29, 2 | eqtri 2792 | . . 3 ⊢ (♯‘(reverse‘〈“𝑆”〉)) = 1 |
| 31 | eqs1 14646 | . . 3 ⊢ (((reverse‘〈“𝑆”〉) ∈ Word V ∧ (♯‘(reverse‘〈“𝑆”〉)) = 1) → (reverse‘〈“𝑆”〉) = 〈“((reverse‘〈“𝑆”〉)‘0)”〉) | |
| 32 | 27, 30, 31 | mp2an 704 | . 2 ⊢ (reverse‘〈“𝑆”〉) = 〈“((reverse‘〈“𝑆”〉)‘0)”〉 |
| 33 | 25, 32, 16 | 3eqtr4i 2802 | 1 ⊢ (reverse‘〈“𝑆”〉) = 〈“𝑆”〉 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1567 ∈ wcel 2149 Vcvv 3463 I cid 5553 ‘cfv 6534 (class class class)co 7408 0cc0 11096 1c1 11097 − cmin 11437 ℕcn 12229 ..^cfzo 13678 ♯chash 14362 Word cword 14546 〈“cs1 14629 reversecreverse 14791 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-nn 12230 df-n0 12501 df-z 12588 df-uz 12859 df-fz 13532 df-fzo 13679 df-hash 14363 df-word 14547 df-s1 14630 df-reverse 14792 |
| This theorem is referenced by: gsumwrev 19432 efginvrel2 19793 vrgpinv 19835 |
| Copyright terms: Public domain | W3C validator |