| /- | |
| Copyright (c) 2025 Lean FRO, LLC. All rights reserved. | |
| Released under Apache 2.0 license as described in the file LICENSE. | |
| Author: Markus Himmel | |
| -/ | |
| module | |
| prelude | |
| public import Init.Data.String.Basic | |
| /-! | |
| # Basic lemmas about strings | |
| This file contains lemmas that could be in `Init.Data.String.Basic` but are not because they are | |
| not needed to define basic string operations. | |
| -/ | |
| public section | |
| namespace String | |
| @[simp] | |
| theorem singleton_append_inj : singleton c ++ s = singleton d ++ t ↔ c = d ∧ s = t := by | |
| simp [← toList_inj] | |
| @[simp] | |
| theorem push_inj : push s c = push t d ↔ s = t ∧ c = d := by | |
| simp [← toList_inj] | |
| @[simp] | |
| theorem append_eq_empty_iff {s t : String} : s ++ t = "" ↔ s = "" ∧ t = "" := by | |
| rw [← toList_inj]; simp | |
| @[simp] | |
| theorem push_ne_empty : push s c ≠ "" := by | |
| rw [ne_eq, ← toList_inj]; simp | |
| @[simp] | |
| theorem singleton_ne_empty {c : Char} : singleton c ≠ "" := by | |
| simp [singleton] | |
| @[simp] | |
| theorem Slice.Pos.copy_inj {s : Slice} {p₁ p₂ : s.Pos} : p₁.copy = p₂.copy ↔ p₁ = p₂ := by | |
| simp [String.Pos.ext_iff, Pos.ext_iff] | |
| @[simp] | |
| theorem Pos.startPos_le {s : String} (p : s.Pos) : s.startPos ≤ p := by | |
| simp [Pos.le_iff, Pos.Raw.le_iff] | |
| @[simp] | |
| theorem Slice.Pos.startPos_le {s : Slice} (p : s.Pos) : s.startPos ≤ p := by | |
| simp [Pos.le_iff, Pos.Raw.le_iff] | |
| @[simp] | |
| theorem Slice.Pos.le_endPos {s : Slice} (p : s.Pos) : p ≤ s.endPos := | |
| p.isValidForSlice.le_rawEndPos | |
| theorem getUTF8Byte_eq_getUTF8Byte_toSlice {s : String} {p : String.Pos.Raw} {h} : | |
| s.getUTF8Byte p h = s.toSlice.getUTF8Byte p (by simpa) := by | |
| simp [Slice.getUTF8Byte] | |
| theorem getUTF8Byte_toSlice {s : String} {p : String.Pos.Raw} {h} : | |
| s.toSlice.getUTF8Byte p h = s.getUTF8Byte p (by simpa) := by | |
| simp [Slice.getUTF8Byte] | |
| @[simp] | |
| theorem Pos.byte_toSlice {s : String} {p : s.Pos} {h} : | |
| p.toSlice.byte h = p.byte (ne_of_apply_ne Pos.toSlice (by simpa)) := by | |
| simp [byte] | |
| theorem Pos.byte_eq_byte_toSlice {s : String} {p : s.Pos} {h} : | |
| p.byte h = p.toSlice.byte (ne_of_apply_ne Pos.ofToSlice (by simpa)) := by | |
| simp | |
| end String |