[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-ngr
⊦ s2i(sho0) ≠ 0 → ¬ 65536 ≤ s2i(sho) % s2i(sho0)
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: 3
Proof steps: 5
Used lemmas:
short-min-02
,
short-max-06
,
Used spec theorems:
int-div
/
modnum-neg-01
int-div
/
mod-nle-01
Used simplifier rules:
int-div
/
mod-neg
int-abs
/
neg
int-basic1
/
ls-01
int-abs
/
lels-04
int-abs
/
negle-13
int-abs
/
numle-02
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-div
/
mod-grz-01
int-abs
/
lels-01
int-abs
/
lels-02
int-abs
/
lels
int-abs
/
forward-le
int-abs
/
forward-le-01