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

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:
beh-def ⊦ beh(IOAut(startf, stepf))(α) ↔ trace(IOAut(startf, stepf))(α) An Axiom
times-ins ⊦ α × (ss ++ s) = (α × ss) ++ (α × s) An Axiom
times-null ⊦ α × ∅ = ∅ An Axiom
finoutfin(IOAut(startf, stepf)), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) A User Theorem
finrootfin(IOAut(startf, stepf)), ∀ α0. finp(α0) ∧ α0 ≤ α → trace(IOAut(startf, stepf))(α0) ⊦ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ α ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) A User Theorem
lemma_2-5-1IOAut?(IOAut(startf, stepf)) ⊦ traceprop(beh(IOAut(startf, stepf))) A User Theorem
lemma_2-5-2 ⊦ fin(IOAut(startf, stepf)) → limit-closed(beh(IOAut(startf, stepf))) A User Theorem
times-in ⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss A User Theorem