[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-fold
⊦ (r => mknode(r0, a, r1) * tr(r0, t0) * tr(r1, t1) * P)(H) ↔ (tr(r, branch(t0, a, t1)) * P)(H) ∧ True(H[r] = mknode(r0, a, r1))
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: 5
Proof steps: 11
Used lemmas:
tr-rec
,
Used spec theorems:
maplet-exec
/node-heap-maplet-exec-inst/
True
Used simplifier rules:
node
/
inj
maplet
/node-heap-maplet-exec-inst/
ex2-shift
maplet
/node-heap-maplet-exec-inst/
at-rewrite
heap-sep
/heap-sep-inst/
sep-com
heap-sep
/heap-sep-inst/
sep-ass