[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 node

Name: Sequent: Type:
⊦ mknode(r, a, r0) = mknode(r1, a0, r2) ↔ r = r1 ∧ a = a0 ∧ r0 = r2 An Axiom
⊦ mknode(nd .left, nd .val, nd .right) = nd An Axiom
⊦ r = nd .left ∧ a = nd .val ∧ r0 = nd .right ↔ nd = mknode(r, a, r0) An Axiom
An Axiom
⊦ (nd .left:= r) .left = r An Axiom
⊦ (nd .val:= a) .left = nd .left An Axiom
⊦ (nd .right:= r0) .left = nd .left An Axiom
⊦ (nd .left:= r) .val = nd .val An Axiom
⊦ (nd .val:= a) .val = a An Axiom
⊦ (nd .right:= r0) .val = nd .val An Axiom
⊦ (nd .left:= r) .right = nd .right An Axiom
⊦ (nd .val:= a) .right = nd .right An Axiom
⊦ (nd .right:= r0) .right = r0 An Axiom
⊦ mknode(r, a, r0) .left:= r1 = mknode(r1, a, r0) An Axiom
⊦ mknode(r, a, r0) .val:= a0 = mknode(r, a0, r0) An Axiom
⊦ mknode(r, a, r0) .right:= r2 = mknode(r, a, r2) An Axiom
⊦ mknode(r, a, r0) .left = r An Axiom
⊦ mknode(r, a, r0) .val = a An Axiom
⊦ mknode(r, a, r0) .right = r0 An Axiom