MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-reverse Structured version   Visualization version   GIF version

Definition df-reverse 13875
Description: Define an operation which reverses the order of symbols in a word. This operation is also known as "word reversal" and "word mirroring". (Contributed by Stefan O'Rear, 26-Aug-2015.)
Assertion
Ref Expression
df-reverse reverse = (𝑠 ∈ V ↦ (𝑥 ∈ (0..^(♯‘𝑠)) ↦ (𝑠‘(((♯‘𝑠) − 1) − 𝑥))))
Distinct variable group:   𝑥,𝑠

Detailed syntax breakdown of Definition df-reverse
StepHypRef Expression
1 creverse 13874 . 2 class reverse
2 vs . . 3 setvar 𝑠
3 cvv 3414 . . 3 class V
4 vx . . . 4 setvar 𝑥
5 cc0 10252 . . . . 5 class 0
62cv 1657 . . . . . 6 class 𝑠
7 chash 13410 . . . . . 6 class
86, 7cfv 6123 . . . . 5 class (♯‘𝑠)
9 cfzo 12760 . . . . 5 class ..^
105, 8, 9co 6905 . . . 4 class (0..^(♯‘𝑠))
11 c1 10253 . . . . . . 7 class 1
12 cmin 10585 . . . . . . 7 class
138, 11, 12co 6905 . . . . . 6 class ((♯‘𝑠) − 1)
144cv 1657 . . . . . 6 class 𝑥
1513, 14, 12co 6905 . . . . 5 class (((♯‘𝑠) − 1) − 𝑥)
1615, 6cfv 6123 . . . 4 class (𝑠‘(((♯‘𝑠) − 1) − 𝑥))
174, 10, 16cmpt 4952 . . 3 class (𝑥 ∈ (0..^(♯‘𝑠)) ↦ (𝑠‘(((♯‘𝑠) − 1) − 𝑥)))
182, 3, 17cmpt 4952 . 2 class (𝑠 ∈ V ↦ (𝑥 ∈ (0..^(♯‘𝑠)) ↦ (𝑠‘(((♯‘𝑠) − 1) − 𝑥))))
191, 18wceq 1658 1 wff reverse = (𝑠 ∈ V ↦ (𝑥 ∈ (0..^(♯‘𝑠)) ↦ (𝑠‘(((♯‘𝑠) − 1) − 𝑥))))
Colors of variables: wff setvar class
This definition is referenced by:  revval  13876
  Copyright terms: Public domain W3C validator