[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-put2
p ≠ ε ⊦ parent(p) ∈ tree0 ∧ tree0[parent(p)].dir? ∧ ¬ p ∈ tree0 → tree0[p, tree1].fids = tree0.fids ∪ tree1.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: 4
Proof steps: 11
Used lemmas:
fids-fnode
,
fids-ins
,
fids-dnode
,
Used spec theorems:
list-last
/path/
bapp
store
/directory-tree-inst/
exin
Used simplifier rules:
directory-tree
/
split-in
list
/path/
e-01
list
/path/
c
directory-tree
/
fnode-notin
list-last
/path/
b-02
directory-tree
/
one-inf
directory-tree
/
isfnode
directory-tree
/
one-at
directory-tree
/
one-ind
list
/path/
app
directory-tree
/
put-here
list-last
/path/
butlast-one
directory-tree
/
nil-in
directory-tree
/
nil-at
directory-tree
/
isdnode
directory-tree
/
nil-put
directory-tree
/
at-dnode
list-last
/path/
bc
directory-tree
/
put-rec
list
/path/
a
directory-tree
/
in-dnode
bag-union
/fidbag/
union-com
bag-union
/fidbag/
union-inj
bag-union
/fidbag/
union-ass
store
/directory-tree-inst/
insins
directory-tree-base
/
At-same