[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-def
⊦ odd(i) ↔ (∃ j. i = j + j + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
not-odd-ex
,
odd-rec
,
Used by units in proved state:
int-pot
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
Odd
,
Used spec theorems:
int-div
/
even-not-ex
Used simplifier rules:
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
add-mult-two
int-abs
/
numadd
int-basic2
/
add-zero-rev
int-mult
/
eq-pos
int-mult
/
associativity
int-mult
/
commutativity
int-div
/
even-not