[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 directory-tree-fids

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:
fids-strprovedall subs proved fids-strpath, fids-in,
fids-strpathprovedall subs proved fids-path, fids-in, fids-ins, fids-emp,
fids-pathprovedall subs proved fids-in,
fids-put1provedall subs proved fids-fnode, fids-ins, fids-dnode, fids-sub,
fids-delprovedall subs proved fids-fnode, fids-sub, fids-ins, fids-dnode,
fids-inprovedall subs proved fids-ins, fids-emp, fids-dnode, fids-fnode,
fids-subprovedall subs proved fids-ins, fids-dnode,
fids-put3provedall subs proved fids-fnode, fids-ins, fids-dnode,
fids-put2provedall subs proved fids-fnode, fids-ins, fids-dnode,
fids-empaxiom
fids-dnodeaxiom
fids-insaxiom
fids-fnodeaxiom