[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 store-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:
disjoint-union-emptyprovedall subs proved union-in, union-at-left, union-right-empty,
union-right-emptyprovedall subs proved union-at-left, union-in,
union-move-leftprovedall subs proved union-in, union-at-left,
union-left-emptyprovedall subs proved union-at-left, union-in,
disjoint-right-emptyprovedall subs proved disjoint,
disjoint-move-leftprovedall subs proved disjoint,
disjoint-left-emptyprovedall subs proved disjoint,
disjoint-in-rightprovedall subs proved disjoint,
disjoint-in-leftprovedall subs proved disjoint,
union-at-leftaxiom
union-inaxiom
disjointaxiom