[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 array-split-into-subarrays
m < # ar ⊦ ar = subarray(ar, 0, m) + subarray(ar, m, # ar - m)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
array-le-kill-prefix
,
array-le-same-prepart
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 9
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
nat
/
lels-03
nat
/
elim-sub
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-01
nat-basic
/
lf-01
list
/natarray-oarray-sort/
a
array-copy
/natarray/
size-subarray
list
/natarray-oarray-sort/
len
array-copy
/natarray/
subarray-at
nat-basic
/
add-base
nat
/
fle-01
nat
/
lels
list-del
/natarray-oarray-sort/
get-append-grt
nat
/
lep
nat-basic
/
l