[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
,
Theorem subarray-inc-offset0
m + n ≤ # ar, n ≠ 0 ⊦ subarray(ar, m, n) = ar[m] + subarray(ar, m + 1, n - 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
array-le-one-diffrent-position
,
next-proper-permutation
,
ordered-step-down
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
Used spec theorems:
array
/natarray/
Extension
list-del
/natarray-oarray-sort/
get-append-less
array-copy
/natarray/
at-subarray
Used simplifier rules:
list
/natarray-oarray-sort/
c
nat
/
elim-pred-c
list-data
/natarray-oarray-sort/
l
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
oz
nat
/
lels
nat-basic
/
s-04
array-copy
/natarray/
size-subarray
nat-basic
/
eq-01
list
/natarray-oarray-sort/
a
nat-basic
/
succ
list
/natarray-oarray-sort/
len-05
nat-basic
/
one-01
list
/natarray-oarray-sort/
len-02
list-del
/natarray-oarray-sort/
get-append-grt
nat
/
le-ls-simp
nat
/
le-def
nat
/
ls-01
nat
/
lez
list-del
/natarray-oarray-sort/
one-03
nat-basic
/
add-base
nat-basic
/
zero