[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 sep
⊦ (hP0 * hP1)[rs, f] ↔ (∃ rs0, rs1. rs0 ∪ rs1 = rs ∧ rs0 ∩ rs1 = ∅ ∧ hP0[rs0, f] ∧ hP1[rs1, f])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
embed-aux
,
heap-aux
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 30
Used lemmas:
uni
,
at-unir
,
at-unil
,
at-mk
,
in-mk
,
in-uni
,
disj
,
mk-exists
,
apply
,
Used spec theorems:
heap-sep
/
sep
heap
/
ext
set-basic
/refset/
Extension
heap-sep
/
split-union
Used simplifier rules:
set-union
/refset/
int-c
set-union
/refset/
int-a
set-union
/refset/
unin-01
set-union
/refset/
unin
set-union
/refset/
una
set-union
/refset/
unc
set-union
/refset/
int-empty-02