[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 2 from proof plus (
previous step
)
2 * m = 2 * m0 + n ⊦ ∃ m0. 2 * m0 = n
User applied rule exists right
And obtained the following new goals
Proof step 3
:
2 * m = 2 * m0 + n ⊦ 2 * (m - m0) = n
Rule argument
pos: right 1 terms: m - m0 abort: F discard: T computed: F
Additional information
Used terms: m - m0