[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-subarray-h
⊦ m0 + m1 = # buf ∧ m ≤ m1 → datasize(subarray(buf, m0, m1), m) = (datasize(buf, m0 + m) ≤ m0 ⊃ 0;datasize(buf, m0 + m) - m0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
datasize-subarray
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 12
Used lemmas:
datasize-rec
,
datasize-is-smaller-help
,
datasize-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
add-base
nat
/
lez
array-copy
/buffer/
subarray-at
nat-basic
/
succ
nat
/
succ-01
nat-basic
/
l-02
nat-basic
/
eq-01
nat
/
le-def
nat
/
elim-sub
nat-basic
/
l-01
nat-basic
/
lf-01
nat-basic
/
f
nat
/
lels-03
nat
/
le-add
nat-basic
/
a
nat-basic
/
c
nat
/
eq-01