[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-add
⊦ 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: 6
Proof steps: 9
Used lemmas:
byte-le
,
byte-nge
,
byte-nls
,
byte-nls-01
,
short-inrange
,
Used spec theorems:
int-abs
/
estimate-add1-ls-left
int-abs
/
estimate-add2-le-right
Used simplifier rules:
int-abs
/
lels-04
int-abs
/
numle-02
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
lels-03
int-abs
/
minus-add
int-abs
/
sub-ls
int-basic1
/
numlsf
int-abs
/
lels
int-basic2
/
add-a
int-abs
/
lels-01
int-basic2
/
add-c