[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 IObackward-INV

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:
weakbwsim-implies-bwsiminvprovedall subs proved weakbwsim-implies-bwsiminv-aux, backwardsiminv-def, weakbackwardsim-def,
weakbwsim-implies-bwsiminv-auxprovedall subs proved weak-lemma_3-15, proofobls-weakbackwardsim, proofobls-backwardsiminv,
bwsim-bwsiminvprovedall subs proved bwsim-bwsiminv-aux, backwardsiminv-def, backwardsim-def,
bwsiminv-implies-weakbwsimprovedall subs proved bwsiminv-implies-weakbwsim-aux, weakbackwardsim-def, backwardsiminv-def,
bwsiminv-implies-weakbwsim-auxprovedall subs proved proofobls-backwardsiminv, proofobls-weakbackwardsim,
weak-lemma_3-15provedall subs proved proofobls-weakbackwardsim,
bwsim-bwsiminv-auxprovedall subs proved proofobls-backwardsiminv, proofobls-backwardsim,
lemma_3-15provedall subs proved proofobls-backwardsiminv,
weakbackwardsim-defaxiom
proofobls-backwardsimaxiom
proofobls-weakbackwardsimaxiom
proofobls-backwardsiminvaxiom
backwardsim-defaxiom
backwardsiminv-defaxiom