[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 25 from proof int2bits-add-low (
previous step
)
⊦ j0 < 0 ∧ 0 < i ∧ abs(j0) ≤ 2 ^ (i - 1) ∧ 0 < j → uint2bits(j * 2 ^ i + j0) = uint2bits(j - 1) + fillsgn(i→n(i), int2bits(j0))
Lemma
uint2bits-add-low-01