[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-nogen

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:
sub-transprovedall subs proved Subset,
sub-refprovedall subs proved Subset,
rewprovedall subs proved At-same, At-other, Extension,
neqprovedall subs proved Extension,
insinsprovedall subs proved At-same, At-other, Extension,
ins3provedall subs proved At-same, At-other, Extension,
ins-twosameprovedall subs proved At-same, At-other, Extension,
ins-twoprovedall subs proved At-same, At-other, Extension,
ins-sameprovedall subs proved At-same, At-other, Extension,
insprovedall subs proved At-same, At-other, Extension,
Subsetaxiom
Extensionaxiom
At-otheraxiom
At-sameaxiom