[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 minus-odd
⊦ odd(j) ∧ 0 < j → ~ i ^ j = ~(i ^ j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
minus-square
,
Pot-pos
,
Used spec theorems:
int-min
/
odd-def
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
negeq
int-abs
/
forward-le-01
int-mult
/
add-mult-two
int-basic2
/
add-zero-rev
int-abs
/
sub-eq
int-abs
/
neg-15
int-mult
/
minus-left
int-basic2
/
pred
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
commutativity
int-abs
/
numls-02
int-abs
/
mone-06
int-mult
/
zero-ge
int-abs
/
zero-gels-04
int-mult
/
associativity