[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 ebm-vol-inv-write
n < # avol ⊦ ebm-vol-inv(avol) → ( ebm-vol-inv(avol[n, aleb]) ↔ (avol[n].mapped? → # avol[n].data ≤ LEB_SIZE ∧ is-aligned(# avol[n].data, EB_PAGE_SIZE)) → aleb.mapped? → # aleb.data ≤ LEB_SIZE ∧ is-aligned(# aleb.data, EB_PAGE_SIZE))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
ebm-avol-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 17
Used lemmas:
ebm-vol-inv
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
array
/avolume/
Size-put
aleb
/
test-01
aleb
/
aleb-not-mapped
aleb
/
ex
array
/avolume/
Put-same
aleb
/
test-02
aleb
/
sel
array
/avolume/
Put-other