[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

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:
updsel--dotval-dotval ⊦ (nd.val:= val).val = val An Axiom
updsel--dotdeqID-dotval ⊦ (nd.deqID:= opttid).val = nd.val An Axiom
elim-mk ⊦ (val = nd.val ∧ deqID = nd.deqID) ∧ next = nd.next ↔ nd = mk(val, deqID, next) An Axiom
elim ⊦ (val = nd.val ∧ opttid = nd.deqID) ∧ nxt = nd.next ↔ nd = mk(val, opttid, nxt) A User Theorem
upd-mk-dotnext ⊦ mk(val, opttid, nxt).next:= nxt0 = mk(val, opttid, nxt0) An Axiom
updsel--dotdeqID-dotdeqID ⊦ (nd.deqID:= opttid).deqID = opttid An Axiom
updsel--dotval-dotnext ⊦ (nd.val:= val).next = nd.next An Axiom
updsel--dotnext-dotval ⊦ (nd.next:= nxt).val = nd.val An Axiom
updsel--dotval-dotdeqID ⊦ (nd.val:= val).deqID = nd.deqID An Axiom
sel-mk-dotval ⊦ mk(val, opttid, nxt).val = val An Axiom
upd-mk-dotval ⊦ mk(val, opttid, nxt).val:= val0 = mk(val0, opttid, nxt) An Axiom
inj-mk ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0 An Axiom
updsel--dotnext-dotdeqID ⊦ (nd.next:= nxt).deqID = nd.deqID An Axiom
sel-mk-dotdeqID ⊦ mk(val, opttid, nxt).deqID = opttid An Axiom
upd-mk-dotdeqID ⊦ mk(val, opttid, nxt).deqID:= opttid0 = mk(val, opttid0, nxt) An Axiom
updsel--dotnext-dotnext ⊦ (nd.next:= nxt).next = nxt An Axiom
gen-NodeNode freely generated by mk; An Axiom
case-Node ⊦ mk(nd.val, nd.deqID, nd.next) = nd An Axiom
sel-mk-dotnext ⊦ mk(val, opttid, nxt).next = nxt An Axiom
updsel--dotdeqID-dotnext ⊦ (nd.deqID:= opttid).next = nd.next An Axiom