[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-mod
b2i(by1) ≠ 0 ⊦ i % b2i(by1) = b2i(i2b(i % b2i(by1)))
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: 12
Used lemmas:
byte-ngr-01
,
byte-nls-01
,
byte-ngr
,
byte-nls
,
num-ibbi
,
Used spec theorems:
int-div
/
mod-nls-04
int-abs
/
Abs-neg
int-div
/
mod-nls-06
Used simplifier rules:
int-div
/
mod-zero-06
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
Abs-pos
int-basic1
/
lst-01
int-abs
/
neg-06
int-abs
/
neg-07
int-abs
/
numls-03
int-basic1
/
numlslsdel-01
int-abs
/
abs-06
int-abs
/
sub-le
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
minus-add
int-abs
/
negle-07
int-abs
/
forward-lels
int-basic1
/
numlsf
int-basic1
/
lst
int-div
/
mod-grz-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-abs
/
lels-01