[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 lf-valid-recs-notin-eraseq
⊦ v × m ∈ recs ∧ recs[v × m] = recovery-entry(n0, n1) ∧ valid-recs(apebs, wlar, recs) ∧ valid-eraseq(wlar, q) → ¬ n0 ∈ q
Type: A user defined theorem
Validity: The proof is valid.
Features: localforward,
Comment:
Used by:
inv-recover
,
prepost-init-vols-mappings
,
prepost-scan-all
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 13
Used lemmas:
Used spec theorems:
ubi-crash-recovery-base
/
valid-recs
Used simplifier rules:
oelem
/nat-set/
irreflexivity
nat-basic
/
f
lebadress
/
sel-01
lebadress
/
sel-02
apeb
/
elim
wlentry
/
elim-02
ubi-base
/
valid-eraseqp-in
wlentry
/
sel-04
wlstatus
/
disj-03
recovery-entry
/
sel-02