[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 subdirs-alloc
⊦ ¬ ino ∈ dirs ∧ ino ≠ 0 ∧ p_ino ∈ dirs ∧ ¬ ino ∈ dirs[p_ino].entries → subdirs(p_ino, dirs ++ ino) = subdirs(p_ino, dirs)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 7
Used lemmas:
subdirs
,
Used spec theorems:
set-basic
/dir-entries/
Extension
Used simplifier rules:
heap
/dir-heap/
in-alloc
abstract-dir
/
elim
heap
/dir-heap/
at-alloc
abstract-dir
/
inj
store+set
/dir-entries/
In-data-in