[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 41 from proof int2bits-add-high (
previous step
)
⊦ ¬(∃ i. 2 ^ i - 1 = j) ∧ 0 ≤ j → # int2bits(j) = # int2bits(j + 1)
Lemma
int2bits-len-pos-suc