[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-stronger
⊦ i ≠ ~1 ∧ i ≠ 0 → b2i(by1) / i = b2i(i2b(b2i(by1) / i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fits-law-div
,
fits-law-shr
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 20
Used lemmas:
byte-gr-127
,
bib-pos-high
,
byte-min
,
byte-ngr-01
,
bib-in-01
,
Used spec theorems:
int-div
/
le-abs-numerator
int-abs
/
forward-lels
int-abs
/
Abs-pos
int-abs
/
ls-rew-succ
int-div
/
Div-left
int-div
/
Div-right
int-div
/
div-eq-same-01
Used simplifier rules:
int-abs
/
neg-10
int-abs
/
negeq
int-abs
/
numadd-01
int-abs
/
num-between
int-abs
/
sub-le
int-basic2
/
add-less
int-abs
/
sub-ls
int-abs
/
forward-le-02
int-abs
/
numle-03
int-basic2
/
ls
int-abs
/
forward-le-04
int-abs
/
forward-lels
int-abs
/
numls-03
int-abs
/
neg-07
int-div
/
zero-05
int-basic2
/
add-zero
int-abs
/
sub-le-01
int-abs
/
neg-15
int-abs
/
negle-07
int-abs
/
abs-08
int-basic1
/
lst-01
int-div
/
zero-07
int-abs
/
abs-06
int-abs
/
forward-le
int-basic1
/
numlslsdel-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
zero-gels-04
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
neg-13
int-abs
/
minus-add
int-basic2
/
add-a
int-abs
/
sub-ls-01
int-basic2
/
add-c
int-abs
/
lels-04
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-basic1
/
numlsf
int-abs
/
lels-01
int-abs
/
forward-le-01
int-abs
/
negle-13