[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 ebm-base

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:
ebm-order-write-sameprovedall subs proved ebm-le,
ebm-order-transprovedall subs proved ebm-le,
ebm-order-reflprovedall subs proved ebm-le,
ebm-order-in-avol-leftprovedall subs proved ebm-le,
ebm-order-antisymprovedall subs proved ebm-le,
ebm-initial-imp-consprovedall subs proved valid-leb-def, ebm-cons, ebm-cons-def, ebm-initial,
ebm-cons-writeprovedall subs proved valid-leb-def, ebm-cons, ebm-cons-def,
ebm-cons-leb-size-leprovedall subs proved valid-leb-def, ebm-cons, ebm-cons-def,
ebm-cons-leb-sizeprovedall subs proved valid-leb-def, ebm-cons, ebm-cons-def,
ebm-leaxiom
ebm-initialaxiom
ebm-cons-defaxiom
ebm-consaxiom
valid-leb-defaxiom