[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-remove-wbufs-h
⊦ n ≤ # lpt → gc-heap(remove-wbufs(ns, lpt), nx, n) = gc-heap(lpt, nx, n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
gc-heap-remove-wbufs
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 23
Used lemmas:
gc-heap-rec
,
gc-heap-base
,
remove-wbufs
,
Used spec theorems:
array-indices
/lp-array/
mapindices-at
Used simplifier rules:
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
lprops
/
elim
nat
/
lels-03
nat
/
lels
nat
/
ls-le-simp
array-indices
/lp-array/
mapindices-size
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
One
lprops
/
upd-05
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
unadd
lprops
/
inj
set-basic
/gc-heap-rename-gc-heap-base-keyindex-set/
eq-03
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
uneq
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
unc
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
una
set-union
/gc-heap-rename-gc-heap-base-keyindex-set/
une
set-basic
/gc-heap-rename-gc-heap-base-keyindex-set/
sub-e
set-basic
/gc-heap-rename-gc-heap-base-keyindex-set/
sub-one-02