[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 int2bytes-index-rightshift-01
⊦ 0 ≤ n ∧ n < # int2bytes(i) → int2bytes(i)[n] = i2b(i >> 8 * (n→i(# int2bytes(i)) - n→i(n) + 1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bytes-index-rightshift-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
int2bytes-index-rightshift
,
int2bytes-empty
,
Used spec theorems:
Used simplifier rules:
list-data
/bytelist/
l
nat-basic1
/
f
nat
/
lez
int-basic2
/
add-c
int-mult
/
commutativity
intnat
/
nat2int
intnat
/
nat2int-04
nat
/
lels
nat
/
ls-le-simp
intnat
/
n2n