[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 short-mod-add
⊦ 0 ≤ s2i(sho) → (s2i(sho) + s2i(sho0)) % 65536 = s2i(sho) + s2i(sho0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
short-mod-add-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
short-add-max
,
short-add-min
,
Used spec theorems:
int-div
/
mod-zero-05
int-abs
/
Abs-pos
Used simplifier rules:
int-basic1
/
lst-01
int-div
/
mod-neq-02
int-abs
/
abs-08
int-abs
/
negle-07
int-abs
/
numle-03
int-basic2
/
add-a
int-abs
/
forward-lsle
int-abs
/
forward-le-02
int-abs
/
forward-le-04
int-abs
/
forward-le-03
int-abs
/
abs-06
int-abs
/
abs-03
int-abs
/
forward-le
int-abs
/
lels
int-abs
/
forward-le-01
int-basic2
/
add-c