[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 int2bytes-one
⊦ # int2bytes(i) = 1 → ~128 ≤ i ∧ i ≤ 127
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bytes-one-01
,
int2bytes-one-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 15
Used lemmas:
int2bytes-empty
,
int2bytes-last-01
,
int2bytes-rec-case
,
int2bytes-byte
,
int2bytes-le127
,
Used spec theorems:
Used simplifier rules:
int-abs
/
zero-gels
int-basic1
/
numlslsdel-01
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
numlsledel-01
int-abs
/
numlelsdel-01
int-abs
/
anti
nat-basic2
/
one-03
list-data
/bytelist/
l
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
lels-02
int-abs
/
zero-gels-03
int-abs
/
forward-le-04
int-abs
/
numlsledel
list
/bytelist/
len
list
/bytelist/
a
int-abs
/
numlelsdel
int-abs
/
zero-gels-02
int-abs
/
lels-03
int-abs
/
forward-le-02
int-basic1
/
lst
int-abs
/
lels
int-abs
/
lels-04
int-basic2
/
num-between
int-abs
/
lels-01
list
/bytelist/
len-02
int-abs
/
numleledel-01
int-abs
/
numleledel