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

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:
sum-zeroprovedall subs proved sum-listlength-one,
prod-lastprovedall subs proved prod-one, prod-app,
prod-eq-oneprovedall subs proved prod-eq-one-01,
sum-listlength-oneprovedall subs proved sum-empty, sum-rec,
prod-appprovedall subs proved prod-rec, prod-empty,
prod-oneprovedall subs proved prod-empty, prod-rec,
prod-eq-one-01provedall subs proved prod-rec, prod-empty,
sum-appendprovedall subs proved sum-rec, sum-empty,
prod-eq-zeroprovedall subs proved prod-rec, prod-empty,
sum-emptyaxiom
sum-recaxiom
prod-emptyaxiom
prod-recaxiom