[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 fids-del
p ≠ ε ⊦ p ∈ tree → (tree -- p).fids = tree.fids \ tree[p].fids
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
posix-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 13
Used lemmas:
fids-fnode
,
fids-sub
,
fids-ins
,
fids-dnode
,
Used spec theorems:
store
/directory-tree-inst/
exin
directory-tree
/
del-recin
Used simplifier rules:
directory-tree
/
split-in
list
/path/
e-01
list
/path/
c
directory-tree
/
one-inf
directory-tree
/
one-at
directory-tree
/
at-dnode
directory-tree
/
one-ind
bag-union
/fidbag/
union-diff-cancel
directory-tree
/
nil-at
store
/directory-tree-inst/
notin-del-notin
store
/directory-tree-inst/
Del-rec-same
directory-tree
/
del-here
list
/path/
a
list
/path/
app
store
/directory-tree-inst/
insin
directory-tree-base
/
In-insert
store
/directory-tree-inst/
insins
directory-tree-base
/
At-same
bag-union
/fidbag/
union-diff-distr
bag-union
/fidbag/
union-ass
bag-union
/fidbag/
union-com