[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 fits-law-mul
⊦ b2i(by1) * b2i(by2) = s2i(i2s(b2i(by1) * b2i(by2)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 25
Used lemmas:
byte-nle-02
,
byte-min
,
byte-nge
,
byte-ls-256
,
byte-ngr
,
short-inrange
,
Used spec theorems:
int-mult
/
zero-ls-case
int-mult
/
pnls-posneg
int-mult
/
pnls-negpos
int-mult
/
pnle-pos
int-mult
/
zero-ge-01
int-mult
/
pnle-neg
Used simplifier rules:
int-basic2
/
add-c
int-basic2
/
add-a
int-div
/
nummult-le-01
int-abs
/
numle-03
int-mult
/
numleneg-03
int-mult
/
zero-ge-01
int-abs
/
lels-03
int-abs
/
zero-gels-01
int-abs
/
zero-gels-03
int-mult
/
zero-gr-01
int-mult
/
zero-gr-02
int-mult
/
associativity
int-mult
/
zero-ge
int-abs
/
lels-02
int-abs
/
forward-le
int-abs
/
forward-le-01
int-basic1
/
ls-01
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-basic1
/
numlsf
int-abs
/
lels
int-abs
/
lels-01
int-mult
/
commutativity