[Imprint][Data Privacy Statement][E-Mail]

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 base for Specification tree

Name: Sequent: Type:
⊦ leaf ≠ branch(t, a, t0) An Axiom
⊦ branch(t, a, t0) .right = t0 An Axiom
⊦ branch(t, a, t0) .val = a An Axiom
⊦ branch(t, a, t0) .left = t An Axiom
⊦ branch(t, a, t0) .right:= t2 = branch(t, a, t2) An Axiom
⊦ branch(t, a, t0) .val:= a0 = branch(t, a0, t0) An Axiom
⊦ branch(t, a, t0) .left:= t1 = branch(t1, a, t0) An Axiom
⊦ t ≠ leaf → (t .right:= t1) .right = t1 An Axiom
⊦ t ≠ leaf → (t .right:= t1) .val = t .val An Axiom
⊦ t ≠ leaf → (t .right:= t1) .left = t .left An Axiom
⊦ t ≠ leaf → (t .val:= a) .right = t .right An Axiom
⊦ t ≠ leaf → (t .val:= a) .val = a An Axiom
⊦ t ≠ leaf → (t .val:= a) .left = t .left An Axiom
⊦ t ≠ leaf → (t .left:= t0) .right = t .right An Axiom
⊦ t ≠ leaf → (t .left:= t0) .val = t .val An Axiom
⊦ t ≠ leaf → (t .left:= t0) .left = t0 An Axiom
⊦ branch(t, a, t0) = branch(t1, a0, t2) ↔ t = t1 ∧ a = a0 ∧ t0 = t2 An Axiom
⊦ t = leaf ∨ t = branch(t .left, t .val, t .right) An Axiom
⊦ t ≠ leaf → (t0 = t .left ∧ a = t .val ∧ t1 = t .right ↔ t = branch(t0, a, t1)) An Axiom
An Axiom
⊦ # leaf = 0 An Axiom
⊦ # branch(t, a, t0) = (# t + # t0) +1 An Axiom