[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 tr-unfold
⊦ r ≠ null → (¬ ¬ (tr(r, t) * P)(H) ↔ (∃ t0, t1, a, r0, r1. t = branch(t0, a, t1) ∧ (r => mknode(r0, a, r1) * tr(r0, t0) * tr(r1, t1) * P)(H)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
tr-rec
,
tr-base
,
tr-fold
,
Used spec theorems:
Used simplifier rules:
maplet
/node-heap/
ex2-shift
heap-sep
/node-heap/
false-rev
heap-sep
/node-heap/
false-and
heap-sep
/node-heap/
and-ass
heap-sep
/node-heap/
and-com
heap-sep
/node-heap/
false-sep
heap-sep
/node-heap/
falseH
heap-sep
/node-heap/
sep-com
heap-sep
/node-heap/
sep-ass