[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 9 from proof odd-mult (
previous step
)
¬(∃ m0. 2 * m0 = m) ∧ ¬(∃ m0. 2 * m0 = n) ⊦ ¬(∃ m0. 2 * m0 = m * n)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 10
:
2 * m0 = m * n ⊦ ∃ m0. 2 * m0 = n, ∃ m0. 2 * m0 = m
Rule argument
Additional information