[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-add
⊦ odd(m + n) ↔ odd(m) ∧ even(n) ∨ even(m) ∧ odd(n)
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: 14
Proof steps: 35
Used lemmas:
meven-02
,
oe-02
,
oe
,
pot2-even-02
,
div2-elim
,
Even
,
Odd
,
Used spec theorems:
nat-mult
/
dist
Used simplifier rules:
nat-mult
/
two-succ-05
nat-mult
/
two-02
nat-mult
/
rsucc-02
nat-mult
/
coef-04
nat
/
lels-01
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-mult
/
two-succ-06
nat
/
elim-sub
nat
/
lep
nat-basic2
/
eq-01
nat-basic2
/
a
nat-basic2
/
c