[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-shift-snd-l
5 ≤ i ⊦ j0 i<< j = j0 i<< cast(i, j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
band-commutativity
,
cast-band
,
intshiftleft
,
Used spec theorems:
int2bits
/
int2bits-pos
Used simplifier rules:
int2bits
/
uint2bits-pos-num
int2bits
/
uint2bits-one
list
/bitlista/
Two
list
/bitlista/
Last
list
/bitlista/
len
list
/bitlista/
len-02
list
/bitlista/
a
nat
/
add-num-04
nat-basic1
/
lf-02
nat
/
l-num-04
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat-basic1
/
lf-01
nat
/
elim-pred-c
nat-basic1
/
f
nat
/
ls
nat
/
lels-01
nat-basic1
/
one-01
list-data
/bitlista/
l
int2bits
/
int2bits-not-empty
nat-basic1
/
one
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-lels
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
lels-01
nat
/
pred-03
int-abs
/
forward-le
int-abs
/
forward-le-01