[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 nowrites-lastPersistedtrue
⊦ (h |W | l) | false = [] → (h.lastPersistedOrElse(l, true) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
abs-FLITPSCweak-PLIB
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 19
Used lemmas:
lastPersistedOrElse-recR
,
lastPersistedOrElse-recW
,
lastPersistedOrElse-base
,
restrict-vp
,
restrict-loc
,
restrict-W
,
Used spec theorems:
Used simplifier rules:
filter-count
/
filter-base
list
/
c
list
/
a
list
/
app-02
filter-count
/
filter-append
filter-count
/
filter-rec
filter-count
/
filter-one
RWevent
/
elim-W
RWevent
/
test-dotWque-W
list
/
e
RWevent
/
test-dotWque-R