[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-h
⊦ m + n ≤ # buf ∧ n ≤ # buf0 ∧ ¬ m < datasize(buf) ∧ m0 ≤ # buf → (datasize(copy(buf0, 0, buf, m, n), m0) < datasize(buf, m0) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
datsize-write-higher
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 21
Used lemmas:
datasize-ls-add
,
datasize-at
,
datasize-is-smaller-help
,
datasize-rec
,
datasize-base
,
datasize
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
add-base
array-copy
/buffer/
at-copy
nat
/
succ-01
nat-basic2
/
succ
nat-basic2
/
l-01
nat
/
let
nat
/
fle-01
nat
/
lels-01
nat
/
lels
nat
/
elim-sub
nat-basic1
/
f
nat
/
fle
nat
/
lep
nat-basic2
/
s
nat-basic2
/
oz
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
l
nat
/
lels-03