[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-unmap
⊦ bleb ≠ buffered(n) ∧ awbuf-inv(avol, bleb) → awbuf-inv(avol[n, unmapped], bleb)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
awbuf-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 10
Used lemmas:
awbuf-inv-def
,
Used spec theorems:
Used simplifier rules:
array
/avolume/
Size-put
bufleb
/
sel
aleb
/
test-01
array
/avolume/
Put-same
nat-basic
/
f
aleb
/
aleb-not-mapped
aleb
/
ex
array
/avolume/
Put-other
array
/avolume/
cngetput
bufleb
/
inj
bufleb
/
disj
aleb
/
disj
bufleb
/
elim