[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 list-getput

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-atprovedall subs proved get-zero, put-succ, get-succ, get-rec, put-zero,
get-recprovedall subs proved get-rec-01,
put-sameprovedall subs proved putset-same,
get-rec-01provedall subs proved get-succ,
putset-sameprovedall subs proved put-succ, get-succ, put-zero, get-zero,
put-at-eqprovedall subs proved get-succ, put-succ, get-zero, put-zero,
get-zero-01provedall subs proved get-zero,
extensionprovedall subs proved get-succ, get-zero,
put-lengthprovedall subs proved put-succ, put-zero,
put-zeroaxiom
get-succaxiom
put-succaxiom
get-zeroaxiom