[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 abs-data-at
m < LEB_SIZE ⊦ n < # pebs ∧ apebs[n] = mkpeb(aehdr, avhdr, buf, m0, false) ∧ pebs[n] = mkpeb(buf0, m1, false) ∧ abs(pebs, apebs) ∧ mtd-cons(pebs) → buf0[m + 2 * EB_PAGE_SIZE] = buf[m]
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
ubi-io-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
abs-vidhdr
,
abs-echdr
,
abs-peb
,
abs
,
Used spec theorems:
Used simplifier rules:
eraseblock
/
lebsize-neq-zero
nat-basic
/
lf-01
nat-basic
/
f
peb
/
sel-05
apeb
/
sel-08
peb
/
sel-06
apeb
/
sel-04
apeb
/
sel-05
apeb
/
sel-07
peb
/
sel-07
aecheader
/
disj-01
avidheader
/
disj-01
apeb
/
sel-06
nat
/
lels
nat
/
ls-le-simp
mtd-base
/
mtd-cons-peb-size
array-copy
/buffer/
subarray-at
nat-basic
/
c
array-copy
/buffer/
subarray-elim