[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 bag-union

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:
subset-exdiffprovedall subs proved union-diff-cancel, union-diff-distr, union-com, union-ass, union-subset,
union-subsetprovedall subs proved union-com, union-ass, union, count-subset,
union-diff-distrprovedall subs proved count-subset, union-com, union-ass, union, difference,
union-diff-cancelprovedall subs proved union-com, union-ass, union, difference,
still-in-diffprovedall subs proved in-diff-notfirst,
union-subset-injprovedall subs proved union-com, union-ass, union, count-subset,
in-unionprovedall subs proved union-com, union-ass, union, in,
union-injprovedall subs proved union-com, union-ass, union,
subset-sizeprovedall subs proved size-rec, subset-plus, size-empty,
diff-sizeprovedall subs proved size-rec, del-rec, subset-plus, diff-rec, size-empty, diff-empty,
union-sizeprovedall subs proved size-rec, union-rec, size-empty, union-com, union-ass, union-empty,
subset-plusprovedall subs proved subset-in, in, exin, subset-plusplus,
union-comprovedall subs proved union-ass, union,
in-diff-notfirstprovedall subs proved in, difference,
in-rem-notremprovedall subs proved count-del, in, still-in-rem,
subset-empprovedall subs proved count-subset, in, some, subset-refl,
del-sizeprovedall subs proved del-notin, size-rec, del-rec, exin, in,
diff-swapprovedall subs proved difference,
diff-add-swprovedall subs proved in, difference,
count-diff-subsetprovedall subs proved count-subset, difference,
differente-notinprovedall subs proved difference, in,
differenceprovedall subs proved del-notin, count-del, diff-rec, diff-empty,
union-assprovedall subs proved union,
exinprovedall subs proved count-del, in,
someprovedall subs proved in, in-emp,
still-in-remprovedall subs proved count-del, in,
in-atprovedall subs proved in-add,
bag-rm-add-eqprovedall subs proved in, count-del,
subset-antisymprovedall subs proved count-subset, subset-refl, subset-trans,
subset-plusminusprovedall subs proved count-del, count-subset,
subset-transprovedall subs proved count-subset,
unionprovedall subs proved union-rec, union-empty,
subset-plusplusprovedall subs proved count-subset,
subset-inprovedall subs proved count-subset,
subset-reflprovedall subs proved count-subset,
in-empprovedall subs proved in,
in-addprovedall subs proved in,
del-notinprovedall subs proved del-rec, del-empty,
count-delprovedall subs proved del-rec, del-empty,
subset-oneprovedall subs proved count-subset, in,
count-oneprovedall subs proved one,
subset-empty-sizeprovedall subs proved count-subset, size-rec, size-empty,
subset-smallerprovedall subs proved count-subset,
in-oneprovedall subs proved in, one,
subset-elemprovedall subs proved in, count-subset,
diff-empty1provedall subs proved del-empty, diff-rec, diff-empty,
union-emptyaxiom
union-recaxiom
size-emptyaxiom
oneaxiom
size-recaxiom
del-emptyaxiom
del-recaxiom
count-subsetaxiom
diff-emptyaxiom
diff-recaxiom
inaxiom