[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 process-one
((del-list(to_delete, n) * P))(H) ⊦ ⟪tree_buffer_heap_process_one#(; H, to_delete)⟫ ((n ≥ 1 → ((del-list(to_delete, n - 1) * P))(H)) ∧ (n = 0 → to_delete = [] ∧ ((del-list([], 0) * P))(H)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
process-queue
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 37
Used lemmas:
Used spec theorems:
del-lists
/
del-list-rec
maplet
/cell-heap/
map-del
Used simplifier rules:
heap-sep
/
true-and
heap-sep
/
true-rev
list
/reflist/
a
list
/reflist/
e-01
list
/reflist/
c
list-data
/reflist/
elim-list-c
cell
/
elim
nat
/
elim-pred-c
nat
/
lels
nat
/
cancel-01
nat-basic
/
s-04
nat
/
elim-sub
nat
/
eq-01
nat-basic
/
zero
nat
/
not-zero
nat-basic
/
f
nat
/
succ-01
list-data
/
size-01
linked-list
/
ls-null
list
/
in-rec
list
/
in-14
cell
/
inj
maplet
/cell-heap/
at-eq
list
/
a
nat-basic
/
succ
list
/
len-05
linked-list
/
ls-unfold1
del-lists
/
ex-p
nat
/
ge
nat
/
lep
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
del-lists
/
del-list-base
heap-sep
/
prop-shift
heap-sep
/
emp-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
heap-sep
/
and-ass
heap-sep
/
and-com
heap-sep
/
and
heap-sep
/
prop
nat
/
zero-02
nat
/
lels-02
nat-basic
/
one