[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
(∃ n. n > 0 ∧ gs.ar = mkar(n, ⊥) ∧ pcf = (λ tid. idle)) ∧ (∀ tid. tid = lsf(tid).tid) ⊦ HashsetInv(gs, lsf, pcf)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
HashsetInv-thm
,
other-HashsetLInv
,
rely-HashsetLInv
,
stable-HashsetLInv
,
step-HashsetLInv
,
Used by units in proved state:
Hashset-refines-Set-Theory-Instance
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 10
Used lemmas:
Used spec theorems:
Hashset
/
HashsetInv
Hashset
/
HashsetGInv
hashset-preds
/
htok-def
Hashset
/
HashsetLInv
Used simplifier rules:
hashset-preds
/
size-mkar
nat-basic
/
zero
nat
/
gr-def
nat-basic
/
f
hashset-preds
/
get-mkar
Hashset
/
disj-I1-idle
Hashset
/
disj-M1-idle
Hashset
/
disj-I2-idle
Hashset
/
disj-M2-idle
Hashset
/
disj-I3-idle
Hashset
/
disj-M3-idle
Hashset
/
disj-I4-idle
Hashset
/
disj-I5-idle
Hashset
/
disj-I6-idle
Hashset
/
disj-I7-idle
Hashset
/
disj-I8-idle
Hashset
/
disj-I10-idle
Hashset
/
disj-I11-idle
Hashset
/
disj-I12-idle
Hashset
/
disj-I13-idle
Hashset
/
disj-I14-idle
Hashset
/
disj-I16-idle
Hashset
/
disj-I17-idle
Hashset
/
disj-I18-idle
Hashset
/
disj-I19-idle
Hashset
/
disj-I20-idle
Hashset
/
disj-I9-idle
Hashset
/
disj-I15-idle
Hashset
/
disj-I21-idle
Hashset
/
disj-M18-idle
Hashset
/
disj-M11-idle
Hashset
/
disj-M12-idle
Hashset
/
disj-M4-idle
Hashset
/
disj-M5-idle
Hashset
/
disj-M6-idle
Hashset
/
disj-M7-idle
Hashset
/
disj-M8-idle
Hashset
/
disj-M9-idle
Hashset
/
disj-M10-idle
Hashset
/
disj-M13-idle
Hashset
/
disj-M14-idle
Hashset
/
disj-M15-idle
Hashset
/
disj-M16-idle
Hashset
/
disj-M17-idle