[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-two-pred-01
⊦ i < 0 → (2 * i - 1) % 2 = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
mod-two-pred-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
nummult-ls
,
div-elim-negpos
,
Used spec theorems:
int-abs
/
Abs-neg
Used simplifier rules:
int-abs
/
forward-le-02
int-abs
/
forward-le-04
int-abs
/
zero-gels-03
int-abs
/
lsone
int-abs
/
sub-ls
int-abs
/
sub-eq
int-abs
/
neg-06
int-abs
/
neg-13
int-abs
/
numls-02
int-basic1
/
minus-one
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
Abs-pos
int-abs
/
numlsledel
int-abs
/
lels
int-abs
/
anti
int-basic1
/
lf-02
int-mult
/
odd-even
int-mult
/
associativity
int-mult
/
commutativity