| 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 14613 | . . . . 5 ⊢ 〈“𝑆”〉 ∈ Word V | |
| 2 | s1len 14614 | . . . . . . 7 ⊢ (♯‘〈“𝑆”〉) = 1 | |
| 3 | 1nn 12215 | . . . . . . 7 ⊢ 1 ∈ ℕ | |
| 4 | 2, 3 | eqeltri 2857 | . . . . . 6 ⊢ (♯‘〈“𝑆”〉) ∈ ℕ |
| 5 | lbfzo0 13699 | . . . . . 6 ⊢ (0 ∈ (0..^(♯‘〈“𝑆”〉)) ↔ (♯‘〈“𝑆”〉) ∈ ℕ) | |
| 6 | 4, 5 | mpbir 233 | . . . . 5 ⊢ 0 ∈ (0..^(♯‘〈“𝑆”〉)) |
| 7 | revfv 14770 | . . . . 5 ⊢ ((〈“𝑆”〉 ∈ Word V ∧ 0 ∈ (0..^(♯‘〈“𝑆”〉))) → ((reverse‘〈“𝑆”〉)‘0) = (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0))) | |
| 8 | 1, 6, 7 | mp2an 702 | . . . 4 ⊢ ((reverse‘〈“𝑆”〉)‘0) = (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) |
| 9 | 2 | oveq1i 7401 | . . . . . . . . 9 ⊢ ((♯‘〈“𝑆”〉) − 1) = (1 − 1) |
| 10 | 1m1e0 12284 | . . . . . . . . 9 ⊢ (1 − 1) = 0 | |
| 11 | 9, 10 | eqtri 2784 | . . . . . . . 8 ⊢ ((♯‘〈“𝑆”〉) − 1) = 0 |
| 12 | 11 | oveq1i 7401 | . . . . . . 7 ⊢ (((♯‘〈“𝑆”〉) − 1) − 0) = (0 − 0) |
| 13 | 0m0e0 12330 | . . . . . . 7 ⊢ (0 − 0) = 0 | |
| 14 | 12, 13 | eqtri 2784 | . . . . . 6 ⊢ (((♯‘〈“𝑆”〉) − 1) − 0) = 0 |
| 15 | 14 | fveq2i 6865 | . . . . 5 ⊢ (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) = (〈“𝑆”〉‘0) |
| 16 | ids1 14605 | . . . . . . 7 ⊢ 〈“𝑆”〉 = 〈“( I ‘𝑆)”〉 | |
| 17 | 16 | fveq1i 6863 | . . . . . 6 ⊢ (〈“𝑆”〉‘0) = (〈“( I ‘𝑆)”〉‘0) |
| 18 | fvex 6875 | . . . . . . 7 ⊢ ( I ‘𝑆) ∈ V | |
| 19 | s1fv 14618 | . . . . . . 7 ⊢ (( I ‘𝑆) ∈ V → (〈“( I ‘𝑆)”〉‘0) = ( I ‘𝑆)) | |
| 20 | 18, 19 | ax-mp 5 | . . . . . 6 ⊢ (〈“( I ‘𝑆)”〉‘0) = ( I ‘𝑆) |
| 21 | 17, 20 | eqtri 2784 | . . . . 5 ⊢ (〈“𝑆”〉‘0) = ( I ‘𝑆) |
| 22 | 15, 21 | eqtri 2784 | . . . 4 ⊢ (〈“𝑆”〉‘(((♯‘〈“𝑆”〉) − 1) − 0)) = ( I ‘𝑆) |
| 23 | 8, 22 | eqtri 2784 | . . 3 ⊢ ((reverse‘〈“𝑆”〉)‘0) = ( I ‘𝑆) |
| 24 | s1eq 14608 | . . 3 ⊢ (((reverse‘〈“𝑆”〉)‘0) = ( I ‘𝑆) → 〈“((reverse‘〈“𝑆”〉)‘0)”〉 = 〈“( I ‘𝑆)”〉) | |
| 25 | 23, 24 | ax-mp 5 | . 2 ⊢ 〈“((reverse‘〈“𝑆”〉)‘0)”〉 = 〈“( I ‘𝑆)”〉 |
| 26 | revcl 14768 | . . . 4 ⊢ (〈“𝑆”〉 ∈ Word V → (reverse‘〈“𝑆”〉) ∈ Word V) | |
| 27 | 1, 26 | ax-mp 5 | . . 3 ⊢ (reverse‘〈“𝑆”〉) ∈ Word V |
| 28 | revlen 14769 | . . . . 5 ⊢ (〈“𝑆”〉 ∈ Word V → (♯‘(reverse‘〈“𝑆”〉)) = (♯‘〈“𝑆”〉)) | |
| 29 | 1, 28 | ax-mp 5 | . . . 4 ⊢ (♯‘(reverse‘〈“𝑆”〉)) = (♯‘〈“𝑆”〉) |
| 30 | 29, 2 | eqtri 2784 | . . 3 ⊢ (♯‘(reverse‘〈“𝑆”〉)) = 1 |
| 31 | eqs1 14620 | . . 3 ⊢ (((reverse‘〈“𝑆”〉) ∈ Word V ∧ (♯‘(reverse‘〈“𝑆”〉)) = 1) → (reverse‘〈“𝑆”〉) = 〈“((reverse‘〈“𝑆”〉)‘0)”〉) | |
| 32 | 27, 30, 31 | mp2an 702 | . 2 ⊢ (reverse‘〈“𝑆”〉) = 〈“((reverse‘〈“𝑆”〉)‘0)”〉 |
| 33 | 25, 32, 16 | 3eqtr4i 2794 | 1 ⊢ (reverse‘〈“𝑆”〉) = 〈“𝑆”〉 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∈ wcel 2141 Vcvv 3453 I cid 5537 ‘cfv 6516 (class class class)co 7391 0cc0 11067 1c1 11068 − cmin 11408 ℕcn 12204 ..^cfzo 13653 ♯chash 14337 Word cword 14520 〈“cs1 14603 reversecreverse 14765 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9891 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-n0 12476 df-z 12563 df-uz 12834 df-fz 13507 df-fzo 13654 df-hash 14338 df-word 14521 df-s1 14604 df-reverse 14766 |
| This theorem is referenced by: gsumwrev 19397 efginvrel2 19758 vrgpinv 19800 |
| Copyright terms: Public domain | W3C validator |