[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 shiftrsign-01
⊦ i >> j = bits2int(sublist(0, # int2bits(i), mklist(int2bits(i).first, i→n(j)) + int2bits(i)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
intshiftright-def-unbounded
,
intshiftright-unbounded-same
,
longshiftright-def-unbounded
,
rightshift-zero
,
shiftright-abs
,
shiftright-minus-one
,
shiftright-neg-mone
,
shiftright-not-pos-01
,
shiftright-rec-neg
,
shiftright-rec-pos
,
shiftright-zero
,
shiftzero-minus-one
,
shiftzero-pos
,
shiftzero-zero-size
,
Used by units in proved state:
Proof exists?: No