[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 n2s-chars
⊦ ¬ char ∈ '0' + '1' + '2' + '3' + '4' + '5' + '6' + '7' + ('8' + '9') → ¬ char ∈ s→l(n→s(m))
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: 14
Proof steps: 43
Used lemmas:
n2s-char
,
n2s-rec
,
Used spec theorems:
list-del
/charlist/
get-numrec
list-del
/charlist/
get-rec
Used simplifier rules:
nat-div
/
mod-le-03
nat
/
let
list
/charlist/
in-01
nat
/
lels
nat-div
/
le-div-to-mult
nat-mult
/
leone
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
not-zero
string2list
/
s2l-app
nat-basic1
/
twols-02
list-del
/charlist/
one-03
list
/charlist/
c-07
list
/charlist/
e-01
nat-basic1
/
lf-02
nat
/
l-num-05
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat
/
elim-pred-c
nat
/
pred-03
list-del
/charlist/
get-zero-01
string2list
/
s2l-one
string-append
/
assoc
string-append
/
empty-01
string-append
/
chartostring-01
nat-basic1
/
f
nat
/
lels-01
list
/charlist/
a
list
/charlist/
in-17
list
/charlist/
in-append
list
/charlist/
in-06
list
/charlist/
c
list
/charlist/
Two