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