[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 bits2int-le8-01
⊦ # bits ≤ 8 ∧ bits ≠ [] → ¬ 127 < bits2int(bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bits2int8-01
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
bits2bits-def
,
int2bits-len-pos
,
Used spec theorems:
int-pot
/
exin2pot
intnat
/
add-01
int-pot
/
two-le
Used simplifier rules:
int-basic2
/
add-in
intnat
/
i2i-pos
intnat
/
n2i-add
int-abs
/
sub-ls-01
intnat
/
num-n2i-ls-02
int-abs
/
sub-le-01
intnat
/
num-n2i-ls-06
nat
/
lels-03
nat-basic1
/
lf-01
nat-basic1
/
f
nat
/
fle-01
list-data
/bitlista/
l
bitopsaux
/
sgn-empty-01
nat
/
l-num-04
intnat
/
num-i2n-ls-02
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
l-01
intnat
/
abs-zero
int-abs
/
sub-eq
intnat
/
num-n2i-eq
nat-basic1
/
one
nat-basic1
/
ls-02
nat
/
lels-01
intnat
/
num-i2n-eq
bitopsaux
/
sgn-length
int-abs
/
lels-01
int-basic1
/
ls-01
int-abs
/
lels-03
int-pot
/
two-ls
int-abs
/
forward-lele
int-abs
/
forward-lsle
int-mult
/
zero-gr
int-div
/
nummult-ls-02
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
one
int-mult
/
numls-09
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-lels
int-basic2
/
add-c
int-basic2
/
add-a
int-pot
/
succ
int-abs
/
lels-02
int-basic1
/
lf-03
int-basic1
/
lf-02
int-abs
/
anti
int-abs
/
lels
int-abs
/
numlsf-01