[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 8 from proof bib-pos-high (
previous step
)
⊦ 0 < i ∧ lastn(m, int2bits(i)).first ∧ m ≤ # int2bits(i) ∧ m ≠ 0 → bits2int(lastn(m, int2bits(i))) = i % 2 ^ n→i(m) - 2 ^ n→i(m)
A spec-lemma