[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 inject-n2s
⊦ n→s(m) = n→s(n) ↔ m = n
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 23
Used lemmas:
n2s-empty
,
n2s-length-01
,
n2s-rec
,
n2s-char
,
Used spec theorems:
string-less
/
append-eqlen-01
string-less
/
neq-length
string2list
/
at-eq
Used simplifier rules:
list
/charlist/
len
list
/charlist/
len-02
list
/charlist/
a
list-dup
/charlist/
rec
list
/charlist/
in-append
list
/charlist/
in-17
list-dup
/charlist/
c
string-less
/
len-app
string2list
/
length-at
nat-basic2
/
one-03
string-less
/
len-zero
nat-basic2
/
a
nat-basic1
/
f
nat
/
fle
string-append
/
assoc
string-append
/
empty-01
string-append
/
chartostring-01
list
/charlist/
c
list
/charlist/
Two
nat-basic2
/
c
nat-div
/
mod-ls
nat-div
/
div-elim
nat
/
let
nat-div
/
mod-le-03
nat-div
/
le-div-to-mult
nat-mult
/
leone
nat-mult
/
mult-a
nat-mult
/
mult-c
nat
/
not-zero
nat
/
lels