[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-leading-zero
⊦ 0 ≤ b2i(by) → bytes2int(i2b(0) ' + by ') = b2i(by)
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: 1
Proof steps: 2
Used lemmas:
bytes2int-zero
,
bytes2int-rec-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
list
/bytelist/
len-02
list
/bytelist/
len
list-last
/bytelist/
last-def
list
/bytelist/
a
intops
/
band-255-pos
byte
/
byte-mod-100x
intops
/
band-associativity
intops
/
band-commutativity
list-last
/bytelist/
butlast-def
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
byte
/
byte-equal