[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
,
Theorem int2bits-256-neg-mone
⊦ 0 < j ∧ 0 < i → int2bits(j * 256 - 1) = int2bits(j - 1) + mklist(true, i→n(8))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 4
Used lemmas:
int2bits-2pot-neg-mone
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-03
int-abs
/
lels
list
/bitlista/
app-01
int-abs
/
forward-le-05
list
/bitlista/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
bitlista
/
mklist-num-01