[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 28 from proof shiftzero-max-neg-01 (
previous step
)
⊦ i < ~1 ∧ n ≠ 0 → >>>(n, i, 1) = 2 ^ n→i((# fillsgn(n, int2bits(i)))-1) + (i - 1) / 2
Lemma
shiftzero-by-one-01