[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 program+leftmost
r ≠ null, (tr(r, t) * P)(H) ⊦ 〈search_tree_delete_min(; a, r, H)〉 ((tr(r, t .butleftmost) * P * true)(H) ∧ a = t .leftmost)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
challenge3
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 55
Used lemmas:
search_tree_delete_min
,
leftmost
,
butleftmost
,
Used spec theorems:
separation
/node-heap/
eq
linked-tree
/
tr-rec
Used simplifier rules:
linked-tree
/
tr-fold
separation
/node-heap/
eq-cong-injl
tree
/
inj
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
l-02
nat-basic2
/
s
nat-basic2
/
succ
tree
/
size-01
maplet
/node-heap/
map-null
maplet
/node-heap/
ex2-shift
heap-sep
/node-heap/
false-rev
heap-sep
/node-heap/
false-and
heap-sep
/node-heap/
false-sep
heap-sep
/node-heap/
falseH
node
/
inj
heap
/node-heap/
at-write
heap
/node-heap/
in-write-strong
maplet
/node-heap/
map-in
linked-tree
/
tr-fold-t
node
/
elim
node
/
upd-03
heap
/node-heap/
nonnull
separation
/node-heap/
assign-known
linked-tree
/
tr-base
tree
/
disj
maplet
/node-heap/
at-rw
node
/
sel-03
node
/
sel-01
node
/
sel-02
linked-tree
/
tr-null
heap-sep
/node-heap/
prop-shift
heap-sep
/node-heap/
emp-sep
heap-sep
/node-heap/
and-ass
heap-sep
/node-heap/
and-com
heap-sep
/node-heap/
and
heap-sep
/node-heap/
prop
heap-sep
/node-heap/
true-elim
heap-sep
/node-heap/
sep-com
heap-sep
/node-heap/
sep-ass
linked-tree
/
tr-unfold