[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 intshiftrzero-def
⊦ i i>>> j = bits2int(sublist(0, # fillsgn(32, int2bits(i)), mklist(false, i→n(band(j, 31))) + fillsgn(32, int2bits(i))))
Type: An axiom
Validity: The proof is valid.
Features:
Comment: this axiom uses 32 as a constant, i.e. it can be used only for integer shifts. Use l>>> for long shifts.
Used by:
cast-law-shift-snd-zr
,
intshiftrzero-prop-01
,
intshiftzero-def-unbounded
,
intshiftzero-mone
,
Used by units in proved state:
byte
,
Proof exists?: No