[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 ls-datasize-wear-level
⊦ ubi-io-peb-inv(mkpeb(aehdr, avhdr, buf, m, false)) → ¬ m < align↑(datasize(buf, LEB_SIZE), EB_PAGE_SIZE)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
inv-wl-worker
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 18
Used lemmas:
nat-sum-leq
,
ls-datasize-zero
,
Used spec theorems:
ubi-io-inv
/
peb-inv
array-splice
/buffer/
subarray-split-at
datasize
/
datasize-append-empty-h
Used simplifier rules:
align
/
alignup-le-is-aligned
eraseblock
/
page-size
apeb
/
sel-07
apeb
/
sel-05
apeb
/
sel-04
apeb
/
sel-08
apeb
/
sel-06
nat
/
elim-sub
nat
/
lels
nat-basic
/
add-base
array-copy
/buffer/
subarray-zero
nat
/
zero
array-splice
/buffer/
subarray-append-elim-left
min-max
/
min-le-left
min-max
/
min-comm
datasize
/
datasize-is-smaller-help
array-copy
/buffer/
subarray-elim
nat
/
ler
nat
/
ls-03
nat
/
le-ls-simp
nat
/
ge
array-splice
/buffer/
append-prefix-left
oelem
/nat-set/
irreflexivity
eraseblock
/
lebsize-neq-zero
nat-basic
/
lf-01
nat-basic
/
lf-02
nat
/
le-def
array-splice
/buffer/
append-a
array-copy
/buffer/
size-subarray
array-splice
/buffer/
append-len
nat-basic
/
f
nat-basic
/
eqs
nat-basic
/
c
nat-basic
/
a
array
/buffer/
Size-mkarray