[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-minus-one
⊦ int2bytes(i) = i2b(~1) ' ↔ i = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
int2bytes-butlast
,
int2bytes-len-le-neg-01
,
int2bytes-len-le-neg-03
,
no-leading-zero-04
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
bits2bytes-empty
,
bits2bytes-rec
,
bits2bytes-base
,
int2bytes
,
int2bytes-byte
,
Used spec theorems:
byte
/
notequal
int2bits
/
int2bits-lelen
int2bits
/
int2bits-lelen-03
Used simplifier rules:
int-abs
/
mone-06
int-basic1
/
lst-01
int-abs
/
numle-02
int-abs
/
lels-03
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-03
int-basic1
/
numlsf
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
forward-lsle
int-abs
/
forward-le-04
int-abs
/
lels
int-basic2
/
num-between
int-basic1
/
lst
int-abs
/
lels-01
int2bits
/
int2int-inj
list
/bytelist/
Last
list
/bytelist/
c-05
list
/bytelist/
a
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
lels-01
list
/bytelist/
c-04