[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 buf-ro-rw-mode-write-lpt-other
⊦ bleb ≠ buffered(n) → (buf-ro-rw-mode(boolvar, bleb, lpt[n, lp], avol) ↔ buf-ro-rw-mode(boolvar, bleb, lpt, avol))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 9
Used lemmas:
buf-ro-rw-mode
,
Used spec theorems:
Used simplifier rules:
array
/lp-array/
Size-put
lprops
/
elim
array
/lp-array/
Put-other
lprops
/
inj
array
/lp-array/
cgetput
nat
/
le-ls-simp
nat
/
lels
nat-basic
/
f
bufleb
/
elim-is-buf-ant
bufleb
/
sel
bufleb
/
inj