[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 bib-lower
⊦ ~256 < i ∧ i < ~128 → b2i(i2b(i)) = i + 256
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
byte-law-add-one
,
byte-law-mult-one
,
byte-mult-256
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
bib-neg-high
,
bib-neg-low
,
Used spec theorems:
int-div
/
mod-zero-05
Used simplifier rules:
int-abs
/
zero-gels-01
int-div
/
mod-ls-zero
int-basic2
/
add-in
int-basic2
/
eq
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
abs-08
int-abs
/
neg-13
int-abs
/
numls-02
int-abs
/
numlelsdel-01
int-abs
/
numlsledel-01
int-abs
/
lels-04
int-abs
/
forward-lsle
int-abs
/
lels-03
int-abs
/
lels
int-basic1
/
numlsf