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

Lemma dependency for Specification iter-n

A lemma (entry) may depend on lemmas (entries) below its position, but never on lemmas above its position. This means the list is a topological order of the dependency graph. An entry 'all subs proved' means that all used lemmas are (transitively) proved.

Name: Status: Subs proved? Used:
Sep-weak-conjunctionprovedall subs proved Sep-unfold,
Sep-unfoldprovedall subs proved Sep-rec, Sep-split,
Sep-forall-reduce-impprovedall subs proved Sep-forall-prove-imp,
Sep-splitprovedall subs proved Sep-rec, Sep-base,
Sep-forall-prove-impprovedall subs proved Sep-rec, Sep-base,
Sep-empprovedall subs proved Sep-rec, Sep-base,
Sep-distribute-trueprovedall subs proved Sep-rec, Sep-base,
Sep-forallprovedall subs proved Sep-rec, Sep-base,
Sep-rangeprovedall subs proved Sep-rec, Sep-base,
Sep-baseaxiom
Sep-recaxiom