[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 noPending
⊦ noPending(t, p) ↔ (∀ l. p(l) | t = [])
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
add-pending-w-ok
,
add-pending-w-one-pending
,
no-pending-w-no-pending
,
relyp-no-pending-stable
,
writersok-add-pending
,
writersok-rm-writer
,
Used by units in proved state:
abs-FLIT-FLITPSCweak
,
FLITPSCweak-proofs
,
FLITPSCweak-preds
,
Proof exists?: No