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

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:
canonical-def ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )) An Axiom
can-is-IOAuttraceprop(tP) ⊦ ALIOAut?(can(tP)) A User Theorem
exec-lemalexec(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = al to n A User Theorem
frag-detalfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), alfrag(can(tP))(⌜alli0⌝ , ⌜al⌝ ), alli[0] = alli0[0] ⊦ alli = alli0 A User Theorem
frag-lemalfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n) A User Theorem
frag-lem-2alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ) ⊦ ⌜al⌝ ^ = ⌜al⌝ A User Theorem
lemma-2-8-1-a ⊦ det(can(tP)) A User Theorem
lemma-2-8-1-btraceprop(tP) ⊦ forest(can(tP), λ al. tP(⌜al⌝ )) A User Theorem