[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 refine-unmap
m < # avol, avol = abs(avols[v]), ebm-vol-inv(avol), v ∈ avols, v = default-volid, ebm-cons(avols) ⊦ ⟪ebm_vol_unmap#(m, v; avols)⟫ ⟨ebm_avol_unmap#(m; avol)⟩ (avol = abs(avols[v]))
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: 4
Proof steps: 20
Used lemmas:
Used spec theorems:
array
/avolume/
Extension
array
/avolume/
Put-other
ebm-vol-abs
/
abs-at
Used simplifier rules:
nat-basic
/
f
store
/abstract-volumes/
At-same
array
/avolume/
Size-put
array
/avolume/
cgetput
ebm-vol-abs
/
abs-size
array
/abstract-volume/
Put-same
ebm-vol-abs
/
abs-leb-unmapped
ebm-vol-abs
/
abs-at
array
/abstract-volume/
Put-other
array
/abstract-volume/
Size-put
nat
/
lels
nat
/
ls-le-simp