[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 pendingOk
⊦ pendingOk(p) ↔ (∀ l, t. #(p(l) |W | t) ≤ 1)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
add-pending-fo-ok
,
add-pending-w-ok
,
pending-ok-persist
,
pendingsok-del-pos
,
relyp-one-pending-stable
,
Used by units in proved state:
FLITPSCweak-proofs
,
FLITPSCweak-preds
,
Proof exists?: No