[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 counterzero
⊦ ctr(l) = 0 ∧ ctrok(ctr, ws) ∧ writersOk(p, ws) → p(l) |W = []
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 16
Used lemmas:
Used spec theorems:
FLITPSC-preds
/
writersOk
list
/
some-element
FLITPSC-preds
/
ctrok-def
FLITPSC-preds
/
filterwrites-def
FLITPSC-preds
/
filtertid-def
Used simplifier rules:
FLITPSC-preds
/
in-filter-W
FOW
/
test-dotWque-FO
FOW
/
test-dotWque-W
set-basic
/
In-empty
set-basic
/
Size-empty
set-basic
/
size-zero-02
set-basic
/
ne-01
filter-count
/
filter-in
FOW
/
sel-W-dottid