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

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

Name: Sequent: Type:
disj ⊦ nobuffer ≠ buffered(m) An Axiom
sel ⊦ buffered(m).leb = m An Axiom
test-01 ⊦ ¬ nobuffer.isbuf? An Axiom
test-02 ⊦ buffered(m).isbuf? An Axiom
inj ⊦ buffered(m) = buffered(m0) ↔ m = m0 An Axiom
case ⊦ bleb = nobuffer ∨ bleb = buffered(bleb.leb) An Axiom
ex ⊦ bleb.isbuf? ↔ (∃ m. bleb = buffered(m)) An Axiom
elim ⊦ bleb ≠ nobuffer → (m = bleb.leb ↔ bleb = buffered(m)) An Axiom
genbufleb freely generated by nobuffer, buffered; An Axiom
elim-is-buf-ant ⊦ bleb.isbuf? ↔ (∃ n. bleb = buffered(n)) A User Theorem
elim-is-buf-suc ⊦ bleb.isbuf? ↔ bleb ≠ nobuffer A User Theorem