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