[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 posix-links

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:
plinks-fids	proved	all subs proved	size-consp, in-plinks, in-consp, plinksd+, linksd0, links1,
size-consp	proved	all subs proved	in-consp, insert-consp, empty-consp,
empty-consp	proved	all subs proved	in-consp,
insert-consp	proved	all subs proved	in-consp,
links1	proved	all subs proved	in-plinks,
linksd0	proved	all subs proved	in-plinks,
plinksd+	proved	all subs proved	in-plinks, in-consp,
in-plinks	axiom
in-consp	axiom