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