[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-orphans
⊦ afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)) → orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(orphans(fs, ri))
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
aubifs-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 16
Used lemmas:
at-content
,
in-content
,
at-children
,
in-children
,
file
,
at-files
,
dir
,
at-dirs
,
in-files
,
in-dirs
,
abs-keys
,
Used spec theorems:
set-basic
/dir-heap-refset/
Extension
afs-base
/
orphans
afs-base
/
afs-cons
Used simplifier rules:
key
/
sel-04
key
/
test-02
aubifs-inv
/
orphans
afs-base
/
root-not-orphan
afs-base
/
valid-pagesize
abstract-file
/
sel-01
afs-base
/
valid-ino
abstract-file
/
sel-02
abstract-dir
/
sel-08
abstract-dir
/
sel-03
abstract-dir
/
sel-05
abstract-dir
/
sel-09
afs-base
/
dir-empty
nat
/
one-02
set-basic
/alink-set/
size-zero-02
set-basic
/alink-set/
size-zero-01
set-basic
/alink-set/
size-zero