[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 ls-datasize-zero
n ≤ # buf ⊦ datasize(buf, n) = 0 ↔ (∃ buf0. buf = mkempbuf(n) + buf0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
ls-datasize-empbuf-append-lower
,
ls-datasize-wear-level
,
prepost-atomic-leb-change
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 16
Used lemmas:
ls-array-append-length0
,
Used spec theorems:
datasize
/
datasize-zero-h
array
/buffer/
Extension
array-splice
/buffer/
append-at2
array-splice
/buffer/
append-at1
Used simplifier rules:
nat-basic
/
lf-01
nat-basic
/
l-01
nat
/
fle-01
array-copy
/buffer/
size-subarray
nat-basic
/
l
array-copy
/buffer/
subarray-at
nat
/
elim-sub
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
lep
array-splice
/buffer/
append-len
array-splice
/buffer/
emparray-at
array-splice
/buffer/
emparray-len
nat
/
lels
nat
/
ls-le-simp
array-splice
/buffer/
append-a