[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-in-next
⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) ∧ str ∈ entries ∧ afs-cons(dirs, files) → (entries[str] ∈ files ↔ ¬ entries[str] ∈ dirs)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
afs-cons-nlink0-notin
,
Used by units in proved state:
cache-asm
,
afs-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
valid-pagesize
,
valid-ino
,
dir-empty
,
afs-cons
,
afs-cons-dir-nlink
,
afs-cons-notfile
,
Used spec theorems:
Used simplifier rules:
store
/dir-entries/
In-empty
store
/dir-entries/
Size-empty
abstract-dir
/
sel-05
abstract-dir
/
sel-09
abstract-dir
/
sel-03
abstract-dir
/
sel-08