[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 writersOk-persist
⊦ writersOk(bq, pq, writers) ∧ pq(l) = fow ' + fowl → writersOk(bq, pq(l := fowl), writers)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
FLIT-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 16
Used lemmas:
writersOk
,
Used spec theorems:
FLITPSC-preds
/
filter-W-append
Used simplifier rules:
list
/
a
list
/
in-14
set-basic
/
size-zero-01
set-basic
/
ne-01
FLITPSC-preds
/
filter-t-append
list
/
app-02