[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 3 from proof even-add (
previous step
)
∃ m0. 2 * m0 = m + n ⊦ (∃ m0. 2 * m0 = m) ∧ (∃ m0. 2 * m0 = n) ∨ ¬(∃ m0. 2 * m0 = m) ∧ ¬(∃ m0. 2 * m0 = n)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
2 * m0 = m + n ⊦ (∃ m0. 2 * m0 = m) ∧ (∃ m0. 2 * m0 = n), 2 * m1 ≠ m ∧ 2 * m2 ≠ n
Rule argument
Additional information