[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 datsize-write-higher
⊦ m + n ≤ # buf ∧ n ≤ # buf0 ∧ ¬ m < datasize(buf) → ¬ datasize(copy(buf0, 0, buf, m, n)) < datasize(buf)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
datsize-write-higher-h
,
datasize
,
Used spec theorems:
Used simplifier rules:
nat
/
fle
nat-basic
/
f
nat
/
lels
array-copy
/buffer/
size-copy
nat
/
le-ls-simp
nat
/
ler