[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 gc-heap-rename

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:
id-idx-len-eq-1provedall subs proved id-idx-len-eq,
id-idx-len-eq-0provedall subs proved id-idx-len-eq,
id-idx-imp-ls-1provedall subs proved id-idx-ls0,
id-idx-imp-ls-0provedall subs proved id-idx-ls1,
id-idx-len-eqprovedall subs proved
id-idx-ls0provedall subs proved
id-idx-ls1provedall subs proved