[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-singleton
⊦ r => mknode(null, a, null) = tr(r, branch(leaf, a, leaf))
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: 3
Used lemmas:
tr-base
,
tr-rec
,
Used spec theorems:
Used simplifier rules:
heap-sep
/
prop-shift
heap-sep
/
emp-sep
heap-sep
/
sep-com
heap-sep
/
sep-ass
maplet
/node-heap/
ex2
heap-sep
/
prop
heap-sep
/
and
heap-sep
/
false-rev
heap-sep
/
falseH
heap-sep
/
and-ass
heap-sep
/
and-com