[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 fix-value
⊦ # bytes ≤ n ∧ bytes ≠ [] → bytes2int(fix(n, bytes)) = bytes2int(bytes)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
int2int-fillsgn
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 24
Used lemmas:
bytes2bits-mklist-01
,
bytes2bits-empty-01
,
bytes2bits-mklist
,
bytes2bits-append
,
bytes2int
,
fix-pos
,
fix-neg
,
fix-longer
,
Used spec theorems:
int2bits
/
bits2int-zeros
int2bits
/
bits2int-pos-02
int2bits
/
bits2int-mklist
Used simplifier rules:
int2bits
/
bits2int-first-01
int-abs
/
forward-le-02
int2bits
/
bits2int-first
list
/bitlista/
a
int2bits
/
bits2int-pos
nat-mult
/
zero-01
nat-mult
/
mult-a
nat-mult
/
mult-c
list
/bytelist/
a
nat-basic2
/
l-01
nat
/
lels-03
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq
nat
/
lels-01
nat
/
elim-sub
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
lels
nat-basic1
/
ls-02
nat-basic1
/
neq-01
nat-basic1
/
f
nat
/
lels-02
nat
/
ge
nat
/
anti
list-del
/bytelist/
lastN-all