[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 byte-mult-pos
⊦ 0 ≤ i ∧ 0 ≤ j → i2b(i * 256 + j) = i2b(j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
byte-mult-256
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 4
Used lemmas:
byte-equal
,
bib-pos-low
,
bib-pos-high
,
i2b-equal
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels
int-abs
/
numleledel
int-div
/
mod-mult-pos-01
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-eq
int-mult
/
zero-ge-add-01
int-abs
/
Sub-def
int-abs
/
forward-le-01