[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 int2bits-rest
⊦ int2bits(j).rest = [] ↔ j = 0 ∨ j = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 21
Used lemmas:
uint2bits-one
,
int2bits-neg-num
,
int2bits-zero
,
uint2bits-rest
,
uint2bits-onein-01
,
uint2bits-empty
,
uint2bits-rec
,
int2bits-neg
,
int2bits-pos
,
Used spec theorems:
bitopsaux
/
succ-rec-01
bitopsaux
/
sgn-true
bitopsaux
/
sgn-last-04
list
/bitlista/
rest-01
Used simplifier rules:
bitopsaux
/
succ-empty-01
bitopsaux
/
succ-truein-01
list
/bitlista/
e
bitopsaux
/
sgn-empty-01
int-div
/
div-ls-zero
int-abs
/
numle-03
int-basic1
/
minus-one
list
/bitlista/
e-02
list
/bitlista/
in-append
list
/bitlista/
in-17
list
/bitlista/
app-02-ant
bitopsaux
/
inv-empty
int-basic1
/
numlslsdel
int-div
/
div-lezero
int-basic2
/
add-zero
int-abs
/
negle-07
bitopsaux
/
inv-in-01
int-div
/
mod2-neg-odd
bitopsaux
/
inv-one
bitopsaux
/
inv-append
int-abs
/
numadd-01
int-abs
/
negeq
int-div
/
mod-neg-01
int-div
/
neg-01
int-abs
/
neg-07
int-abs
/
numls-03
int-abs
/
lels
int-abs
/
mone-08
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
abs-08
int-abs
/
forward-le-02
int-abs
/
lels-01
int-abs
/
lels-02
list
/bitlista/
rest
list
/bitlista/
Two
bitopsaux
/
invert-zero
bitopsaux
/
inv-one-01
list
/bitlista/
c
list
/bitlista/
a
bitopsaux
/
succ-zero
list
/bitlista/
Last
bitopsaux
/
sgn-two-01