[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 bits2int8-02
⊦ 8 < # bits → ¬ bits2int(lastn(8, bits)) < ~128
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
bits2int8
,
Used spec theorems:
list-del
/bitlista/
lastn-length-01
Used simplifier rules:
nat
/
lels-01
nat-basic1
/
ls-02
list-data
/bitlista/
l
int-basic1
/
numlsf
nat-basic1
/
f