[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 byte-nls-01
i ≤ ~128 ⊦ ¬ b2i(by) < (* i)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bint-byte
,
byte-ls-256
,
fits-law-add
,
fits-law-div
,
fits-law-mod
,
fits-law-sub
,
short-byte
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
byte-nls
,
Used spec theorems:
Used simplifier rules:
int-abs
/
zero-gels-03
int-abs
/
forward-lsle
int-abs
/
forward-le-03
int-abs
/
forward-le-04