[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 tree-path

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:
in-mod-samepathprovedall subs proved put-rec, in-rec, in-base, empty-rec, put-base,
in-oneprovedall subs proved empty-rec, in-rec,
put-oneprovedall subs proved put-base, put-rec,
sel-mod-samepathprovedall subs proved get-rec, in-rec, put-rec, in-base, get-base, put-base,
mod-sameprovedall subs proved in-rec, put-rec, get-rec, in-base, put-base, get-base,
get-oneprovedall subs proved get-base, get-rec,
get-baseaxiom
get-recaxiom
put-baseaxiom
empty-recaxiom
in-baseaxiom
in-recaxiom
put-recaxiom