[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-rm-writer
⊦ writersOk(bq, pq, writers) ∧ oneMember(t, l, writers) ∧ noPending(t, bq, pq) → writersOk(bq, pq, writers(l := writers(l) -- t))
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: 7
Proof steps: 26
Used lemmas:
restrict-l-empty
,
writersOk
,
noPending
,
Used spec theorems:
FLITPSC-preds
/
filter-W-t-swap
Used simplifier rules:
set-basic
/
size-zero-01
set-basic
/
ne-01
set-union
/
del-e-02
set-basic
/
size-zero
set-union
/
Delete
FLITPSC-preds
/
onemember-eq
FLITPSC-preds
/
filter-w-empty