[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 idset-mapped-pebs-write-unused
n < # wlar, stat ≠ used ⊦ wlar[n] = wl-entry(m, stat) ∧ id○(apebs, apebs0, n) ∧ valid-ebatbl(apebs, wlar, vols, n0) → id(apebs, apebs0, mapped-pebs(vols))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
mapped-pebs
,
id-set
,
valid-ebatbl
,
Used spec theorems:
array-copy
/apebs/
Idexcept
Used simplifier rules:
array-copy
/apebs/
idexcept-size
nat-basic
/
f
nat-basic
/
lf-01
nat-basic
/
lf-02
wlentry
/
sel-04