[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-remap
ebm-vol-inv(avol), # lpt = # avol, m < # avol ⊦ ⟪apersistence_io_remap#(m, adr, m0, plog, lpt, ns; avol; err)⟫ (ebm-vol-inv(avol) ∧ # lpt = # avol)
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: 0
Proof steps: 14
Used lemmas:
remap
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
error-class
/
esuccess
aleb
/
test-02
aleb
/
sel
array
/buffer/
Size-mkarray
nat
/
lez
eraseblock
/
page-size
align
/
is-aligned-zero
error-class
/
not-esuccess
array
/avolume/
Size-put
nat
/
lels
nat
/
ls-le-simp
ebm-vol-inv
/
ebm-vol-inv-write
aleb
/
test-01
nat-basic
/
lf-01
error
/
disj-91
error-class
/
ecommit