This is a listing of all goals defined over the current specification. Axioms are yellow, proof obligations purple and theorems green. Click on individual names to get more information on the proof.
| Name: | Sequent: | Type: |
|---|---|---|
| nil | ⊦ [] = mkarray(0) | An Axiom |
| cons | ⊦ a + ar = copy(ar, 0, mkarray(# ar + 1), 1, # ar)[0, a] | An Axiom |
| first | ⊦ ar.first = ar[0] | An Axiom |
| rest | ⊦ ar.rest = subarray(ar, 1, # ar - 1) | An Axiom |
| postfix | ⊦ ar0 < ar1 ↔ # ar0 < # ar1 ∧ ar0 = subarray(ar1, # ar1 - # ar0, # ar0) | An Axiom |
| cut | ⊦ ar = [] ∨ (∃ a, ar0. ar = a + ar0) | A User Theorem |