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

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 ⊦ none ≠ v × m An Axiom
sel-01 ⊦ (v × m).leb = m An Axiom
sel-02 ⊦ (v × m).vol = v An Axiom
upd-01 ⊦ (v × m).vol:= v0 = v0 × m An Axiom
upd-02 ⊦ (v × m).leb:= m0 = v × m0 An Axiom
updsel-01 ⊦ lref ≠ none → (lref.vol:= v).vol = v An Axiom
updsel-02 ⊦ lref ≠ none → (lref.leb:= m).leb = m An Axiom
updsel-03 ⊦ lref ≠ none → (lref.vol:= v).leb = lref.leb An Axiom
updsel-04 ⊦ lref ≠ none → (lref.leb:= m).vol = lref.vol An Axiom
inj ⊦ v × m = v0 × m0 ↔ v = v0 ∧ m = m0 An Axiom
case ⊦ lref = none ∨ lref = lref.vol × lref.leb An Axiom
elim ⊦ lref ≠ none → (v = lref.vol ∧ m = lref.leb ↔ lref = v × m) An Axiom
genlebref freely generated by none, ×; An Axiom