[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-offset
m + n < # ar ⊦ subarray(ar, m + 1, n) = (subarray(ar, m, n) + ar[m + n]).rest
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
Used spec theorems:
array
/natarray/
Extension
list-del
/natarray-oarray-sort/
get-append-less
Used simplifier rules:
list-data
/natarray-oarray-sort/
l
nat-basic
/
f
list
/natarray-oarray-sort/
Last
list
/natarray-oarray-sort/
app-02
list
/natarray-oarray-sort/
e
list
/natarray-oarray-sort/
a
list-data
/natarray-oarray-sort/
elim-list-c
list
/natarray-oarray-sort/
in-17
list
/natarray-oarray-sort/
in-append
list
/natarray-oarray-sort/
in-rec
list
/natarray-oarray-sort/
in-14
list
/natarray-oarray-sort/
in-15
list
/natarray-oarray-sort/
e-02
list
/natarray-oarray-sort/
c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/natarray-oarray-sort/
len-02
array-copy
/natarray/
size-subarray
list
/natarray-oarray-sort/
len
nat-basic
/
eq-01
nat-basic
/
succ
list
/natarray-oarray-sort/
len-05
array-copy
/natarray/
subarray-at
list-del
/natarray-oarray-sort/
get-succ
list-del
/natarray-oarray-sort/
get-append-grt
nat
/
lels
nat
/
les
nat
/
eqle-one
nat-basic
/
lf-01
nat
/
cancel-01
nat
/
zero
list-del
/natarray-oarray-sort/
one-03