[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 array

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:
put-same-contentprovedall subs proved putgetinv, Put-other, Size-put, Extension,
put-both-eqprovedall subs proved Put-same, cngetput, Size-put, Extension,
ngp-10provedall subs proved cngetput,
ngp-09provedall subs proved cngetput,
ngp-08provedall subs proved cngetput,
ngp-07provedall subs proved cngetput,
ngp-06provedall subs proved cngetput,
ext-recprovedall subs proved cgetput, Extension, Put-same, Put-other, Size-put,
cputput-reverseprovedall subs proved Put-same, Put-other, cgetput, Size-put, Extension,
cputputprovedall subs proved Put-other, Put-same, cgetput, cngetput, Size-put, Extension,
putgetinvprovedall subs proved Put-other, Put-same, Size-put, Extension,
cngetputprovedall subs proved Put-other,
cgetputprovedall subs proved Put-same,
cngetput-numprovedall subs proved Put-other,
Extensionaxiom
Size-putaxiom
Put-otheraxiom
Put-sameaxiom