[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 shiftrzero-def-01
⊦ >>>(n, i, j) = bits2int(sublist(0, # fillsgn(n, int2bits(i)), mklist(false, i→n(j)) + fillsgn(n, int2bits(i))))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
intshiftzero-def-unbounded
,
longshiftzero-def-unbounded
,
shiftzero-by-one
,
shiftzero-minus-one
,
shiftzero-not-neg
,
shiftzero-pos
,
shiftzero-rec-neg-longer
,
shiftzero-rec-neg-shorter
,
shiftzero-zero
,
shiftzero-zero-size
,
Used by units in proved state:
Proof exists?: No