[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 afs-cons-links-rmorphans
⊦ afs-cons(dirs, files) → links(ino, dirs \ orphans(dirs, files)) = links(ino, dirs)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
cache-asm
,
afs-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 13
Used lemmas:
valid-pagesize
,
dir-empty
,
afs-cons
,
valid-ino
,
afs-cons-notfile
,
afs-cons-links-empty
,
orphans
,
afs-cons-dir-nlink
,
links
,
Used spec theorems:
set-basic
/alink-set/
Extension
Used simplifier rules:
set-basic
/dir-heap-refset/
size-zero-01
set-basic
/dir-heap-refset/
ne-01
heap
/dir-heap/
at-diffs
heap
/dir-heap/
in-diffs
alink
/
elim
abstract-dir
/
elim
set-basic
/alink-set/
size-zero-02
abstract-dir
/
sel-08
abstract-dir
/
sel-03
abstract-dir
/
sel-09
abstract-dir
/
sel-05
set-basic
/alink-set/
size-zero-01
store
/dir-entries/
Size-empty
set-basic
/alink-set/
Size-empty
store
/dir-entries/
In-empty