[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
,
Proof step 1 from proof odd-add (conclusion)
⊦ odd(i + j) ↔ odd(i) ∧ even(j) ∨ even(i) ∧ odd(j)
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ odd(i) ↔ ¬ even(i)
Proof step 3
:
⊦ ¬ even(i + j) ↔ odd(i) ∧ even(j) ∨ even(i) ∧ odd(j)
Rule argument
spec: inst: name: odd-even-rew seq: ⊦ odd(i) ↔ ¬ even(i) subst: [i] → [i + j] flags: rewrite, current
Additional information
Used terms: i + j