[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
wbuf-cons(bleb, wbuf, avol, rofs), ebm-vol-inv(avol), # lpt = # avol, m < # avol, buffered(m) ≠ bleb ⊦ ⟪wbuf_remap#(m, bleb, adr, m0, plog, lpt, ns; avol; err)⟫ (wbuf-cons(bleb, wbuf, avol, rofs) ∧ 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: 1
Proof steps: 24
Used lemmas:
remap
,
Used spec theorems:
apersistence-io-asm
/
inv-remap
Used simplifier rules:
nat-basic
/
f
wbuf-base
/
wbuf-cons-nobuf
wbuf
/
elim
nat
/
lels
nat
/
ls-le-simp
error-class
/
esuccess
bufleb
/
inj
bufleb
/
disj
array
/avolume/
Put-other
bufleb
/
elim
aleb
/
test-02
aleb
/
ex
nat-basic
/
lf-01
wbuf-base
/
wbuf-cons-mapped
error-class
/
not-esuccess
array
/avolume/
Size-put