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