[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 approx-fixpoint

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:
iterate-is-fixprovedall subs proved iterate-subseq-mu, cont-iterate-fix, cont-monotone,
cont-iterate-fixprovedall subs proved iterate-rec, empty-def, iterate-base, iterate-subseq-leq, chain-def, cont-def, cont-monotone,
iterate-subseq-muprovedall subs proved iterate-rec, empty-def, iterate-base,
cont-monotoneprovedall subs proved chain-def, cont-def,
iterate-subseq-leqprovedall subs proved iterate-rec, empty-def, iterate-base,
iterate-subseqprovedall subs proved empty-def, iterate-base, iterate-rec,
iterate-oneprovedall subs proved iterate-base, iterate-rec,
cont-defaxiom
chain-defaxiom
iterate-baseaxiom
empty-defaxiom
iterate-recaxiom