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

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:
firstocprovedall subs proved inkeys-n, inone, inapp, empty,
inkeys-ncprovedall subs proved inkeys-n,
lenequalprovedall subs proved app, nuni-01, nuni, inkeys-n, ex, inone, unique-r, inapp,
in-putprovedall subs proved put-yes, inkeys-n, put-no, inapp, inone, put-empty, empty,
inkeys-nprovedall subs proved incons, inrec,
uniquelenprovedall subs proved app, nuni-01, nuni, ex, inone, unique-r, inapp, empty, unique-e,
unique-01provedall subs proved inone, unique-r, inapp, empty, unique,
unique-03provedall subs proved nuni-01, nuni,
unique-04provedall subs proved nuni-01, nuni,
inconsprovedall subs proved inapp,
uniqueprovedall subs proved unique-r, inone, inapp, unique-e, one,
nuniprovedall subs proved inone, unique-r, inapp, empty, nuni-01,
appprovedall subs proved inapp, unique-r, not,
insnotinprovedall subs proved put-no, inone, inapp, put-empty,
in-02provedall subs proved inone, inapp,
in-03provedall subs proved inapp,
insfirstprovedall subs proved put-no, inone, inapp, put-yes,
unique-02provedall subs proved in-01, unique-r,
copied-inrecprovedall subs proved inone, inapp,
inprovedall subs proved in-01, unique-r,
lenleprovedall subs proved ex, empty, unique-e, inone, unique-r, inapp,
in-01provedall subs proved inassoc,
exprovedall subs proved inassoc,
nuni-01provedall subs proved not, unique-r,
inappprovedall subs proved inassoc,
inoneprovedall subs proved inassoc,
copied-emptyprovedall subs proved inassoc,
oneprovedall subs proved unique-e, empty, unique-r,
notprovedall subs proved unique-r,
inassocprovedall subs proved inrec, empty,
infirstprovedall subs proved inrec,
one-01provedall subs proved assoc-yes,
put-oneprovedall subs proved put-yes,
k-unique-rprovedall subs proved unique-r, unique-e,
assoc-yesaxiom
inrecaxiom
put-yesaxiom
unique-eaxiom
emptyaxiom
unique-raxiom
put-emptyaxiom
put-noaxiom