[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 1 from proof subarray-append-shift-right (conclusion)
⊦ # ar0 ≤ m ∧ m ≤ # ar0 + # ar1 → subarray(ar0 + ar1, 0, m) = ar0 + subarray(ar1, 0, m - # ar0)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
# ar0 ≤ m, m ≤ # ar0 + # ar1 ⊦ subarray(ar0 + ar1, 0, m) = ar0 + subarray(ar1, 0, m - # ar0)
Rule argument
Additional information