[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 precise-sep
⊦ precise(hP0) ∧ precise(hP1) → precise(hP0 * hP1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
iter-store
,
iter-set
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 30
Used lemmas:
precise-same
,
sep
,
precise
,
Used spec theorems:
heap
/
disj-com
heap
/
uni-ass
heap
/
disj-distr-uni
heap
/
uni-inj
Used simplifier rules:
heap
/
disj-distr-uni-com
heap
/
disj-com-rw