[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 list-setequal

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:
swap-init-setequal	proved	all subs proved	setequal-def,
subset-setequal-trans2	proved	all subs proved	setequal-def,
subset-setequal-trans1	proved	all subs proved	setequal-def,
setequal-trans3	proved	all subs proved	setequal-def,
setequal-trans2	proved	all subs proved	setequal-def,
setequal-trans	proved	all subs proved	setequal-def,
setequal-sym	proved	all subs proved	setequal-def,
setequal-subset-trans2	proved	all subs proved	setequal-def,
setequal-subset-trans1	proved	all subs proved	setequal-def,
setequal-refl	proved	all subs proved	setequal-def,
ext-setequal	proved	all subs proved	setequal-def,
elem-setequal2	proved	all subs proved	setequal-def,
elem-setequal	proved	all subs proved	setequal-def,
setequal-def	axiom