[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 abs-rec
⊦ ¬ name ∈ sdt → abs(sdt[name, tree], entries) = (⌜name ∈ entries⌝ ∧ abs(tree, entries[name]) * abs(sdt, entries -- name))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
entries-any
,
entries-fold
,
entries-fold-fnode
,
entries-fold-p
,
entries-recdel
,
entries-unfold
,
path-split-wand
,
Used by units in proved state:
Proof exists?: No