[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 ubi-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-mapprovedall subs proved lf-mapped-in-apebs, lf-elim-unmapped, emptyleb-mkempbuf, refine-write,
refine-writeprovedall subs proved refine-change, lf-mapped-not-bad, lf-mapped-valid-vidhdr, lf-mapped-data, lf-mapped-in-apebs, lf-elim-unmapped,
refine-wl-workerprovedall subs proved lf-mapped-data, lf-mapped-not-bad, lf-mapped-valid-vidhdr, lf-mapped-in-apebs, lf-elim-unmapped,
recoveryprovedall subs proved lf-mapped-not-bad, lf-mapped-valid-vidhdr, lf-mapped-in-apebs, lf-elim-unmapped,
lf-mapped-not-badprovedall subs proved lf-mapped-in-apebs, lf-mapped-valid-vidhdr,
lf-mapped-valid-vidhdrprovedall subs proved lf-mapped-in-apebs,
refine-changeprovedall subs proved lf-mapped-in-apebs, lf-elim-unmapped,
refine-readprovedall subs proved lf-elim-unmapped,
refine-eraseprovedall subs proved lf-mapped-in-apebs, lf-elim-unmapped,
refine-unmapprovedall subs proved lf-mapped-in-apebs, lf-elim-unmapped,
lf-mapped-dataprovedall subs proved
emptyleb-mkempbufprovedall subs proved
lf-elim-unmappedprovedall subs proved
lf-mapped-in-apebsprovedall subs proved