[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 cache-refine

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:
refine-truncateprovedall subs proved refine-truncate-buff-none-uncached, refine-truncate-buff-none-cached, refine-truncate-buff-some,
refine-renamprovedall subs proved refine-rename-file-dentry, refine-rename-dir-dentry, refine-rename-file-negdentry, refine-rename-dir-negdentry,
refine-truncate-buff-someprovedall subs proved
refine-truncate-buff-none-cachedprovedall subs proved
refine-truncate-buff-none-uncachedprovedall subs proved
refine-rename-dir-negdentryprovedall subs proved
refine-rename-file-negdentryprovedall subs proved
refine-rename-dir-dentryprovedall subs proved
refine-rename-file-dentryprovedall subs proved