[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 store-iter

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:
iter-in	⊦ a ∈ iter st ↔ a ∈ st	An Axiom
iter-nodups	⊦ ¬ dups(iter st)	An Axiom
iter-eq	⊦ iter st0 = iter st1 ↔ dom st0 = dom st1	An Axiom
iter-empty	⊦ iter ∅ = []	A User Theorem
iter-mod	⊦ a ∈ st → iter st[a, d] = iter st	A User Theorem
iter-unfold	⊦ a ∈ st ↔ (∃ x, y. iter st = x + a ' + y ∧ a ∈ st)	A User Theorem