[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-non-group
n < # lpt, lpf ≠ LP_GROUP_NODES ⊦ lpt-ram-flash(lpt, lpt0, nx) → lpt-ram-flash(lpt[n, mklp(n0, n1, lpf, n2)], 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: 1
Proof steps: 10
Used lemmas:
lpt-ram-flash
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
lf-01
nat-basic
/
f
array
/lp-array/
cngetput
array
/lp-array/
Size-put
lprops
/
elim
array
/lp-array/
Put-same
lprops
/
inj
array
/lp-array/
Put-other
elem-index
/gc-heap-base/
sel-01-M03
elem-index
/gc-heap-base/
sel-01-M02