[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-law-absorption
0 < i, i ≤ i0 ⊦ cast(i, cast(i0, j)) = cast(i, j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
cast-cast
,
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 12
Used lemmas:
cast-def
,
Used spec theorems:
bitopsaux
/
lastn-fill-sgn
bitopsaux
/
fillsgn-longer
list-del
/bitlista/
lastn-lastn-01
bitopsaux
/
fill-lastn-03
Used simplifier rules:
int2bits
/
int2bits-not-empty
list-del
/bitlista/
lastn-length
intnat
/
labs-01
int-abs
/
abs-16
int-abs
/
lels-01
int-abs
/
lels-04
bitopsaux
/
fill-zero
list-del
/bitlista/
lastN-zero
bitopsaux
/
sgn-empty
bitopsaux
/
fillsgn-empty
list-del
/bitlista/
lastn-mklist-03
int2bits
/
bits2bits-def
list-del
/bitlista/
lastN-empty
intnat
/
abs-zero
int-abs
/
lels-03
int-abs
/
forward-le-05
int-abs
/
forward-le