[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 bytes2int-mklist-mones
⊦ n ≠ 0 → bytes2int(mklist(i2b(~1), n)) = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bytes2int-mklist-mones-01
,
rightshift-8-01-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
bytes2int-rec
,
bytes2int-one
,
Used spec theorems:
list-last
/bytelist/
mk-last-02
Used simplifier rules:
intops
/
band-255-neg
intops
/
band-associativity
intops
/
band-commutativity
int-abs
/
numadd-01
int-basic2
/
add-a
int-basic2
/
add-c
list-last
/bytelist/
mk-empty
nat-basic2
/
pred
byte
/
num-ibbi
list-last
/bytelist/
mklist-one
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic2
/
succ