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

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:
sel-FO-dotl ⊦ FO(l).l = l An Axiom
elim-W ⊦ be.W? → (l = be.l ∧ v = be.v ↔ be = W(l, v)) An Axiom
test-dotFOque-SF ⊦ ¬ SF.FO? An Axiom
test-dotFOque-W ⊦ ¬ W(l, v).FO? An Axiom
sel-W-dotv ⊦ W(l, v).v = v An Axiom
inj-W ⊦ W(l, v) = W(l0, v0) ↔ l = l0 ∧ v = v0 An Axiom
inj-FO ⊦ FO(l) = FO(l0) ↔ l = l0 An Axiom
test-dotWque-W ⊦ W(l, v).W? An Axiom
disj-FO-SF ⊦ FO(l) ≠ SF An Axiom
test-dotWque-SF ⊦ ¬ SF.W? An Axiom
ex-dotFOque ⊦ be.FO? ↔ (∃ l. be = FO(l)) An Axiom
ex-dotWque ⊦ be.W? ↔ (∃ l, v. be = W(l, v)) An Axiom
case-Bevent ⊦ be = W(be.l, be.v) ∨ be = FO(be.l) ∨ be = SF An Axiom
disj-W-FO ⊦ W(l, v) ≠ FO(l0) An Axiom
sel-W-dotl ⊦ W(l, v).l = l An Axiom
gen-BeventBevent freely generated by SF, W, FO; An Axiom
elim-FO ⊦ be.FO? → (l = be.l ↔ be = FO(l)) An Axiom
test-dotFOque-FO ⊦ FO(l).FO? An Axiom
disj-W-SF ⊦ W(l, v) ≠ SF An Axiom
test-dotWque-FO ⊦ ¬ FO(l).W? An Axiom