[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 bint-is-cast
⊦ bi2i(i2bi(i)) = cast(32, i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bint-is-cast-01
,
bint-num-in
,
bint-unsigned-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 21
Used lemmas:
inbint
,
biibi-in
,
int2bint-out
,
Used spec theorems:
intops
/
cast-mod-in
intops
/
bits2int-is-cast
int2bits
/
int2bits-lelen
int2bits
/
int2bits-lelen-03
intops
/
cast-nls
intops
/
cast-nls-01
Used simplifier rules:
int-basic1
/
numlslsdel-01
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
nat-basic1
/
f
int-basic1
/
numlslsdel
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
nat
/
lels
int-abs
/
numleledel-01
int-abs
/
numlsledel
int-abs
/
forward-lele