[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 intshiftleft-is-mult
⊦ 0 ≤ j ∧ j < 32 → i i<< j = i * 2 ^ j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bor-shift-plus
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 15
Used lemmas:
band-011x-pos
,
intshiftleft
,
Used spec theorems:
int-div
/
mod-zero-03
int2bits
/
bits2int-split
int2bits
/
bits2int-split-01
int2bits
/
bits2uint-ones
int2bits
/
int2bits-pos
Used simplifier rules:
int2bits
/
uint2uint-pos
int-abs
/
lels
int-basic2
/
add-zero
intnat
/
i2i-pos-01
int2bits
/
bits2uint-zeros-04
bitlista
/
inmklist-01
int-abs
/
Sub-def
list-last
/bitlista/
mk-empty
int-basic2
/
add-c
int-basic2
/
add-a
int-mult
/
eq-dist
int-abs
/
sub-eq
bitopsaux
/
inv-mklist
int-abs
/
neg-02
int-mult
/
minus-left
intnat
/
i2i-pos
int-abs
/
subsub
int2bits
/
int2uint-inv-01
int2bits
/
int2bits-first-01
int-abs
/
forward-le-02
int-basic1
/
forward-pos
int-abs
/
lels-02
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
one
int2bits
/
int2int-inj
list
/bitlista/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
int2bits
/
int2bits-first-02
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
intnat
/
abs-zero
list-last
/bitlista/
mk-len
int-abs
/
numlelsdel
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
forward-le-05