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: |
|---|---|---|---|
| leqstar-alt-def | proved | all subs proved | leqstar-def, |
| equivstar-both-leqstar | proved | all subs proved | leqstar-def-rev, leqstar-def, equivstar-def, |
| equivomega-both-leqomega | proved | all subs proved | leqomega-def-rev, leqomega-def, equivomega-def, |
| equiv-both-leq | proved | all subs proved | leq-def-rev, leq-def, equiv-def, |
| equivstar-def | axiom | ||
| leqstar-def | axiom | ||
| leqstar-def-rev | axiom | ||
| equivomega-def | axiom | ||
| leqomega-def | axiom | ||
| leqomega-def-rev | axiom | ||
| equiv-def | axiom | ||
| leq-def | axiom | ||
| leq-def-rev | axiom |