[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 refmap-maplet

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:
eq-objs	proved	all subs proved	at-eq, at-rw,
map-del	proved	all subs proved	maplet, map-null, at-eq, map-in,
at-eq	proved	all subs proved	at-rw,
map-put-rw	proved	all subs proved	maplet, map-write, map-in,
ex1-shiftw-inst	proved	all subs proved	ex1-shiftw,
ex2-shiftw-inst	proved	all subs proved	ex2-shiftw,
map-null	proved	all subs proved	maplet,
ex2-shiftw	proved	all subs proved	ex2,
ex1-shiftw	proved	all subs proved	ex,
at-rw	proved	all subs proved	maplet,
map-in	proved	all subs proved	maplet,
map-write	proved	all subs proved	maplet,
ex2-shift	proved	all subs proved	ex2,
precise-map	proved	all subs proved	maplet,
at-rw-singleton	proved	all subs proved	maplet,
map-in0	proved	all subs proved	maplet,
map-same	proved	all subs proved	maplet,
ex1-shift	proved	all subs proved	ex,
ex2	axiom
ex	axiom
maplet	axiom