[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,

Theorem base for Specification del-lists

This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.

Name: Sequent: Type:
ex ⊦ (_∃ xP)(H) ↔ (∃ x. xP(x)(H)) An Axiom
del-list-rec ⊦ del-list(r ' + rx, n) = _∃(λ x. ls(r, x) * del-list(rx, n - # x) ∧ ⌜r ≠ null ∧ n ≥ # x⌝ ) An Axiom
del-list-base ⊦ del-list([], n) = (emp ∧ ⌜n = 0⌝ ) An Axiom
del-lists-1r ≠ null ⊦ del-list(r ', n) = _∃(λ x. ls(r, x) ∧ ⌜n = # x ∧ r ≠ null⌝ ) A User Theorem
del-lists-unions ⊦ H0 ⊥ H1 ∧ del-list(rx, n)(H0) → (((del-list(rx, m) * P))(H0 ∪ H1) ↔ n = m ∧ P(H1)) A User Theorem
ex-p ⊦ ((_∃ xP * P))(H) ↔ (∃ x. ((xP(x) * P))(H)) A User Theorem