TorchLean API
Docs Home
Guide
Examples
Graphs
Init
.
Data
.
String
.
Lemmas
Search
Declaration colors
def
theorem
structure
axiom
return to top
source
Imports
Init.Data.Char.Lemmas
Init.Data.Char.Order
Init.Data.List.Lex
Init.Data.Order.Lemmas
Init.Data.String.Basic
Init.Data.String.Lemmas.Basic
Init.Data.String.Lemmas.FindPos
Init.Data.String.Lemmas.IsEmpty
Init.Data.String.Lemmas.Iterate
Init.Data.String.Lemmas.Modify
Init.Data.String.Lemmas.Order
Init.Data.String.Lemmas.Pattern
Init.Data.String.Lemmas.Search
Init.Data.String.Lemmas.Slice
Init.Data.String.Lemmas.Splits
Imported by
String
.
data_eq_of_eq
String
.
ne_of_data_ne
String
.
not_le
String
.
not_lt
String
.
le_refl
String
.
lt_irrefl
String
.
le_trans
String
.
lt_trans
String
.
le_total
String
.
le_antisymm
String
.
lt_asymm
String
.
ne_of_lt
String
.
instIsLinearOrder
String
.
instLawfulOrderLT
source
@[deprecated String.toList_inj (since := "2025-10-30")]
theorem
String
.
data_eq_of_eq
{
a
b
:
String
}
(
h
:
a
=
b
)
:
a
.
toList
=
b
.
toList
source
@[deprecated String.toList_inj (since := "2025-10-30")]
theorem
String
.
ne_of_data_ne
{
a
b
:
String
}
(
h
:
a
.
toList
≠
b
.
toList
)
:
a
≠
b
source
@[simp]
theorem
String
.
not_le
{
a
b
:
String
}
:
¬
a
≤
b
↔
b
<
a
source
@[simp]
theorem
String
.
not_lt
{
a
b
:
String
}
:
¬
a
<
b
↔
b
≤
a
source
@[simp]
theorem
String
.
le_refl
(
a
:
String
)
:
a
≤
a
source
@[simp]
theorem
String
.
lt_irrefl
(
a
:
String
)
:
¬
a
<
a
source
theorem
String
.
le_trans
{
a
b
c
:
String
}
:
a
≤
b
→
b
≤
c
→
a
≤
c
source
theorem
String
.
lt_trans
{
a
b
c
:
String
}
:
a
<
b
→
b
<
c
→
a
<
c
source
theorem
String
.
le_total
(
a
b
:
String
)
:
a
≤
b
∨
b
≤
a
source
theorem
String
.
le_antisymm
{
a
b
:
String
}
:
a
≤
b
→
b
≤
a
→
a
=
b
source
theorem
String
.
lt_asymm
{
a
b
:
String
}
(
h
:
a
<
b
)
:
¬
b
<
a
source
theorem
String
.
ne_of_lt
{
a
b
:
String
}
(
h
:
a
<
b
)
:
a
≠
b
source
instance
String
.
instIsLinearOrder
:
Std.IsLinearOrder
String
source
instance
String
.
instLawfulOrderLT
:
Std.LawfulOrderLT
String