[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
m + n < # ar ⊦ subarray(ar, m, n + 1) = subarray(ar, m, n) + ar[m + n]
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
rev-subarray-last
,
subarray-inc-offset0
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
Used spec theorems:
array
/
Extension
array-copy
/
at-subarray
list-del
/list-as-arrayinstance/
get-butlast
Used simplifier rules:
list-data
/list-as-arrayinstance/
l
nat-basic
/
f
list
/list-as-arrayinstance/
Last
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
array-copy
/
size-subarray
nat-basic
/
eq-01
list
/list-as-arrayinstance/
a
list
/list-as-arrayinstance/
len-02
list
/list-as-arrayinstance/
len
nat
/
succ-01
nat
/
le-ls-simp
array-copy
/
subarray-at
list-del
/list-as-arrayinstance/
get-append-grt
nat
/
anti
nat
/
zero
list-del
/list-as-arrayinstance/
one-03