[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 sis-ls-same-01
⊦ s2i(i2s(i)) < i ↔ 32768 ≤ i
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: 6
Proof steps: 12
Used lemmas:
num-issi
,
sis-neg-low
,
sis-neg-high
,
short-max-07
,
Used spec theorems:
int-div
/
mod-nls-04
int-div
/
mod-zero-05
Used simplifier rules:
int-basic2
/
num-between
int-abs
/
numleledel-01
int-abs
/
numlsledel
int-abs
/
forward-le-01
int-basic1
/
numlslsdel-01
int-basic1
/
irref
int-abs
/
forward-lels
int-abs
/
numls-03
int-abs
/
zero-gels-03
int-abs
/
forward-lsle
int-abs
/
forward-le-04
int-abs
/
abs-08
int-abs
/
neg-13
int-abs
/
numls-02
int-basic2
/
add-a
int-basic2
/
add-c
int-basic2
/
ls
int-abs
/
zero-gels-01
int-div
/
mod-ls-zero
int-basic1
/
numlsf
int-abs
/
lels-03
int-abs
/
forward-le-02
int-basic1
/
numlslsdel
int-abs
/
lels
int-abs
/
lels-01