[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 subarray-append-elim-left0 (
previous step
)
n = # ar0, m ≤ # ar1 ⊦ subarray(ar0 + ar1, n, m) = subarray(ar1, 0, m)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
m ≤ # ar1 ⊦ subarray(ar0 + ar1, # ar0, m) = subarray(ar1, 0, m)
Rule argument
Additional information