[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. 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 finroot

fin(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))))

View the proof

Infos about the proof