[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-empbuf-h
⊦ m ≤ # buf + n → datasize(buf + mkempbuf(n), m) = datasize(buf, min(# buf, m))
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
datasize-empbuf
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 20
Used lemmas:
datasize-rec
,
datasize-base
,
datasize-append-lower-h
,
Used spec theorems:
min-max
/
min
array-splice
/buffer/
append-at2
Used simplifier rules:
nat
/
lez
min-max
/
min-0-right
nat
/
succ-01
nat-basic
/
succ
nat-basic
/
s-04
nat-basic
/
l-01
nat
/
fle-01
nat
/
lels
array-splice
/buffer/
emparray-len
nat
/
lep-02
nat
/
lels-03
min-max
/
min-add
min-max
/
min-comm
array-splice
/buffer/
append-at1
array-splice
/buffer/
append-a
nat-basic
/
eq-01
nat
/
lep
nat-basic
/
a
nat-basic
/
c
nat-basic
/
l
nat-basic
/
f
array-splice
/buffer/
emparray-at
nat
/
elim-sub