[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 in-valid-eraseqp-valid-lref
⊦ eq-entry(n, lref) ∈ q ∧ valid-eraseq(apebs, q) ∧ valid-peb(v, m, apebs[n]) → lref = v × m
Type: A user defined theorem
Validity: The proof is valid.
Features: forward,
Comment:
Used by:
Used by units in proved state:
ubi-crash-recovery-base
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 17
Used lemmas:
valid-eraseqp-rec
,
Used spec theorems:
Used simplifier rules:
list
/erasequeue-base/
in-empty
nat-basic
/
f
list
/erasequeue-base/
a
list
/erasequeue-base/
in-rec
list
/erasequeue-base/
c
erasequeueentry
/
elim
apeb
/
elim
valid-peb
/
valid-peb-vol
valid-peb
/
valid-peb-leb
valid-peb
/
valid-peb-unique
erasequeueentry
/
inj
nat-basic
/
lf-02
valid-peb
/
valid-peb-imp-valid-peb0