[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-sub
p ∈ tree ⊦ tree[p].fids ⊆ tree.fids
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
fids-del
,
fids-put1
,
Used by units in proved state:
posix-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 15
Used lemmas:
fids-ins
,
fids-dnode
,
Used spec theorems:
store
/directory-tree-inst/
exin
bag-union
/fidbag/
count-subset
bag-union
/fidbag/
union
Used simplifier rules:
directory-tree
/
nil-in
directory-tree
/
nil-at
bag-union
/fidbag/
subset-refl
directory-tree
/
split-in
list
/path/
c
directory-tree
/
one-inf
list
/path/
a
directory-tree
/
at-dnode
directory-tree
/
one-at
directory-tree
/
one-ind
directory-tree-base
/
At-same
nat
/
le-def
nat-basic
/
f
nat
/
fle
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c