[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 address-set-array-ops

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-writeprovedall subs proved disj-rec, disj-union-rem, disj-in-both, in-union-ext, union-rec, union-base, union-write-above,
union-union-oneprovedall subs proved subseteq-union-one,
subseteq-union-one-addprovedall subs proved subseteq-union-one,
subseteq-union-diff-oneprovedall subs proved disj-unique, in-index-in-union,
disj-union-remprovedall subs proved disj-in-both,
subseteq-union-oneprovedall subs proved in-index-in-union,
disj-uniqueprovedall subs proved disj-in-both,
union-eq-rem-subseteqprovedall subs proved in-index-in-union,
inter-union-empty-one-emptyprovedall subs proved in-index-in-union,
in-index-in-union-1provedall subs proved in-union-ext, union-rec,
union-write-aboveprovedall subs proved union-rec, union-base,
disj-recprovedall subs proved disj,
in-index-in-unionprovedall subs proved union-rec,
in-union-extprovedall subs proved union-rec, union-base,
disj-in-bothprovedall subs proved disj,
union-subsetprovedall subs proved union-rec, union-base,
disj-writeprovedall subs proved disj,
union-baseaxiom
union-recaxiom
disjaxiom