[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 mapped-full-last
m + n < # avol ⊦ mapped-full?(avol[m + n, mapped(buf)], n, m + 1) ↔ # buf = LEB_SIZE ∧ mapped-full?(avol, n, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
persistence-io-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
mapped-full
,
Used spec theorems:
Used simplifier rules:
array
/avolume/
Size-put
nat-basic
/
s-04
array
/avolume/
Put-other
nat-basic
/
l
oelem
/nat-set/
irreflexivity
nat-basic
/
ls-02
nat
/
let
nat
/
lels
nat
/
lep-02
nat
/
ler
nat
/
lep
array
/avolume/
Put-same
aleb
/
test-02
aleb
/
sel
nat-basic
/
a
nat-basic
/
l-01
nat-basic
/
succ
nat
/
fle-01
nat-basic
/
lf
nat-basic
/
f
array
/avolume/
ngp-07
nat
/
lels-02
nat-basic
/
c