[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 lebs-write-above
n + m ≤ n0, n + m ≤ # avol ⊦ lebs(avol[n0, aleb], n, m) = lebs(avol, n, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
lebs-write-last
,
Used by units in proved state:
persistence-io-refine
,
persistence-io-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
lebs-write-below
,
lebs-rec
,
lebs-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
succ
nat
/
succ-01
nat-basic
/
a
nat-basic
/
c
nat
/
lels
nat
/
ls-le-simp
array-splice
/buffer/
append-eq-left
array
/avolume/
Size-put
array-splice
/buffer/
append-a
array-splice
/buffer/
append-eq-right
array
/avolume/
ngp-07
nat
/
lels-03