[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 n2i-sub (
previous step
)
n ≤ m ⊦ n→i(m - n) = n→i(m) - n→i(n)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
n ≤ m ⊦ n→i(m) = n→i(m - n) + n→i(n)
Rule argument
Additional information
Used simplifier rules: ⊦ i - j = i0 ↔ i = i0 + j; (s)