[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 max-exists
⊦ ∃ ino. ino ≠ 0 ∧ (∀ n. n ∈ dirs ∨ n ∈ files → n < ino)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
new-exists
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 24
Proof steps: 47
Used lemmas:
Used spec theorems:
heap
/file-heap/
ext
heap
/dir-heap/
ext
heap
/file-heap/
exin
heap
/dir-heap/
exin
Used simplifier rules:
heap
/file-heap/
sanity
heap
/file-heap/
in-write
heap
/dir-heap/
size-emp
nat-basic
/
zero-01
heap
/dir-heap/
in-emp
nat-basic
/
l-02
nat-basic
/
oz
heap
/dir-heap/
sanity
heap
/dir-heap/
in-write
heap
/dir-heap/
size-alloc
heap
/dir-heap/
size-write
heap
/dir-heap/
in-alloc
heap
/file-heap/
in-emp
heap
/file-heap/
in-alloc
heap
/file-heap/
size-write
heap
/file-heap/
size-alloc
nat-basic
/
s-04
nat-basic
/
ref
nat-basic
/
ls-02
nat-basic
/
lf
nat-basic
/
trans
nat-basic
/
f
nat-basic
/
succ
nat-basic
/
a
nat-basic
/
c
nat-basic
/
l-05
nat
/
lels