| 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 14793 | . . . . 5 ⊢ 〈“𝑆”〉 ∈ Word V | |
| 2 | s1len 14794 | . . . . . . 7 ⊢ (♯‘〈“𝑆”〉) = 1 | |
| 3 | 1nn 12386 | . . . . . . 7 ⊢ 1 ∈ ℕ | |
| 4 | 2, 3 | eqeltri 2860 | . . . . . 6 ⊢ (♯‘〈“𝑆”〉) ∈ ℕ |
| 5 | lbfzo0 13874 | . . . . . 6 ⊢ (0 ∈ (0..^(♯‘〈“𝑆”〉)) ↔ (♯‘〈“𝑆”〉) ∈ ℕ) | |
| 6 | 4, 5 | mpbir 234 | . . . . 5 ⊢ 0 ∈ (0..^(♯‘〈“𝑆”〉)) |
| 7 | revfv 14954 | . . . . 5 ⊢ ((〈“𝑆”〉 ∈ Word V ∧ 0 ∈ (0..^(♯‘〈“𝑆”〉))) → ((reverse‘〈“𝑆”〉)‘0) = (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0))) | |
| 8 | 1, 6, 7 | mp2an 705 | . . . 4 ⊢ ((reverse‘〈“𝑆”〉)‘0) = (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) |
| 9 | 2 | oveq1i 7461 | . . . . . . . . 9 ⊢ ((♯‘〈“𝑆”〉) − 1) = (1 − 1) |
| 10 | 1m1e0 12455 | . . . . . . . . 9 ⊢ (1 − 1) = 0 | |
| 11 | 9, 10 | eqtri 2786 | . . . . . . . 8 ⊢ ((♯‘〈“𝑆”〉) − 1) = 0 |
| 12 | 11 | oveq1i 7461 | . . . . . . 7 ⊢ (((♯‘〈“𝑆”〉) − 1) − 0) = (0 − 0) |
| 13 | 0m0e0 12501 | . . . . . . 7 ⊢ (0 − 0) = 0 | |
| 14 | 12, 13 | eqtri 2786 | . . . . . 6 ⊢ (((♯‘〈“𝑆”〉) − 1) − 0) = 0 |
| 15 | 14 | fveq2i 6919 | . . . . 5 ⊢ (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) = (〈“𝑆”〉‘0) |
| 16 | ids1 14785 | . . . . . . 7 ⊢ 〈“𝑆”〉 = 〈“( I ‘𝑆)”〉 | |
| 17 | 16 | fveq1i 6917 | . . . . . 6 ⊢ (〈“𝑆”〉‘0) = (〈“( I ‘𝑆)”〉‘0) |
| 18 | fvex 6929 | . . . . . . 7 ⊢ ( I ‘𝑆) ∈ V | |
| 19 | s1fv 14800 | . . . . . . 7 ⊢ (( I ‘𝑆) ∈ V → (〈“( I ‘𝑆)”〉‘0) = ( I ‘𝑆)) | |
| 20 | 18, 19 | ax-mp 5 | . . . . . 6 ⊢ (〈“( I ‘𝑆)”〉‘0) = ( I ‘𝑆) |
| 21 | 17, 20 | eqtri 2786 | . . . . 5 ⊢ (〈“𝑆”〉‘0) = ( I ‘𝑆) |
| 22 | 15, 21 | eqtri 2786 | . . . 4 ⊢ (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) = ( I ‘𝑆) |
| 23 | 8, 22 | eqtri 2786 | . . 3 ⊢ ((reverse‘〈“𝑆”〉)‘0) = ( I ‘𝑆) |
| 24 | s1eq 14788 | . . 3 ⊢ (((reverse‘〈“𝑆”〉)‘0) = ( I ‘𝑆) → 〈“((reverse‘〈“𝑆”〉)‘0)”〉 = 〈“( I ‘𝑆)”〉) | |
| 25 | 23, 24 | ax-mp 5 | . 2 ⊢ 〈“((reverse‘〈“𝑆”〉)‘0)”〉 = 〈“( I ‘𝑆)”〉 |
| 26 | revcl 14952 | . . . 4 ⊢ (〈“𝑆”〉 ∈ Word V → (reverse‘〈“𝑆”〉) ∈ Word V) | |
| 27 | 1, 26 | ax-mp 5 | . . 3 ⊢ (reverse‘〈“𝑆”〉) ∈ Word V |
| 28 | revlen 14953 | . . . . 5 ⊢ (〈“𝑆”〉 ∈ Word V → (♯‘(reverse‘〈“𝑆”〉)) = (♯‘〈“𝑆”〉)) | |
| 29 | 1, 28 | ax-mp 5 | . . . 4 ⊢ (♯‘(reverse‘〈“𝑆”〉)) = (♯‘〈“𝑆”〉) |
| 30 | 29, 2 | eqtri 2786 | . . 3 ⊢ (♯‘(reverse‘〈“𝑆”〉)) = 1 |
| 31 | eqs1 14802 | . . 3 ⊢ (((reverse‘〈“𝑆”〉) ∈ Word V ∧ (♯‘(reverse‘〈“𝑆”〉)) = 1) → (reverse‘〈“𝑆”〉) = 〈“((reverse‘〈“𝑆”〉)‘0)”〉) | |
| 32 | 27, 30, 31 | mp2an 705 | . 2 ⊢ (reverse‘〈“𝑆”〉) = 〈“((reverse‘〈“𝑆”〉)‘0)”〉 |
| 33 | 25, 32, 16 | 3eqtr4i 2796 | 1 ⊢ (reverse‘〈“𝑆”〉) = 〈“𝑆”〉 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 Vcvv 3454 I cid 5552 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 − cmin 11580 ℕcn 12375 ..^cfzo 13828 ♯chash 14515 Word cword 14699 〈“cs1 14783 reversecreverse 14949 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-s1 14784 df-reverse 14950 |
| This theorem is used by: gsumwrev 19631 efginvrel2 19992 vrgpinv 20034 |
| Copyright terms: Public domain | W3C validator |