[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
⊦ (hR0 * hR1)[rs, f, g] ↔ (∃ rs0, rs1. rs0 ∪ rs1 = rs ∧ rs0 ∩ rs1 = ∅ ∧ hR0[rs0, f, g] ∧ hR1[rs1, f, g])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
linked-list-aux
,
rg
,
embed-aux
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
modifysep-def
,
Used spec theorems:
heap-fun
/heap-aux-inst/
sep
Used simplifier rules:
heap-sep
/heap-aux-inst/
sep-com
heap-sep
/heap-aux-inst/
sep-ass
set-union
/refset/
unc
set-union
/refset/
una
heap-fun
/heap-aux-inst/
split-uni
set-union
/refset/
int-c
set-union
/refset/
int-a