[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-append-h-new
⊦ m ≤ # buf0 + # buf1 → datasize(buf0 + buf1, m) = (m ≤ # buf0 ∨ datasize(buf1, m - # buf0) = 0 ⊃ datasize(buf0, min(m, # buf0));# buf0 + datasize(buf1, m - # buf0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
datasize-append
,
datasize-split-empty-h
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 13
Used lemmas:
datasize-base
,
datasize-rec
,
datasize-append-empty-h
,
datasize-append-lower-h
,
Used spec theorems:
Used simplifier rules:
min-max
/
min-le-left
nat
/
fle
min-max
/
min-ls-right
nat
/
elim-sub
nat-basic
/
l-01
min-max
/
min-add
nat
/
eq-01
nat
/
lep
nat
/
ge
nat
/
lep-02
array-splice
/buffer/
append-atp2
nat
/
le-ls-simp
nat
/
succ-01
nat
/
lels
nat-basic
/
succ
nat-basic
/
oz
nat-basic
/
eq-01
nat
/
lels-03
nat-basic
/
f
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
nat
/
le-def
nat-basic
/
ref
array-splice
/buffer/
append-a
nat-basic
/
lf-02