[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
,
Proof step 4 from proof longshiftzero-def-unbounded (
previous step
)
⊦ >>>(n, i, j) = bits2int(sublist(0, # fillsgn(n, int2bits(i)), mklist(false, i→n(j)) + fillsgn(n, int2bits(i))))
Lemma
shiftrzero-def-01