[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 18 from proof cong-equiv (
previous step
)
n1 + m1 * m = m0 * m, n2 < m ⊦ n1 = 0, ∃ n0. m * n0 = n1
User applied rule exists right
And obtained the following new goals
Proof step 19
:
n1 + m1 * m = m0 * m, n2 < m ⊦ n1 = 0, m * (m0 - m1) = n1
Rule argument
pos: right 2 terms: m0 - m1 abort: F discard: T computed: F
Additional information
Used terms: m0 - m1