[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-not-max
⊦ 126 < b2i(by) ∧ 0 < i → ¬ b2i(by) + i < 128
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 12
Used lemmas:
Used spec theorems:
int-basic1
/
ls-rec
int-basic1
/
lsrec
Used simplifier rules:
int-basic1
/
lst
int-basic2
/
ls
int-basic1
/
ls-01
int-abs
/
numadd-01
int-basic2
/
succ-01
int-abs
/
Sub-def
int-abs
/
sub-ls-01
int-abs
/
numls-03
int-abs
/
lsone
int-abs
/
lels-03
int-abs
/
sub-eq
int-basic2
/
add-c
int-basic2
/
add-a
int-basic1
/
numlslsdel-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05