[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 bst-branch-strong
⊦ bst(branch(t0, b, t1)) ↔ (∀ a. a ∈ t0 → a < b) ∧ (∀ a. a ∈ t1 → b < a) ∧ (∀ a. ¬ (a ∈ t0 ∧ a ∈ t1)) ∧ (∀ a, c. a ∈ t0 ∧ c ∈ t1 → a < c) ∧ bst(t0) ∧ bst(t1)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
butleftmost-in
,
challenge3
,
ismin
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 12
Used lemmas:
bst-branch
,
Used spec theorems:
Used simplifier rules:
oelem
/
transitivity
oelem
/
nll
oelem
/
irreflexivity