[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 6 from proof butlast-length (
previous step
)
# str = m + 1 ⊦ str = "", # l→s(s→l(str).butlast) = m
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 7
:
# str = m + 1 ⊦ str = "", # s→l(str).butlast = m
Rule argument
Additional information
Used simplifier rules: ⊦ # l→s(chars) = # chars;