[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 pre-idle
⊦ pre(gs, ls, idle, a) ↔ (∃ e. a = AInvInsert(ls.tid, e) ∧ e ≠ ⊥) ∨ (∃ e. a = AInvMember(ls.tid, e) ∧ e ≠ ⊥)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Hashset-refines-Set
,
Set-proofs
,
Set-Test-IOAut
,
Proof exists?: No