[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

This is a listing of all goals defined over the current specification. Axioms are yellow, proof obligations purple and theorems green. Click on individual names to get more information on the proof.

Name:	Sequent:	Type:
disj	⊦ Leaf ≠ Node(t, t0)	An Axiom
sel-01	⊦ l(Node(t, t0)) = t	An Axiom
sel-02	⊦ r(Node(t, t0)) = t0	An Axiom
inj	⊦ Node(t, t0) = Node(t1, t2) ↔ t = t1 ∧ t0 = t2	An Axiom
case	⊦ t = Leaf ∨ t = Node(l(t), r(t))	An Axiom
elim	⊦ t ≠ Leaf → (t0 = l(t) ∧ t1 = r(t) ↔ t = Node(t0, t1))	An Axiom
gen		An Axiom