[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 natstring-chars
⊦ ¬ char ∈ "0123456789" → ¬ char ∈ n→s(m)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
trim-number-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 47
Used lemmas:
char-in-app
,
char-in-one
,
in-def
,
Used spec theorems:
string2nat
/
n2s-rec
string2nat
/
n2s-char
list-del
/charlist/
get-rec
Used simplifier rules:
nat-div
/
le-div-to-mult
nat-mult
/
leone
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
lels
nat
/
let
nat-div
/
mod-le-03
nat
/
not-zero
nat-basic1
/
twols-02
list-del
/charlist/
one-03
nat
/
l-num-05
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat
/
elim-pred-c
list
/charlist/
c-07
list
/charlist/
e-01
nat-basic1
/
lf-02
list-del
/charlist/
get-zero-01
string-append
/
assoc
string-append
/
empty-01
string-append
/
chartostring-01
list
/charlist/
c
list
/charlist/
Two
nat-basic1
/
f
nat
/
lels-01
list
/charlist/
in-17
list
/charlist/
in-append
list
/charlist/
in-06
list
/charlist/
a
list
/charlist/
app
string2list
/
s2l-empty
string2list
/
s2l-rec-01