[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 intshiftrsign-2pot-neg-02
⊦ i < 0 ∧ i % 2 ^ j ≠ 0 ∧ 0 < j ∧ j < 32 → i i>> j = i / 2 ^ j - 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
intshiftrsign-neg-02
,
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
intshiftrsign-2pot-neg-01
,
Used spec theorems:
int-div
/
div-mult-neg
Used simplifier rules:
int-abs
/
sub-le
int-abs
/
numleledel
int-abs
/
numle-03
int-abs
/
mone-05
int-abs
/
abs-05
int-abs
/
subsub
int-basic2
/
zero-02
int-mult
/
commutativity
int-mult
/
succ-rmerge
int-abs
/
Sub-def
int-mult
/
associativity
int-basic2
/
add-in
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
zero-gels-01
int-abs
/
zero-gels-04
int-abs
/
forward-lsle
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-abs
/
forward-le-01
int-abs
/
forward-lels
int-abs
/
neg-13
int-abs
/
abs-08
int-abs
/
lels-02
int-pot
/
pot2-pos
int-abs
/
lels-01
int-basic1
/
ls-01
int-div
/
div-elim-negpos
int-abs
/
sub-sub-04
int-abs
/
forward-le-02
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
sub-eq
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
numlelsdel