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

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:
lstepf-I19-bprovedall subs proved lstepf-I19,
lstepf-M16-bprovedall subs proved lstepf-M16,
lstepf-I21-bprovedall subs proved lstepf-I21,
lstepf-M9-bprovedall subs proved lstepf-M9,
lstepf-I9-bprovedall subs proved lstepf-I9,
lstepf-I15-bprovedall subs proved lstepf-I15,
lstepf-M12-bprovedall subs proved lstepf-M12,
lstepf-M12axiom
lstepf-I15axiom
lstepf-I9axiom
lstepf-M9axiom
lstepf-I21axiom
lstepf-M16axiom
lstepf-I19axiom