[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-add-eq-mkempbuf
⊦ subarray(buf, m, n0 + n1) = mkempbuf(n) ∧ m + n0 + n1 ≤ # buf → subarray(buf, m, n0) = mkempbuf(n0)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
valid-peb0-write-append
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
Used spec theorems:
array
/buffer/
Extension
Used simplifier rules:
nat-basic
/
f
array-splice
/buffer/
emparray-at
array-copy
/buffer/
subarray-at
array-splice
/buffer/
emparray-len
array-copy
/buffer/
size-subarray
nat
/
lels
nat
/
fle-01
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c