[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 id-idx-write-both
⊦ id-idx(lpt0, lpt1) → id-idx(lpt0[n, mklp(n0, n1, lpf, n2)], lpt1[n, mklp(n0, n1, lpf, m2)])
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
persistence-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 14
Used lemmas:
Used spec theorems:
index-array
/gc-heap-base/
id-idx
array
/lp-array/
Put-other
Used simplifier rules:
nat-basic
/
f
array
/lp-array/
Size-put
lprops
/
elim
array
/lp-array/
Put-other
lprops
/
inj
nat
/
lels
nat
/
ls-le-simp
array
/lp-array/
cgetput
array
/lp-array/
Put-same
nat-basic
/
lf-01