[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-law-mult-one
⊦ i2b(i * j) = i2b(b2i(i2b(i)) * j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
byte-law-mult
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 19
Proof steps: 29
Used lemmas:
byte-in
,
bib-upper
,
num-i2b-equal
,
byte
,
byte-mult
,
bib-in-01
,
bib-lower
,
byte-mult-256
,
Used spec theorems:
int-div
/
modex
Used simplifier rules:
int-mult
/
minus-left
int-abs
/
neg-15
int-mult
/
dist-sub-merge
int-basic1
/
numlslsdel-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
numlelsdel
int-abs
/
zero-gels-04
int-mult
/
zero-ge-add
int-mult
/
Mult-zero
int-div
/
mod-ngez
int-div
/
div-elim-pospos
int-abs
/
forward-le-01
int-abs
/
numleledel-01
int-abs
/
lels-01
int-basic1
/
lst
int-abs
/
forward-lels
int-abs
/
numlsledel-01
int-abs
/
numlelsdel-01
int-mult
/
dist-rmerge
int-mult
/
eq-neg
int-abs
/
forward-le-04
int-abs
/
numls-02
int-abs
/
neg-13
int-abs
/
abs-08
int-abs
/
lels-02
int-basic2
/
add-c
int-basic2
/
add-a
int-mult
/
commutativity
int-mult
/
associativity
int-abs
/
lels
int-abs
/
lels-03
int-div
/
div-elim-negpos
int-abs
/
forward-le-02
int-div
/
mod-ls-zero