[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 equal-minus-one
⊦ i ≠ 0 ∨ 0 ≤ j → (i ^ j = ~1 ↔ i = ~1 ∧ j ≠ 0 ∧ abs(j) % 2 = 1)
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: 25
Proof steps: 44
Used lemmas:
minus-one-odd
,
zero-02
,
one-01
,
Pot-pos
,
zero-01
,
Pot-neg
,
minus-one-even
,
Pot-zero
,
Used spec theorems:
int-abs
/
Abs-neg
int-div
/
num-neg-01
int-div
/
div-rec
int-div
/
div-zero-02
Used simplifier rules:
int-div
/
mod-two-06
int-div
/
mod2-neg-odd
int-abs
/
neg-10
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
neg-06
int-abs
/
neg-05
int-abs
/
lels-03
int-basic2
/
mone-02
int-abs
/
bet
int-abs
/
sub-eq-01
int-div
/
zero
int-abs
/
forward-le-04
int-abs
/
numleledel
int-div
/
one-04
int-abs
/
lels-01
int-abs
/
anti
int-abs
/
zero-gels-03
int-abs
/
neg-02
int-abs
/
neg-07
int-abs
/
numls-03
int-abs
/
mone-08
int-abs
/
numle-02
int-abs
/
negle-13
int-abs
/
sub-eq
int-abs
/
minus-sub
int-abs
/
neg-15
int-div
/
neg
int-abs
/
subneg
int-abs
/
lels
int-abs
/
lels-02
int-abs
/
zero-gels-01
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
eq-one-neg
int-abs
/
subsub
int-abs
/
sub-pred
int-abs
/
abs-neg
int-abs
/
Abs-pos
int-abs
/
neg-03
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-basic1
/
ls-01
int-abs
/
abs-08
int-basic1
/
lst-01
int-abs
/
abs-16
int-div
/
mod-neg-01
int-abs
/
negeq
int-abs
/
numadd-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
neg