[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 valid-content-reduce
⊦ valid-content(files0) → ( valid-content(files1) ↔ (∀ ino, n. (ino ∈ files0 ∧ n ∈ files0[ino].content → n * VFS_PAGE_SIZE < files0[ino].size) → ino ∈ files1 ∧ n ∈ files1[ino].content → n * VFS_PAGE_SIZE < files1[ino].size))
Type: A user defined theorem
Validity: The proof is valid.
Features: lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 27
Used lemmas:
Used spec theorems:
vfs-base
/
valid-content
afs-base
/
valid-content
Used simplifier rules:
abstract-file
/
elim
nat
/
lels
nat
/
le-ls-simp
abstract-file
/
sel-06
abstract-file
/
sel-01