[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 datasize-split-empty-h
⊦ m ≤ # buf ∧ m = # buf0 ∧ m0 ≤ # buf1 ∧ buf = buf0 + buf1 ∧ buf1 = mkempbuf(# buf1) → datasize(buf, # buf0 + m0) = datasize(buf0, # buf0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
datasize-split-empty
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 11
Used lemmas:
datasize-zero-h
,
datasize-append-lower-h
,
datasize-append-h-new
,
Used spec theorems:
array
/buffer/
Extension
Used simplifier rules:
nat
/
lep
array-splice
/buffer/
append-len
nat
/
le-def
nat
/
le-ls-simp
array-splice
/buffer/
append-a
nat
/
lep-02
min-max
/
min-add
nat
/
eq-01
nat-basic
/
c
nat-basic
/
a
nat
/
le-add
nat
/
fle
nat-basic
/
f
array-splice
/buffer/
emparray-at
array-splice
/buffer/
emparray-len