[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 mod-twoodd-03
i < 0, 0 < j ⊦ (2 * i + 1) % (2 * j) = (i + 1) % 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: 4
Proof steps: 5
Used lemmas:
mod-twoodd
,
mod-neg-01
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
succ-01
int-abs
/
forward-le-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-le-05
int-mult
/
eq-dist
int-basic1
/
lf-02
int-abs
/
subsub
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
minus-left
int-abs
/
neg-15
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
minus-sub
int-abs
/
Sub-def
int-mult
/
eq-pos
int-abs
/
sub-eq
int-mult
/
zero-neq-01
int-abs
/
negle-07
int-abs
/
numle-03
int-abs
/
mone-05
int-abs
/
zero-gels-01