[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 modex-odd-neg
⊦ i % 2 = ~1 ↔ (∃ j. i = 2 * j - 1 ∧ j ≤ 0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
modex-odd-neg-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
div-elim-negpos
,
div-elim-pospos
,
Used spec theorems:
int-abs
/
Abs-neg
Used simplifier rules:
int-abs
/
sub-eq
int-abs
/
lels-01
int-abs
/
forward-le-02
int-basic2
/
add-zero
int-abs
/
neg-06
int-abs
/
neg-13
int-abs
/
numls-02
int-basic1
/
minus-one
int-abs
/
Abs-pos
int-abs
/
numlsledel
int-abs
/
lels
int-abs
/
anti
int-mult
/
two-oddeq
int-abs
/
forward-lele
int-abs
/
forward-le-04
int-abs
/
forward-le-05
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
int-mult
/
zero-ge-add
int-abs
/
lstwo
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
mod-neq
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
succ-rmerge
int-mult
/
eq-pos
int-abs
/
numle-03
int-abs
/
mone-05
int-abs
/
lels-04