[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 odd-rec
⊦ 1 < i → (odd(i) ↔ odd(i - 2))
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: 11
Used lemmas:
odd-def
,
Used spec theorems:
int-abs
/
numadd-01
Used simplifier rules:
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
elim-sub
int-abs
/
forward-le-01
int-abs
/
numlsledel-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
minus-add
int-abs
/
numadd
int-mult
/
add-mult-two
int-abs
/
sub-eq
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
succ-rmerge
int-mult
/
associativity
int-mult
/
commutativity
int-mult
/
eq-pos