[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
,
Proof step 1 from proof challenge3 (
previous step
)
r ≠ null, (tr(r, t) * P)(H) ⊦ 〈search_tree_delete_min(; a, r, H)〉 ((tr(r, t .butleftmost) * P * true)(H) ∧ a = t .leftmost)
Lemma
program+leftmost