[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 shiftright-neg-mone
⊦ ~(2 ^ (abs(j) - 1)) ≤ i ∧ i < 0 → i >> j = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
shiftright-rec-8-neg
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
shiftrsign-01
,
Used spec theorems:
list-del
/bitlista/
sublist-num
list-del
/bitlista/
first-append
int2bits
/
int2bits-lslen-05
int2bits
/
int2bits-mone
Used simplifier rules:
list
/bitlista/
len-02
nat-basic1
/
one-01
intnat
/
abs-zero
int-abs
/
abs-06
int-pot
/
pot2-pos
int-abs
/
leone
int-abs
/
sub-le-01
int-basic2
/
add-a
int-abs
/
minus-add
int-abs
/
mone-08
int-abs
/
lels
intnat
/
ini2-abs
int-abs
/
lels-01
int-basic2
/
add-c
int-abs
/
lels-04
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
lels-01
list-last
/bitlista/
mk-len
list-del
/bitlista/
first-mklist
int2bits
/
bits2int-mklist-03
list-del
/bitlista/
restN-zero
int2bits
/
int2bits-first-01
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-abs
/
negle-13