[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-div
⊦ i ≠ 0 → b2i(by1) / i = s2i(i2s(b2i(by1) / i))
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: 11
Used lemmas:
byte-nls-01
,
byte-ngr
,
inbyte-bib
,
short-max-10
,
inbyte
,
bib-in
,
num-issi
,
fits-law-div-stronger
,
Used spec theorems:
Used simplifier rules:
int-abs
/
neg-03
int-abs
/
negle-07
int-abs
/
minus-add
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-le
int-abs
/
negle-13
int-abs
/
numle-02
int-abs
/
negeq
int-div
/
div-mone-01
int-abs
/
forward-lels
int-abs
/
forward-lele
int-basic1
/
numlsf
int-abs
/
forward-lsle
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
lels-01