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: |
|---|
| theorem-member-returns-true-after-insert | proved | all subs proved
| inset-member-returns-true,
insert-inset-after-retinsert,
frag-rely-inv,
|
| insert-inset-after-retinsert | proved | all subs proved
| inv-tid,
frag-rely-inv,
insert-inset-after-retinsert-ind,
|
| inset-member-returns-true | proved | all subs proved
| inv-tid,
frag-rely-inv,
inset-member-returns-true-ind,
|
| theorem-allinserts-finished-false-implies-notin | proved | all subs proved
| allinserts-finished-false-implies-notin-ind,
|
| inset-member-returns-true-ind | proved | all subs proved
| ext-DoMember,
sel-RetMember-dottid,
ext-RetMember,
frag-rely-inv,
inv-tid,
|
| allinserts-finished-false-implies-notin-ind | proved | all subs proved
| inv-tid,
sel-InvInsert-dottid,
ext-InvInsert,
frag-retIns,
frag-rely-inv,
ext-DoInsert,
frag-DoIns,
|
| insert-inset-after-retinsert-ind | proved | all subs proved
| sel-RetMember-dottid,
ext-RetMember,
ext-DoMember,
sel-RetInsert-dottid,
ext-RetInsert,
ext-DoInsert,
frag-rely-inv,
inv-tid,
|
| frag-subset | proved | all subs proved
| frag-rely-inv,
|
| frag-DoIns | proved | all subs proved
| inv-tid,
|
| frag-retIns | proved | all subs proved
| inv-tid,
|
| frag-rely-inv | proved | all subs proved
| inv-tid,
|
| frag-retMem | proved | all subs proved
| inv-tid,
|
| frag-in | proved | all subs proved
| inv-tid,
|
| ext-InvInsert | axiom | | |
| sel-InvInsert-dottid | axiom | | |
| ext-DoInsert | axiom | | |
| ext-RetInsert | axiom | | |
| sel-RetInsert-dottid | axiom | | |
| ext-DoMember | axiom | | |
| ext-RetMember | axiom | | |
| sel-RetMember-dottid | axiom | | |
| inv-tid | proved | all subs proved
| |