[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 inv-write-data-wl
m = EB_PAGE_SIZE, mtd-cons(pebs), m0 < # pebs, ¬ pebs[m0].bad, pebs[m0].fill = 2 * EB_PAGE_SIZE, n ≤ LEB_SIZE, n ≤ # buf, is-aligned(n, EB_PAGE_SIZE) ⊦ ⟪ubi_io_write_data_wl#(m0, n, buf, m; pebs; err)⟫ mtd-cons(pebs)
Type: A proof obligation
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: 1
Proof steps: 8
Used lemmas:
write-data-wl
,
Used spec theorems:
mtd-asm
/
inv-write
Used simplifier rules:
nat-basic
/
f
peb
/
elim
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
eraseblock
/
page-size
align
/
is-aligned-multiplier
nat-mult
/
mult-a
nat-mult
/
mult-c
peb
/
sel-05
peb
/
sel-06
nat-mult
/
le-num
nat
/
ler
nat
/
le-def
eraseblock
/
pebsize-le-2page-size-lebsize