[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 getbyte-drop-lower
⊦ n < m * VFS_PAGE_SIZE → getbyte(n, content[m, buf]) = getbyte(n, content)
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: 2
Proof steps: 5
Used lemmas:
getpage
,
getbyte
,
Used spec theorems:
store
/file-content/
At-other
Used simplifier rules:
nat-mult
/
zero-01
nat-div
/
div-elim
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
modls
page
/
page-size
store
/file-content/
in-neq
store
/file-content/
insin
store
/file-content/
At-same
nat-basic
/
ref