[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 set-min
⊦ t ≠ leaf ∧ bst(t) → t.set.min = t.leftmost
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
refine-delete-min
,
set-butmin
,
Used by units in proved state:
Proof exists?: