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: |
|---|---|---|
| ole-add | ⊦ ordered≤(nats + n ') → ordered≤(nats + (n + m)') | A User Theorem |
| ole-le | ⊦ ¬ ordered≤(nats + n ') ∧ m ≤ n → ¬ ordered≤(nats + m ') | A User Theorem |