[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-abs-dir-subdirs
⊦ afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)) ∧ ino ∈ abs-dirs(fs, ri) ∧ subdirs(ino, abs-dirs(fs, ri)) ≠ ∅ → fs[ri[inodekey(ino)]].nsubdirs ≥ 1
Type: A user defined theorem
Validity: The proof is valid.
Features: lss,
Comment:
Used by:
refine-rmdir
,
rename-precond-abs
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
Used spec theorems:
afs-base
/
afs-cons
Used simplifier rules:
set-basic
/stringset/
size-zero
set-basic
/stringset/
size-zero-01
nat-basic
/
one-01
nat
/
le-def
nat
/
ge
aubifs-abs
/
at-content
afs-base
/
valid-pagesize
aubifs-abs
/
in-content
abstract-file
/
sel-01
afs-base
/
valid-ino
aubifs-abs
/
at-children
aubifs-abs
/
in-children
abstract-file
/
sel-02
aubifs-abs
/
file
aubifs-abs
/
at-files
abstract-dir
/
sel-08
abstract-dir
/
sel-03
abstract-dir
/
sel-05
aubifs-abs
/
in-files
abstract-dir
/
sel-09
aubifs-abs
/
dir
aubifs-abs
/
at-dirs
afs-base
/
dir-empty
aubifs-abs
/
in-dirs
set-basic
/stringset/
size-zero-02