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: |
|---|
| refines | proved | all subs proved
| bwsim,
|
| bwrefines | proved | all subs proved
| bwsim,
|
| bwsim | proved | all subs proved
| imfin-lemma,
fininvdeq,
DurQ-Automaton,
aabs-callARun,
aabs-AResEnq,
aabs-AResDeq,
aabs-AInvEnq,
aabs-AInvDeq,
aabs-ADoEnq,
aabs-ADoDeq,
aabs-DurQtau,
aabs-Acrash,
absa-def,
bwsim-step,
DQinit,
DurQstep,
DQINV-Step,
DQstep,
DurQinit,
DQINV-Init,
DQINV-def,
|
| bwsim-step | proved | all subs proved
| bwsim-step-nontau,
absa-def,
bwsim-step-tau,
|
| DQINV-Init | proved | all subs proved
| fininvdeq,
DQINV-def,
DQinit,
|
| DQINV-Step | proved | all subs proved
| fininvdeq,
DQINV-def,
|
| DurQ-Automaton | proved | all subs proved
| DurQinit,
|
| imfin-lemma | proved | all subs proved
| imfin-lemma-aux,
|
| bwsim-step-tau | proved | all subs proved
| absa-def,
|
| bwsim-step-nontau | proved | all subs proved
| absa-def,
|
| DQ-Automaton | proved | all subs proved
| DQinit,
|
| imfin-lemma-aux | proved | all subs proved
| |
| DurQinit | axiom | | |
| DQstep | axiom | | |
| DurQstep | axiom | | |
| aabs-Acrash | axiom | | |
| aabs-DurQtau | axiom | | |
| aabs-ADoDeq | axiom | | |
| aabs-ADoEnq | axiom | | |
| aabs-AInvDeq | axiom | | |
| aabs-AInvEnq | axiom | | |
| aabs-AResDeq | axiom | | |
| aabs-AResEnq | axiom | | |
| aabs-callARun | axiom | | |
| DQinit | axiom | | |
| DQINV-def | axiom | | |
| fininvdeq | axiom | | |
| absa-def | axiom | | |