[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 cast-mod-neg-high (
previous step
)
⊦ j ≤ ~(2 ^ i) ∧ 0 < i ∧ j % 2 ^ i ≠ 0 → int2bits(j) = int2bits(j / 2 ^ i - 1) + fillsgn(i→n(i + 1), int2bits(j % 2 ^ i)).rest
A spec-lemma