[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
,
Theorem substring-zero-rec
⊦ n ≠ 0 ∧ str ≠ "" → substring(str, 0, n) = str.char1 + substring(str.rstring, 0, n -1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
substring-def
,
Used spec theorems:
list-del
/charlist/
sub-zerorec
Used simplifier rules:
nat
/
pred-03
nat
/
elim-pred-c
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
string-data
/
elim
string2list
/
s2l-rec
list
/charlist/
app-02-ant
list
/charlist/
e
list
/charlist/
e-01
string-append
/
assoc
string-append
/
app
string-append
/
chartostring-01
string2list
/
l2s-rec
list
/charlist/
c
list
/charlist/
c-07
list
/charlist/
a
list
/charlist/
c-08