[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 cast-size-fits
⊦ n→i(# int2bits(j)) ≤ i → cast(i, j) = j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
cast-size-fits-01
,
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
cast-mod-in
,
Used spec theorems:
intnat
/
num-n2i-ls-04
int2bits
/
int2bits-lelen
int2bits
/
int2bits-lelen-03
int-abs
/
zero-gs
Used simplifier rules:
int-pot
/
two-lsz
int-basic1
/
ls-01
int-pot
/
pot2-pos-01
int-pot
/
pot2-pos
int-basic1
/
forward-pos
int-abs
/
lels-03
int-basic2
/
add-zero
int-abs
/
numsub
nat-basic2
/
c
nat-basic2
/
a
intnat
/
i2i-pos-01
intnat
/
n2i-add
int-abs
/
forward-lels
int-basic2
/
ls
int-abs
/
zero-gels-03
int-abs
/
mone-08
int-abs
/
minus-add
int-abs
/
sub-ls
int-pot
/
2pot-leone
int-abs
/
lels-04
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-pot
/
two-lez
int-abs
/
zero-gels-04
intnat
/
rax-04
int-abs
/
numle-02
int-abs
/
numleledel-01
int-abs
/
forward-le-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
elim-sub
int-abs
/
forward-le-05
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
intnat
/
nat2int-10
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-abs
/
lels-01
int-abs
/
negle-13
int-abs
/
lels