[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
⊦ i i>> j = bits2int(sublist(0, # int2bits(i), mklist(int2bits(i).first, i→n(band(j, 31))) + int2bits(i)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
cast-law-shift-snd-r
,
intshiftright-def-unbounded
,
intshiftright-ls-01
,
intshiftright-unbounded-same
,
intshiftrsign-if
,
intshiftrsign-rec-neg
,
intshiftrsign-rec-pos
,
intshiftrsign-zero
,
intshiftrsign32
,
Used by units in proved state:
Proof exists?: No