[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-length
⊦ 0 < i → # int2bits(cast(i, j)) ≤ i→n(i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
cast-max
,
cast-min
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
cast-def
,
Used spec theorems:
bitopsaux
/
sgn-nls
Used simplifier rules:
list-del
/bitlista/
lastn-length
intnat
/
labs-01
int-abs
/
abs-16
int-abs
/
lels-01
int-basic1
/
irref
bitopsaux
/
sgn-empty-01
int2bits
/
bits2bits-def
list-del
/bitlista/
lastN-empty
intnat
/
abs-zero
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
int-abs
/
forward-le-05
nat-basic1
/
f
nat
/
lels-01