[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-queue
((del-list(to_delete, n) * P))(H) ⊦ ⟪tree_buffer_heap_process_queue#(; H, to_delete)⟫ ((n ≥ 2 → ((del-list(to_delete, n - 2) * P))(H)) ∧ (n < 2 → to_delete = [] ∧ ((del-list([], 0) * P))(H)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
refine-add
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 17
Used lemmas:
process-one
,
Used spec theorems:
Used simplifier rules:
nat
/
ge
del-lists
/
del-list-base
heap-sep
/
true-rev
heap-sep
/
true-and
heap-sep
/
and-ass
heap-sep
/
and-com
heap-sep
/
emp-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
nat-basic
/
one-01
nat
/
le-def
nat-basic
/
twols-02
nat-basic
/
one-06
nat
/
le-num-04
nat
/
not-zero
nat-basic
/
oz
nat-basic
/
a
nat-basic
/
c
nat
/
lep
nat
/
add-01
nat-basic
/
add-base
nat
/
elim-pred-c