[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-append-mkempbuf-from
n2 ≤ n1 + # buf ⊦ subarray(mkempbuf(n0 + n1) + buf, n0, n2) = subarray(mkempbuf(n1) + buf, 0, n2)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
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: 7
Used lemmas:
Used spec theorems:
array
/buffer/
Extension
array-splice
/buffer/
append-at
array-splice
/buffer/
emparray-at
Used simplifier rules:
nat
/
fle
nat-basic
/
f
nat-basic
/
add-base
array-copy
/buffer/
subarray-at
array-copy
/buffer/
size-subarray
nat
/
cancel-01
nat
/
ls-le-simp
array-splice
/buffer/
emparray-at
array-splice
/buffer/
emparray-len
nat-basic
/
l
nat
/
lels
nat-basic
/
a
nat-basic
/
c
nat
/
le-ls-simp