[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 lpt-ram-flash-write-same
n < # lpt ⊦ lpt[n] = mklp(n0, m, lpf, n2) → (lpt-ram-flash(lpt[n, mklp(m0, m, lpf, m2)], lpt0, nx) ↔ lpt-ram-flash(lpt, lpt0, nx))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 21
Used lemmas:
lpt-ram-flash
,
Used spec theorems:
array
/lp-array/
Put-other
Used simplifier rules:
nat-basic
/
f
array
/lp-array/
Size-put
nat-basic
/
lf-01
lprops
/
elim
elem-index
/gc-heap-base/
sel-01-M02
elem-index
/gc-heap-base/
sel-01-M03
lprops
/
inj
array
/lp-array/
Put-same