[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 rangeeq-emptyleb-datasize
⊦ # buf = n0 + n1 ∧ range=(buf, n0, emptyleb, 0, n1) ∧ n ≤ # buf → (n0 < datasize(buf, n) ↔ false)
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: 4
Proof steps: 13
Used lemmas:
Used spec theorems:
datasize
/
datasize-rec
array-splice
/buffer/
range-eq-ext
Used simplifier rules:
nat
/
lez
datasize
/
datasize-base
nat-basic
/
zero-01
nat-basic
/
lf-01
nat
/
succ-01
nat-basic
/
succ
nat
/
lels-03
nat-basic
/
l-01
nat-basic
/
s-04
nat
/
ler
nat
/
lep-02
eraseblock
/
emptyleb-at
nat
/
ls-le-simp
nat
/
fle-01
nat
/
fle
nat
/
let
nat-basic
/
f
nat
/
lels
eraseblock
/
emptyleb-size
nat-basic
/
a
nat-basic
/
add-base
nat
/
ls-01
nat
/
le-ls-simp
nat
/
le-def
nat-basic
/
c
nat
/
elim-sub