[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 gc-heap-write-other-h
lpf0 ≠ LP_GROUP_NODES, lpf1 ≠ LP_GROUP_NODES ⊦ lpt[n] = mklp(m0, m1, lpf0, m2) ∧ n < # lpt ∧ m ≤ # lpt → gc-heap(lpt[n, mklp(n0, n1, lpf1, n2)], nx, m) = gc-heap(lpt, nx, m)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
gc-heap-write-other
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 11
Used lemmas:
gc-heap-rec
,
gc-heap-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
lprops
/
elim
nat
/
lels
nat
/
ls-le-simp
elem-index
/gc-heap-base/
sel-01-M01
array
/lp-array/
Size-put
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
One
array
/lp-array/
cngetput
elem-index
/gc-heap-base/
sel-01-M03
nat
/
lels-03
array
/lp-array/
Put-other
lprops
/
inj
array
/lp-array/
Put-same
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
une
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
una
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
unc
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
uneq
set-basic
/gc-heap-rename-gc-heap-base-keyindex-set/
sub-e