[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 lebs-write-last
n + m + 1 ≤ # avol, # buf = LEB_SIZE ⊦ lebs(avol[n + m, mapped(buf)], n, m + 1) = lebs(avol, n, m) + buf
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
persistence-io-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
lebs-write-above
,
lebs-rec
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
succ-01
nat
/
lep-02
nat
/
ler
nat-basic
/
a
nat-basic
/
c
nat
/
lels-03
array
/avolume/
Put-same
aleb
/
test-02
aleb
/
sel
array-splice
/buffer/
append-a
array-splice
/buffer/
append-eq-left
array-splice
/buffer/
append-prefix-left
array-splice
/buffer/
emparray-len
array
/avolume/
Size-put
nat
/
zero
nat
/
lels
nat
/
ls-le-simp