[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 ex-two (conclusion)
⊦ (∃ n. m = 2 * n) ∨ (∃ n. m = 2 * n + 1)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
⊦ ∃ n. m = 2 * n, ∃ n. m = 2 * n + 1
Rule argument
Additional information