[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-append-log-h
⊦ m ≤ # lpt ∧ lpt[n] = mklp(n0, n1, LP_GROUP_NODES, n2) ∧ ¬ n ∈ nx → gc-heap(lpt, n ' + nx, m) = gc-heap(lpt, nx, m) -- key-index(lpt[n].ref-size, n)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
gc-heap-append-log
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
gc-heap-in-h
,
Used spec theorems:
set-basic
/gc-heap-rename-gc-heap-base-keyindex-set/
Extension
Used simplifier rules:
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
Delete
list
/nat-list-set/
a
list
/nat-list-set/
in-rec
lprops
/
elim
elem-index
/gc-heap-base/
sel-01-M03
elem-index
/gc-heap-base/
sel-01-M01
nat-basic
/
f
nat
/
fle
lprops
/
inj
key-index
/gc-heap-rename-gc-heap-base/
inj