[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 divmod2-2pot-neg
⊦ j < 0 ∧ 1 < i → ((j % 2 ^ i - 1) / 2) % 2 = ((j - 1) / 2) % 2
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: 9
Proof steps: 14
Used lemmas:
div2-2pot-04
,
mod-2pot
,
pot2-pos
,
Used spec theorems:
int-abs
/
sub-add-01
int-basic2
/
add-c
int-div
/
div-add-neg
int-div
/
mod-add-neg
Used simplifier rules:
int-basic1
/
forward-pos
int-abs
/
lels-01
int-basic1
/
ls-01
int-div
/
div-elim-negpos
int-abs
/
forward-lsle
int-abs
/
forward-lele
int-abs
/
forward-le-04
int-abs
/
forward-lels
int-abs
/
forward-le-01
int-mult
/
Mult-zero
int-abs
/
leone
int-abs
/
sub-le-01
int-abs
/
mone-05
int-abs
/
numle-03
int-abs
/
numsub
int-abs
/
sub-add-01
int-div
/
div-ls-zero
int-mult
/
zero-ls-03
int-abs
/
zero-gels-04
int-abs
/
lsone
int-abs
/
sub-ls
int-mult
/
zero-ls-01
int-basic2
/
add-zero
int-abs
/
forward-le-02
int-abs
/
forward-le-05
int-abs
/
neg-13
int-abs
/
abs-08
int-abs
/
lels-02
int-abs
/
zero-gels-01
int-abs
/
sub-ls-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
int-abs
/
bet
int-abs
/
sub-eq-01
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
numls-02
int-basic1
/
minus-one