[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 delete-prepost
r ≠ null, ((tr(r, t) * P))(H) ⊦ ⟨search_tree_delete_min(; a, r, H)⟩ (((tr(r, t.butleftmost) * P))(H) ∧ a = t.leftmost)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
delete-prepost-min
,
Used by units in proved state:
data-refinement
,
Proof exists?: