[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 tidset-npset

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:
union-subsetprovedall subs proved disjointp-def, union-def,
union-lookupprovedall subs proved union-def,
union-empty-rprovedall subs proved union-def,
union-empty-lprovedall subs proved union-def,
in-unionprovedall subs proved union-def,
disjointp-reduceprovedall subs proved disjointp-def,
disjoint-empty-rprovedall subs proved disjointp-def,
disjoint-empty-lprovedall subs proved disjointp-def,
alldisjointp-reduceprovedall subs proved alldisjointp-def,
union-defaxiom
disjointp-defaxiom
alldisjointp-defaxiom