[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 init-state-inv
(gs.set = ∅ ∧ pcf = (λ tid. idle)) ∧ (∀ tid. tid = lsf(tid).tid) ⊦ SetInv(gs, lsf, pcf)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
SetInv-thm
,
other-SetLInv
,
rely-SetLInv
,
stable-SetLInv
,
step-SetLInv
,
Used by units in proved state:
Hashset-refines-Set-Theory-Instance
,
Set-Test-IOAut
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 9
Used lemmas:
Used spec theorems:
Set
/
SetInv
Set
/
SetGInv
Set
/
SetLInv
Used simplifier rules:
Set
/
disj-idle-retInsert
Set
/
disj-idle-retMember
Set
/
disj-idle-invMember
Set
/
disj-idle-invInsert