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

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:
case-String ⊦ s = [] ∨ s = s.head + s.tail An Axiom
elim-add ⊦ s ≠ [] → (head = s.head ∧ tail = s.tail ↔ s = head + tail) An Axiom
One ⊦ str(c) = c + [] An Axiom
disj-nil-add ⊦ [] ≠ head + s An Axiom
sel-add-dothead ⊦ (head + s).head = head An Axiom
size-nil ⊦ # [] = 0 An Axiom
in-empty ⊦ ¬ c ∈ [] An Axiom
Nil ⊦ [] + s = s An Axiom
genString freely generated by [], +; An Axiom
Cons ⊦ (c + s1) + s2 = c + (s1 + s2) An Axiom
Last ⊦ s + c = s + str(c) An Axiom
sel-add-dottail ⊦ (head + s).tail = s An Axiom
inj-add ⊦ head + s = head0 + s0 ↔ head = head0 ∧ s = s0 An Axiom
in-rec ⊦ c ∈ c0 + s ↔ c = c0 ∨ c ∈ s An Axiom
size-add ⊦ #(head + s) = (# s).+1 An Axiom