[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-eraseq-stronger-notin-recs
# apebs = # wlar ⊦ valid-eraseq-stronger(apebs, q) ∧ valid-eraseq(wlar, q) ∧ valid-recs(apebs, wlar, recs) ∧ valid-wl(apebs, wlar) ∧ ¬ v × m ∈ recs → valid-sqns(v, m, apebs) = ∅
Type: A user defined theorem
Validity: The proof is valid.
Features: localforward,
Comment:
Used by:
prepost-scan-all
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 20
Used lemmas:
lf-used-info
,
Used spec theorems:
sqns
/
valid-sqns-nonempty-extract-max
ubi-base
/
valid-wl
ubi-crash-recovery-base
/
valid-recs
ubi-base
/
valid-eraseqw
ubi-crash-recovery-base
/
valid-eraseq-stronger-no-maxsqnum
Used simplifier rules:
sqns
/
valid-peb-sqns-nonempty
nat
/
le-ls-simp
nat
/
fle-01
nat-basic
/
lf-01
nat-basic
/
f
nat
/
lels
apeb
/
elim
valid-peb
/
valid-peb-vidhdr-empty
apeb
/
sel-04
valid-peb
/
valid-peb-bad
apeb
/
sel-08
wlentry
/
elim-02
wlstatus
/
disj-01
wlstatus
/
disj-02
lebadress
/
sel-02
lebadress
/
sel-01
valid-peb
/
valid-peb-vol
valid-peb
/
valid-peb-leb
wlstatus
/
disj-03
wlstatus
/
disj-05
wlstatus
/
disj-06
wlentry
/
sel-04
valid-peb
/
valid-peb-unique
apeb
/
sel-05