[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-further
⊦ n0 ≤ # buf ∧ n0 ≤ n1 → (datasize(buf, n0) = datasize(buf, n1) ↔ (∀ n. n0 ≤ n ∧ n < n1 → buf[n] = empty))
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: 14
Proof steps: 63
Used lemmas:
datasize-rec
,
datasize-base
,
Used spec theorems:
Used simplifier rules:
nat
/
lez
nat-basic1
/
zero-01
nat-basic1
/
lf-02
nat-basic1
/
ls-02
nat
/
anti
nat
/
eqle-one
nat
/
fle
nat-basic1
/
lf-01
nat
/
lep-02
nat
/
succ-01
nat-basic1
/
ref-1
nat
/
les
nat
/
fle-01
nat-basic2
/
s
nat-basic2
/
oz
nat
/
lez-01
nat-basic1
/
zero
nat
/
let
nat
/
lels
nat
/
lels-03
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
lf
nat
/
ler
nat
/
le-ls-simp
nat-basic1
/
f
nat
/
lels-02
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01