| ⊦ fin(IOAut(startf, stepf)) → limit-closed(beh(IOAut(startf, stepf))) |
fin(IOAut(startf, stepf)), ¬ limit-closed(beh(IOAut(startf, stepf))) ⊦
| fin(IOAut(startf, stepf)), ¬ limit-closed(beh(IOAut(startf, stepf))) ⊦ |
fin(IOAut(startf, stepf)), ¬ limit-closed(beh(IOAut(startf, stepf))) ⊦
| fin(IOAut(startf, stepf)), ¬ limit-closed(beh(IOAut(startf, stepf))) ⊦ |
⊦ limit-closed(tP) ↔ (∀ α1. ¬ finp(α1) ∧ ext(α1) ∧ (∀ α2. finp(α2) ∧ α2 ≤ α1 → tP(α2)) → tP(α1))
fin(IOAut(startf, stepf)), ∃ α1. ¬(¬ finp(α1) ∧ ext(α1) ∧ (∀ α2. finp(α2) ∧ α2 ≤ α1 → beh(IOAut(startf, stepf))(α2)) → beh(IOAut(startf, stepf))(α1)) ⊦
Used terms: beh(IOAut(startf, stepf))
| ⊦ limit-closed(tP) ↔ (∀ α1. ¬ finp(α1) ∧ ext(α1) ∧ (∀ α2. finp(α2) ∧ α2 ≤ α1 → tP(α2)) → tP(α1)) |
| fin(IOAut(startf, stepf)), ∃ α1. ¬(¬ finp(α1) ∧ ext(α1) ∧ (∀ α2. finp(α2) ∧ α2 ≤ α1 → beh(IOAut(startf, stepf))(α2)) → beh(IOAut(startf, stepf))(α1)) ⊦ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: beh-def: ⊦ beh(IOAut(startf, stepf))(α) ↔ trace(IOAut(startf, stepf))(α); ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream]
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
infgraph(g), finroot(g), finout(g), allreachable(g) ⊦ ∃ nf. isroot(g)(nf(0)) ∧ pathp(g)(⌜nf⌝ )
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ infgraph ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ∧ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ∧ finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ∧ allreachable ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ nf. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(0)) ∧ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦
Used terms: (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| infgraph(g), finroot(g), finout(g), allreachable(g) ⊦ ∃ nf. isroot(g)(nf(0)) ∧ pathp(g)(⌜nf⌝ ) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ infgraph ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ∧ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ∧ finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ∧ allreachable ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ infgraph ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ allreachable ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ infgraph ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
⊦ infgraph(g) ↔ (∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s)
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ _s. ∃ _a. dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ ¬ _a ∈ _s
Used terms: (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ infgraph(g) ↔ (∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ _s. ∃ _a. dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: ⊦ dom(vs × es) = vs; (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ n. ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s, ∃ n. ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝
Used formulas: ∃ n. ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ n. ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), finp(⌜af to n⌝ ) ∧ ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used terms: ⌜af to n⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), finp(⌜af to n⌝ ) ∧ ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: ⊦ finp(⌜nf to n⌝ ); (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ ⌜af to n⌝ ≤ ⌜af⌝ , ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used formulas: ⌜af to n⌝ ≤ ⌜af⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), trace(IOAut(startf, stepf))(⌜af to n⌝ ), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), trace(IOAut(startf, stepf))(⌜af to n⌝ ), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∃ σ, β. ⌜af to n⌝ = β ^ ∧ exec(IOAut(startf, stepf))(σ, β) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used terms: ⌜af to n⌝ , stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∃ σ, β. ⌜af to n⌝ = β ^ ∧ exec(IOAut(startf, stepf))(σ, β) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = α ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| ⌜af to n⌝ = α ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
α = ⌜al0⌝ , ⌜af to n⌝ = α ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
α = ⌜af0⌝ , ⌜af to n⌝ = α ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| α = ⌜al0⌝ , ⌜af to n⌝ = α ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
σ = ⌜sl0⌝ , ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| σ = ⌜sl0⌝ , ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sl0.last), endstate(⌜af to n⌝ × sl0.last)) ∧ actstream(⌜af to n⌝ × sl0.last) ≤ ⌜af⌝ ∧ finp(actstream(⌜af to n⌝ × sl0.last)) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s
Used terms: ⌜af to n⌝ × sl0.last
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sl0.last), endstate(⌜af to n⌝ × sl0.last)) ∧ actstream(⌜af to n⌝ × sl0.last) ≤ ⌜af⌝ ∧ finp(actstream(⌜af to n⌝ × sl0.last)) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s
Used simplifier rules: ⊦ finp(⌜nf to n⌝ ); (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s)
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ × sl0.last ∈ _s ∧ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sl0.last), endstate(⌜af to n⌝ × sl0.last)) → # actstream(⌜af to n⌝ × sl0.last) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s
Used terms: ⌜af to n⌝ × sl0.last
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ × sl0.last ∈ _s ∧ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sl0.last), endstate(⌜af to n⌝ × sl0.last)) → # actstream(⌜af to n⌝ × sl0.last) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s, ⌜af to n⌝ × sl0.last ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last)
Used simplifier rules: ⊦ ¬ n < n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s)
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s, ⌜af to n⌝ × sl0.last ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ⌜af to n⌝ × sl0.last ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last), after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s
Used formulas: after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last)
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ⌜af to n⌝ × sl0.last ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last), after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last) ∧ ¬ ⌜af to n⌝ × sl0.last ∈ _s |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜af to n⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0.last = σ.l.last) ⊦
Used terms: sl0.last, ⌜af to n⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜af to n⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0.last = σ.l.last) ⊦ |
⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. α ^ ≠ ⌜af to n⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sl0.last ≠ σ.l.last ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜af to n⌝ = ⌜al0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ), startf(sl0[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. α ^ ≠ ⌜af to n⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sl0.last ≠ σ.l.last ⊦ |
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al0⌝ , ⌜sl0⌝
| α = ⌜af0⌝ , ⌜af to n⌝ = α ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
| ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)
⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # ⌜af0⌝ ^ < ⌜n⌝ → (∃ m. ¬ # ⌜af0⌝ < ⌜m⌝ ∧ ⌜af0⌝ ^ to n = (⌜af0⌝ to m)^), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used terms: ⌜af0⌝ , n
| ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) |
| ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # ⌜af0⌝ ^ < ⌜n⌝ → (∃ m. ¬ # ⌜af0⌝ < ⌜m⌝ ∧ ⌜af0⌝ ^ to n = (⌜af0⌝ to m)^), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: ⊦ (nf to n) to n = nf to n; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ¬ n < n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
σ = ⌜sf0⌝ , ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s)
| σ = ⌜sf0⌝ , ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ), startf(σ[0]), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sf0(n0)), endstate(⌜af to n⌝ × sf0(n0))) ∧ actstream(⌜af to n⌝ × sf0(n0)) ≤ ⌜af⌝ ∧ finp(actstream(⌜af to n⌝ × sf0(n0))) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s
Used terms: ⌜af to n⌝ × sf0(n0)
| ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sf0(n0)), endstate(⌜af to n⌝ × sf0(n0))) ∧ actstream(⌜af to n⌝ × sf0(n0)) ≤ ⌜af⌝ ∧ finp(actstream(⌜af to n⌝ × sf0(n0))) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s
Used simplifier rules: ⊦ finp(⌜nf to n⌝ ); (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s |
⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ × sf0(n0) ∈ _s ∧ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sf0(n0)), endstate(⌜af to n⌝ × sf0(n0))) → # actstream(⌜af to n⌝ × sf0(n0)) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s
Used terms: ⌜af to n⌝ × sf0(n0)
| ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜af to n⌝ × sf0(n0) ∈ _s ∧ after(IOAut(startf, stepf))(actstream(⌜af to n⌝ × sf0(n0)), endstate(⌜af to n⌝ × sf0(n0))) → # actstream(⌜af to n⌝ × sf0(n0)) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s, ⌜af to n⌝ × sf0(n0) ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0))
Used simplifier rules: ⊦ ¬ n < n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s, ⌜af to n⌝ × sf0(n0) ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) |
⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ⌜af to n⌝ × sf0(n0) ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)), after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s
Used formulas: after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0))
| ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ⌜af to n⌝ × sf0(n0) ∈ _s ∧ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)), after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)) ∧ ¬ ⌜af to n⌝ × sf0(n0) ∈ _s |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜af to n⌝ , sf0(n0)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜af to n⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sf0(n0) = σ.l.last) ⊦
Used terms: sf0(n0), ⌜af to n⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜af to n⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sf0(n0) = σ.l.last) ⊦ |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. α ^ ≠ ⌜af to n⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sf0(n0) ≠ σ.l.last ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. α ^ ≠ ⌜af to n⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sf0(n0) ≠ σ.l.last ⊦ |
⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜af0 to n0⌝ ^ ≠ ⌜af to n⌝ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0 + 1⌝ , ⌜af0 to n0⌝ ) ∨ ¬ startf(⌜sf0 to n0 + 1⌝ [0]) ∨ ¬ finp(⌜af0 to n0⌝ ) ∨ sf0(n0) ≠ ⌜sf0 to n0 + 1⌝ .l.last ⊦
Used terms: ⌜af0 to n0⌝ , ⌜sf0 to n0 + 1⌝
| ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜af0 to n0⌝ ^ ≠ ⌜af to n⌝ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0 + 1⌝ , ⌜af0 to n0⌝ ) ∨ ¬ startf(⌜sf0 to n0 + 1⌝ [0]) ∨ ¬ finp(⌜af0 to n0⌝ ) ∨ sf0(n0) ≠ ⌜sf0 to n0 + 1⌝ .l.last ⊦ |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0 + 1⌝ , ⌜af0 to n0⌝ ) ∨ sf0(n0) ≠ (sf0 to n0 + 1).last ⊦
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜nf to n⌝ ); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0 + 1⌝ , ⌜af0 to n0⌝ ) ∨ sf0(n0) ≠ (sf0 to n0 + 1).last ⊦ |
⊦ nf to m + 1 = (nf to m) + nf(m) '
⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜(sf0 to n0) + sf0(n0) '⌝ , ⌜af0 to n0⌝ ) ∨ sf0(n0) ≠ ((sf0 to n0) + sf0(n0) ').last ⊦
Used terms: n0, sf0
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜(sf0 to n0) + sf0(n0) '⌝ , ⌜af0 to n0⌝ ) ∨ sf0(n0) ≠ ((sf0 to n0) + sf0(n0) ').last ⊦ |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0⌝ + ⌜sf0(n0) '⌝ , ⌜af0 to n0⌝ ), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0⌝ + ⌜sf0(n0) '⌝ , ⌜af0 to n0⌝ ), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(startf, stepf))(σ to n + 1, α to n)
⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0⌝ + ⌜sf0(n0) '⌝ , ⌜af0 to n0⌝ ), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ∧ ¬ # ⌜af0⌝ < ⌜n0⌝ → frag*(IOAut(startf, stepf))(⌜sf0⌝ to n0 + 1, ⌜af0⌝ to n0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used terms: startf, stepf, ⌜sf0⌝ , ⌜af0⌝ , n0
| ⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(startf, stepf))(σ to n + 1, α to n) |
| ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ⌜af to n⌝ = ⌜af0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0⌝ + ⌜sf0(n0) '⌝ , ⌜af0 to n0⌝ ), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ∧ ¬ # ⌜af0⌝ < ⌜n0⌝ → frag*(IOAut(startf, stepf))(⌜sf0⌝ to n0 + 1, ⌜af0⌝ to n0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), frag(IOAut(startf, stepf))(⌜sf0 to n0 + 1⌝ , ⌜af0 to n0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0⌝ + ⌜sf0(n0) '⌝ , ⌜af0 to n0⌝ ), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: ⊦ finp(⌜nf to n⌝ ); (s) ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af to n⌝ = ⌜af0⌝ ^, ⌜af to n⌝ = ⌜af0 to n0⌝ ^, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), frag(IOAut(startf, stepf))(⌜sf0 to n0 + 1⌝ , ⌜af0 to n0⌝ ), startf(sf0(0)), ⌜af to n⌝ ≤ ⌜af⌝ , ¬ frag(IOAut(startf, stepf))(⌜sf0 to n0⌝ + ⌜sf0(n0) '⌝ , ⌜af0 to n0⌝ ), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ nf to m + 1 = (nf to m) + nf(m) '
Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: n0, sf0
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ ⌜af to n⌝ ≤ ⌜af⌝ , ⌜af to n⌝ ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(⌜af to n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ ⌜af to n⌝ ≤ ⌜af⌝ , ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ ⌜af to n⌝ ≤ ⌜af⌝ , ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α. ⌜af to n⌝ + α ≠ ⌜af⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s
Used terms: ⌜af⌝ , ⌜af to n⌝
| ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α. ⌜af to n⌝ + α ≠ ⌜af⌝ ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s |
Used simplifier rules: ⊦ ⌜nf to n⌝ + ⌜nf from n⌝ = ⌜nf⌝ ↔ true; (ss) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: ⌜af from n⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. after(IOAut(startf, stepf))(actstream(_a), endstate(_a)) ∧ actstream(_a) ≤ ⌜af⌝ ∧ finp(actstream(_a)) ∧ ¬ _a ∈ _s, ∃ n. ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ αs. αs ∈ _s ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ af, startf, stepf. ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ n. ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ) ⊦ ∃ n. ∀ αs. αs ∈ _s0 ++ afterpair ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝
Used simplifier rules: afterpairset generated by ∅, ++;; ⊦ ¬ a ∈ ∅; (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ af, startf, stepf. ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ n. ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ) ⊦ ∃ n. ∀ αs. αs ∈ _s0 ++ afterpair ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ af, startf, stepf. ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ n. ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
Used simplifier rules: ⊦ a ∈ s ++ b ↔ a = b ∨ a ∈ s; (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ af, startf, stepf. ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ n. ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ n. ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
Used terms: af, startf, stepf
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ n. ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ , ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
Used terms: n
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ , ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # actstream(afterpair0) < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , afterpair0 = afterpair ∨ afterpair0 ∈ _s0 ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
| after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # actstream(afterpair0) < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , afterpair0 = afterpair ∨ afterpair0 ∈ _s0 ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
afterpair0 = α × s, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), afterpair0 = afterpair ∨ afterpair0 ∈ _s0 ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: afterpair0, ασ, st
| afterpair0 = α × s, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), afterpair0 = afterpair ∨ afterpair0 ∈ _s0 ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , α × s = afterpair ∨ α × s ∈ _s0 ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
| after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , α × s = afterpair ∨ α × s ∈ _s0 ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
α × s = afterpair, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), α × s ∈ _s0, ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
| α × s = afterpair, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ n. ∀ afterpair0. (afterpair0 = α × s ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
| after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ n. ∀ afterpair0. (afterpair0 = α × s ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α0, σ. α0 ^ = α ∧ exec*(IOAut(startf, stepf))(σ, α0) ∧ s = σ.l.last ⊦ ∃ n. ∀ afterpair0. (afterpair0 = α × s ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
Used terms: s, α, stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α0, σ. α0 ^ = α ∧ exec*(IOAut(startf, stepf))(σ, α0) ∧ s = σ.l.last ⊦ ∃ n. ∀ afterpair0. (afterpair0 = α × s ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ n. ∀ afterpair0. (afterpair0 = ⌜al⌝ ^ × σ.l.last ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ ∃ n. ∀ afterpair0. (afterpair0 = ⌜al⌝ ^ × σ.l.last ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ afterpair0. (afterpair0 = ⌜al⌝ ^ × σ.l.last ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜# al + 1⌝
Used terms: # al + 1
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ afterpair0. (afterpair0 = ⌜al⌝ ^ × σ.l.last ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜# al + 1⌝ |
# _s0 ≠ 0, _s0 ≠ ∅, afterpair0 ≠ ⌜al⌝ ^ × σ.l.last, ⌜# al⌝ < # actstream(afterpair0), after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), afterpair0 ∈ _s0, ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦
Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[Koenigs-Lemma-gen-behact] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[Koenigs-Lemma-gen-behact] ⊦ ¬ ⌜# al⌝ < # ⌜al⌝ ^; (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # _s0 ≠ 0, _s0 ≠ ∅, afterpair0 ≠ ⌜al⌝ ^ × σ.l.last, ⌜# al⌝ < # actstream(afterpair0), after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), afterpair0 ∈ _s0, ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ |
afterpair0 = α × s, # _s0 ≠ 0, _s0 ≠ ∅, afterpair0 ≠ ⌜al⌝ ^ × σ.l.last, ⌜# al⌝ < # α, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), afterpair0 ∈ _s0, ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: afterpair0, ασ, st
| afterpair0 = α × s, # _s0 ≠ 0, _s0 ≠ ∅, afterpair0 ≠ ⌜al⌝ ^ × σ.l.last, ⌜# al⌝ < # α, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), afterpair0 ∈ _s0, ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
# _s0 ≠ 0, _s0 ≠ ∅, α × s ≠ ⌜al⌝ ^ × σ.l.last, ⌜# al⌝ < # α, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), α × s ∈ _s0, ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦
| # _s0 ≠ 0, _s0 ≠ ∅, α × s ≠ ⌜al⌝ ^ × σ.l.last, ⌜# al⌝ < # α, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), α × s ∈ _s0, ¬ # ⌜al⌝ ^ < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ ⊦ |
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ m < n → n ≠ 0; (s) ⊦ ¬ ⌜# al⌝ < # ⌜al⌝ ^; (s) Used terms: α × s
| after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), α × s ∈ _s0, ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
# _s0 ≠ 0, _s0 ≠ ∅, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), α × s ∈ _s0, ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝
Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[Koenigs-Lemma-gen-behact] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[Koenigs-Lemma-gen-behact]
| # _s0 ≠ 0, _s0 ≠ ∅, after(IOAut(startf, stepf))(α, s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), α × s ∈ _s0, ¬ # α < ⌜n⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ αs. αs ∈ _s0 ∧ after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) → # actstream(αs) < ⌜n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ n. ∀ afterpair0. (afterpair0 = afterpair ∨ afterpair0 ∈ _s0) ∧ after(IOAut(startf, stepf))(actstream(afterpair0), endstate(afterpair0)) → # actstream(afterpair0) < ⌜n⌝ |
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s) Used terms: α × s
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
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))))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ fin(IOAut(startf, stepf)) ∧ (∀ α0. finp(α0) ∧ α0 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α0)), finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
Used terms: ⌜af⌝ , stepf, startf
| 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)))) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ fin(IOAut(startf, stepf)) ∧ (∀ α0. finp(α0) ∧ α0 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α0)), finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ trace(IOAut(startf, stepf))(⌜al⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ trace(IOAut(startf, stepf))(⌜al⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
fin(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))))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ fin(IOAut(startf, stepf)) ∧ (∀ α0. finp(α0) ∧ α0 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α0)), finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
Used terms: ⌜af⌝ , stepf, startf
| fin(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)))) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ fin(IOAut(startf, stepf)) ∧ (∀ α0. finp(α0) ∧ α0 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α0)), finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ trace(IOAut(startf, stepf))(⌜al⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2))))
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ trace(IOAut(startf, stepf))(⌜al⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ finout ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ allreachable ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) |
⊦ allreachable(g) ↔ (∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ b. dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (b) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, b))
Used terms: (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ allreachable(g) ↔ (∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b))) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ b. dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (b) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, b)) |
⌜al⌝ = actstream(b), after(IOAut(startf, stepf))(⌜al⌝ , endstate(b)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, b)
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ dom(vs × es) = vs; (s)
| ⌜al⌝ = actstream(b), after(IOAut(startf, stepf))(⌜al⌝ , endstate(b)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, b) |
b = α × s, ⌜al⌝ = α, after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, b)
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: b, ασ, st
| b = α × s, ⌜al⌝ = α, after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, b) |
after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s)
| after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s) |
after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s)
Used simplifier rules: <; (wellfounded) Used terms: # al
| after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s) |
after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s)
| after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s) |
al = [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s)
al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s)
Used formulas: al = []
| al = [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s) |
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, [] × s)
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ [] ≤ σ; (s)
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, [] × s) |
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s, [] × s)
Used terms: [] × s
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s, [] × s) |
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s)
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s, [] × s)
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s) |
⊦ isroot(g)(b) ↔ dom(g)(b) ∧ (∀ a. ¬ edge(g)(a, b))
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s) ∧ (∀ _a. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, [] × s))
Used terms: [] × s, (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ isroot(g)(b) ↔ dom(g)(b) ∧ (∀ a. ¬ edge(g)(a, b)) |
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s) ∧ (∀ _a. ¬ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, [] × s)) |
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, [] × s), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦
Used simplifier rules: ⊦ finp([]); (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ [] ≤ σ; (s) ⊦ endstate(ασ × st) = st; (s) ⊦ dom(vs × es) = vs; (s)
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, [] × s), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
Used simplifier rules: ⊦ actstream(ασ × st) = ασ; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: [] × s, _a, λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ([] × s, [] × s) |
⊦ path(g)(a, b) ↔ (∃ x. pathp(g)(⌜x⌝ ) ∧ x ≠ [] ∧ a = x.head ∧ b = x.last)
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ x. pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ) ∧ x ≠ [] ∧ [] × s = x.head ∧ [] × s = x.last
Used terms: [] × s, [] × s, (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ path(g)(a, b) ↔ (∃ x. pathp(g)(⌜x⌝ ) ∧ x ≠ [] ∧ a = x.head ∧ b = x.last) |
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ x. pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ) ∧ x ≠ [] ∧ [] × s = x.head ∧ [] × s = x.last |
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜([] × s)'⌝ ) ∧ ([] × s)' ≠ [] ∧ [] × s = ([] × s)'.head ∧ [] × s = ([] × s)'.last
Used terms: ([] × s)'
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜([] × s)'⌝ ) ∧ ([] × s)' ≠ [] ∧ [] × s = ([] × s)'.head ∧ [] × s = ([] × s)'.last |
after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜([] × s)'⌝ )
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ a '.head = a; (s) ⊦ a ' ≠ []; (s)
| after(IOAut(startf, stepf))([], s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # [] → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜([] × s)'⌝ ) |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) ⊦ dom(vs × es) = vs; (s) ⊦ endstate(ασ × st) = st; (s) ⊦ [] ≤ σ; (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ finp([]); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ ↔ n∞2 < ⌜n - m⌝ ); (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < 0; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf Used terms: ⌜([] × s)'⌝ , (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s) |
al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ al0, a. al0 + a = al, ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s)
al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s), ∃ al0, a. al0 + a = al
Used formulas: ∃ al0, a. al0 + a = al
| al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ al0, a. al0 + a = al, ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s) |
after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a = x + a '; (s) ⊦ x + a ' ≠ []; (s)
| after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s) |
a = τ, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s)
a ≠ τ, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s)
Used formulas: a = τ
| a = τ, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s) |
after(IOAut(startf, stepf))(⌜al0⌝ + ⌜τ '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜τ '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + τ) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜τ '⌝ ) × s)
| after(IOAut(startf, stepf))(⌜al0⌝ + ⌜τ '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜τ '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + τ) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜τ '⌝ ) × s) |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
Used simplifier rules: ⊦ α0 ^ = α + ⌜τ '⌝ ↔ ¬ ¬(α0 ^ = α ∧ ¬ finp(α)); (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: s, ⌜al0⌝ + ⌜τ '⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| a ≠ τ, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s) |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α, σ. α ^ = ⌜al0⌝ + ⌜a '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s)
Used terms: s, ⌜al0⌝ + ⌜a '⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α, σ. α ^ = ⌜al0⌝ + ⌜a '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, (⌜al0⌝ + ⌜a '⌝ ) × s) |
⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α)
⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = ⌜a '⌝ ∧ α1 + α2 = ⌜al⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
Used terms: ⌜al⌝ , al0, ⌜a '⌝
| ⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) |
| ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = ⌜a '⌝ ∧ α1 + α2 = ⌜al⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
α1 + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , α1 ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
| α1 + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , α1 ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
α1 + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , α1 = ⌜al1⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s)
| α1 + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , α1 = ⌜al1⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last), after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2))
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × σ[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
Used simplifier rules: ⊦ x + a = x + a '; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ # a ' = 0 +1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: al0, startf, stepf, σ[# al1], af
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last), after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last), after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]) ∧ ⌜al0⌝ ≤ ⌜af⌝
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last), after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]) ∧ ⌜al0⌝ ≤ ⌜af⌝ |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ , σ[# al1]), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ0. ¬(α ^ = ⌜al0⌝ ∧ exec*(IOAut(startf, stepf))(σ0, α) ∧ σ[# al1] = σ0.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: σ[# al1], ⌜al0⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ0. ¬(α ^ = ⌜al0⌝ ∧ exec*(IOAut(startf, stepf))(σ0, α) ∧ σ[# al1] = σ0.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ0. α ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ0, α) ∨ ¬ startf(σ0[0]) ∨ ¬ finp(α) ∨ σ[# al1] ≠ σ0.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ0. α ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ0, α) ∨ ¬ startf(σ0[0]) ∨ ¬ finp(α) ∨ σ[# al1] ≠ σ0.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜al1⌝ ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ to # al1 + 1, ⌜al1⌝ ) ∨ ¬ startf((σ to # al1 + 1)[0]) ∨ ¬ finp(⌜al1⌝ ) ∨ σ[# al1] ≠ (σ to # al1 + 1).l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: ⌜al1⌝ , σ to # al1 + 1
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜al1⌝ ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ to # al1 + 1, ⌜al1⌝ ) ∨ ¬ startf((σ to # al1 + 1)[0]) ∨ ¬ finp(⌜al1⌝ ) ∨ σ[# al1] ≠ (σ to # al1 + 1).l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(σ to # al1 + 1, ⌜al1⌝ ) ∨ ¬ startf((σ to # al1 + 1)[0]) ∨ σ[# al1] ≠ (σ to # al1 + 1).l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(σ to # al1 + 1, ⌜al1⌝ ) ∨ ¬ startf((σ to # al1 + 1)[0]) ∨ σ[# al1] ≠ (σ to # al1 + 1).l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , σ = ⌜sl0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(σ to # al1 + 1, ⌜al1⌝ ) ∨ ¬ startf((σ to # al1 + 1)[0]) ∨ σ[# al1] ≠ (σ to # al1 + 1).l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , σ = ⌜sl0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(σ to # al1 + 1, ⌜al1⌝ ) ∨ ¬ startf((σ to # al1 + 1)[0]) ∨ σ[# al1] ≠ (σ to # al1 + 1).l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , α2 = ⌜al2⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ σ + ⌜nf0⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , α2 = ⌜al2⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(startf, stepf))(σ to n + 1, α to n)
⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ) ∧ ¬ #(⌜al1⌝ + ⌜al2⌝ ) < ⌜# al1⌝ → frag*(IOAut(startf, stepf))(⌜sl0⌝ to # al1 + 1, ⌜al1⌝ + ⌜al2⌝ to # al1), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: startf, stepf, ⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ , # al1
| ⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(startf, stepf))(σ to n + 1, α to n) |
| ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ) ∧ ¬ #(⌜al1⌝ + ⌜al2⌝ ) < ⌜# al1⌝ → frag*(IOAut(startf, stepf))(⌜sl0⌝ to # al1 + 1, ⌜al1⌝ + ⌜al2⌝ to # al1), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ to # x = ⌜x⌝ ; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
¬ # x < n, m < n ⊦ (x to n)[m] = x[m]
⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ¬ # sl0 < # al1 + 1 ∧ 0 < # al1 + 1
⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, 0 < # al1 + 1, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # sl0 < # al1 + 1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf(sl0[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: 0, # al1 + 1, sl0
| ¬ # x < n, m < n ⊦ (x to n)[m] = x[m] |
| ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ¬ # sl0 < # al1 + 1 ∧ 0 < # al1 + 1 |
⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl0⌝ = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), # sl0 ≤ # al1, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf(⌜sl0⌝ [n], (⌜al1⌝ + ⌜al2⌝ )[n], ⌜sl0⌝ [n +1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: ⌜al1⌝ + ⌜al2⌝ , ⌜sl0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl0⌝ = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), # sl0 ≤ # al1, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf(⌜sl0⌝ [n], (⌜al1⌝ + ⌜al2⌝ )[n], ⌜sl0⌝ [n +1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 + # al2 + 1 = # sl0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. n < # al1 + # al2 → stepf(sl0[n], (al1 + al2)[n], sl0[n + 1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al1 + # al2 + 1 = # sl0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. n < # al1 + # al2 → stepf(sl0[n], (al1 + al2)[n], sl0[n + 1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , a ≠ τ, 0 < # al1 + 1, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # sl0 < # al1 + 1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf(sl0[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(hd(sl0)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(hd(sl0)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , sl0 = s0 + sl, sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: sl0, s0, y
| ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , sl0 = s0 + sl, sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x to n + 1 = a + (x to n); (s) ⊦ a ' + x ≠ []; (s)
| ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜s0 '⌝ + ⌜sl⌝ ) = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf((⌜s0 '⌝ + ⌜sl⌝ )[n], (⌜al1⌝ + ⌜al2⌝ )[n], (⌜s0 '⌝ + ⌜sl⌝ )[n +1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: ⌜al1⌝ + ⌜al2⌝ , ⌜s0 '⌝ + ⌜sl⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜s0 '⌝ + ⌜sl⌝ ) = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf((⌜s0 '⌝ + ⌜sl⌝ )[n], (⌜al1⌝ + ⌜al2⌝ )[n], (⌜s0 '⌝ + ⌜sl⌝ )[n +1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 + # al2 = # sl, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. n < # sl → stepf((s0 ' + sl)[n], (al1 + al2)[n], sl[n]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # al1 + # al2 = # sl, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. n < # sl → stepf((s0 ' + sl)[n], (al1 + al2)[n], sl[n]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ x ≠ [] → x[# x - 1] = x.last
# al1 + # al2 = # sl, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , s0 ' + (sl to # al1) ≠ [], (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1))[#(s0 ' + (sl to # al1)) - 1], a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n. n < # sl → stepf((s0 ' + sl)[n], (al1 + al2)[n], sl[n]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: s0 ' + (sl to # al1)
| ⊦ x ≠ [] → x[# x - 1] = x.last |
| # al1 + # al2 = # sl, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , s0 ' + (sl to # al1) ≠ [], (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1))[#(s0 ' + (sl to # al1)) - 1], a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n. n < # sl → stepf((s0 ' + sl)[n], (al1 + al2)[n], sl[n]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 + # al2 = # sl, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1))[# al1], a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. n < # sl → stepf((s0 ' + sl)[n], (al1 + al2)[n], sl[n]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m +1 = m + 1; (s) ¬ # x < n ⊦ #(x to n) = n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s)
| # al1 + # al2 = # sl, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , (s0 ' + sl)[# al1] ≠ (s0 ' + (sl to # al1))[# al1], a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s0 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), startf(s0), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. n < # sl → stepf((s0 ' + sl)[n], (al1 + al2)[n], sl[n]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ m < 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ n + 0 = n; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ 0 ≤ m; (s) ⊦ x to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ σ + [] = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜[]⌝ = []; (s) ⊦ frag(IOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ # [] = 0; (s) ⊦ # a ' = 0 +1; (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ n < # x → (x + y)[n] = x[n]; (s) Used terms: # al1, sl, s0 '
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ0 + σ1 ≤ σ → (σ0 ≤ σ ↔ true); (ss)
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × σ[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × σ[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × σ[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , σ = ⌜sl0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × σ[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last)
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , σ = ⌜sl0⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), startf(σ[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × σ[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × σ.l.last) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a0. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ ^ × sl0.last)
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ _a0. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ ^ × sl0.last) |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last)
Used terms: _a
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last) |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last)
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × sl0[# al1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last) |
⊦ path(g)(a, b) ↔ (∃ x. pathp(g)(⌜x⌝ ) ∧ x ≠ [] ∧ a = x.head ∧ b = x.last)
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ x. pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ) ∧ x ≠ [] ∧ _a = x.head ∧ ⌜al0⌝ × sl0[# al1] = x.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last)
Used terms: ⌜al0⌝ × sl0[# al1], _a, (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ path(g)(a, b) ↔ (∃ x. pathp(g)(⌜x⌝ ) ∧ x ≠ [] ∧ a = x.head ∧ b = x.last) |
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ x. pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ) ∧ x ≠ [] ∧ _a = x.head ∧ ⌜al0⌝ × sl0[# al1] = x.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ ^ × sl0.last) |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x.last, a ≠ τ, x ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (x.head, ⌜al⌝ ^ × sl0.last)
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x.last, a ≠ τ, x ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (x.head, ⌜al⌝ ^ × sl0.last) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , x = _a0 + x0, ⌜al0⌝ × sl0[# al1] = x.last, a ≠ τ, x ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ ^ × sl0.last)
Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: x, _a0, y
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , x = _a0 + x0, ⌜al0⌝ × sl0[# al1] = x.last, a ≠ τ, x ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ ^ × sl0.last) |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ ^ × sl0.last)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a0, ⌜al⌝ ^ × sl0.last) |
⊦ path(g)(a, b) ↔ (∃ x. pathp(g)(⌜x⌝ ) ∧ x ≠ [] ∧ a = x.head ∧ b = x.last)
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ x. pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ) ∧ x ≠ [] ∧ _a0 = x.head ∧ ⌜al⌝ ^ × sl0.last = x.last
Used terms: ⌜al⌝ ^ × sl0.last, _a0, (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ path(g)(a, b) ↔ (∃ x. pathp(g)(⌜x⌝ ) ∧ x ≠ [] ∧ a = x.head ∧ b = x.last) |
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ∃ x. pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜x⌝ ) ∧ x ≠ [] ∧ _a0 = x.head ∧ ⌜al⌝ ^ × sl0.last = x.last |
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last))⌝ ) ∧ _a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last)) ≠ [] ∧ _a0 = (_a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last))).head ∧ ⌜al⌝ ^ × sl0.last = (_a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last))).last
Used terms: _a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last))
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last))⌝ ) ∧ _a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last)) ≠ [] ∧ _a0 = (_a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last))).head ∧ ⌜al⌝ ^ × sl0.last = (_a0 ' + (x0 + (⌜al0 + a '⌝ × sl0.last))).last |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ )
Used simplifier rules: ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ (a ' + x + b ').last = b; (s) ⊦ x + a = x + a '; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ (a ' + x).head = a; (s) ⊦ a ' + x ≠ []; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ ) |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∀ n. ⌜n⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ ) → dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ )[n])) ∧ (∀ n. ⌜n + 1⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ ) → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ )[n], (⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ )[n + 1]))
Used terms: ⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ , (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ⌜al1⌝ + α2 = ⌜al⌝ , α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∀ n. ⌜n⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ ) → dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ )[n])) ∧ (∀ n. ⌜n + 1⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ ) → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ )[n], (⌜_a0 '⌝ + ⌜x0⌝ + ⌜(⌜al⌝ ^ × sl0.last)'⌝ )[n + 1])) |
⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ( n < 2 + # x0 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n]), endstate((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n])) ∧ actstream((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n]))) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]))
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[Koenigs-Lemma-gen-behact] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ (⌜x⌝ + ⌜x0⌝ + ⌜x1⌝ )[m] = (x + x0 + x1)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ dom(vs × es) = vs; (s) ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ( n < 2 + # x0 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n]), endstate((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n])) ∧ actstream((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n]))) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (n < 2 + # x0 → after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]))
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n], ασ, st
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜_a0 '⌝ + ⌜x0⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (n < 2 + # x0 → after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])) |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n. ⌜n⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ ) → dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ ) → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ )[n], (⌜_a0 '⌝ + ⌜x0⌝ )[n + 1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (n < 2 + # x0 → after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]))
Used terms: ⌜_a0 '⌝ + ⌜x0⌝ , (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n. ⌜n⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ ) → dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜_a0 '⌝ + ⌜x0⌝ ) → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((⌜_a0 '⌝ + ⌜x0⌝ )[n], (⌜_a0 '⌝ + ⌜x0⌝ )[n + 1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (n < 2 + # x0 → after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (n < 2 + # x0 → after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ dom(vs × es) = vs; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[Koenigs-Lemma-gen-behact] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (n < 2 + # x0 → after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)) ∧ ( ¬ # x0 < n0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ # x0 < n0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n]), endstate((_a0 ' + x0)[n])) ∧ actstream((_a0 ' + x0)[n]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used terms: n
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n]), endstate((_a0 ' + x0)[n])) ∧ actstream((_a0 ' + x0)[n]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, (_a0 ' + x0)[n] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: (_a0 ' + x0)[n], ασ, st
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, (_a0 ' + x0)[n] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⊦ n < # x → (x + y)[n] = x[n]
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0)[n] = α0 × s1, (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n < # _a0 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used simplifier rules: ⊦ n < # x → (x + y)[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ a '[0] = a; (s) ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws) ⊦ 0 < m ↔ m ≠ 0; (s) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ¬ n < 0; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] Used terms: n, x0, _a0 '
| ⊦ n < # x → (x + y)[n] = x[n] |
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0)[n] = α0 × s1, (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n < # _a0 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⌜al1⌝ + α2 = ⌜al⌝ , (x0 + (⌜al⌝ ^ × sl0.last)')[n - 1] = α × s0, x0[n - 1] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n ≠ 0, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used simplifier rules: ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (x0 + (⌜al⌝ ^ × sl0.last)')[n - 1] = α × s0, x0[n - 1] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n ≠ 0, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⌜al1⌝ + α2 = ⌜al⌝ , x0[n0] = α0 × s1, (x0 + (⌜al⌝ ^ × sl0.last)')[n0] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , n = n0 + 1, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n ≠ 0, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m
| ⌜al1⌝ + α2 = ⌜al⌝ , x0[n0] = α0 × s1, (x0 + (⌜al⌝ ^ × sl0.last)')[n0] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , n = n0 + 1, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n ≠ 0, n < 2 + # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ¬ # x0 < n → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⌜al1⌝ + α2 = ⌜al⌝ , (x0 + (⌜al⌝ ^ × sl0.last)')[n0] = α × s0, x0[n0] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) n < n0 ⊦ m + (* n) < m0 + (* n0) ↔ m < m0 + (n0 - n); (s) ⊦ m + 1 ≠ 0; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (x0 + (⌜al⌝ ^ × sl0.last)')[n0] = α × s0, x0[n0] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⊦ n < # x → (x + y)[n] = x[n]
⌜al1⌝ + α2 = ⌜al⌝ , x0[n0] = α0 × s1, (x0 + (⌜al⌝ ^ × sl0.last)')[n0] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), n0 ≤ # x0, ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n0 < # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α)
Used simplifier rules: ⊦ m < n → m ≤ n; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws) ⊦ # x = 0 ↔ x = []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ finp(⌜x⌝ ); (s) Used terms: n0, (⌜al⌝ ^ × sl0.last)', x0
| ⊦ n < # x → (x + y)[n] = x[n] |
| ⌜al1⌝ + α2 = ⌜al⌝ , x0[n0] = α0 × s1, (x0 + (⌜al⌝ ^ × sl0.last)')[n0] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), n0 ≤ # x0, ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n0 < # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → after(IOAut(startf, stepf))(α0, s1) ∧ α0 ≤ ⌜af⌝ ∧ finp(α0), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ after(IOAut(startf, stepf))(α, s0) ∧ α ≤ ⌜af⌝ ∧ finp(α) |
⌜al1⌝ + α2 = ⌜al⌝ , x0[# x0] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al⌝ ^, sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ finp(⌜al⌝ ^); (s) ⊦ ¬ n < n; (s) ⊦ m ≤ m; (s) ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws) ⊦ a '[0] = a; (s) ⊦ m - m = 0; (s) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , x0[# x0] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al⌝ ^, sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
⌜al1⌝ + α2 = ⌜al⌝ , x0[# x0] = α0 × s1, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α, σ. ¬(α ^ = ⌜al⌝ ^ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0.last = σ.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: sl0.last, ⌜al⌝ ^, stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ⌜al1⌝ + α2 = ⌜al⌝ , x0[# x0] = α0 × s1, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α, σ. ¬(α ^ = ⌜al⌝ ^ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0.last = σ.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⌜al1⌝ + α2 = ⌜al⌝ , x0[# x0] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. α ^ ≠ ⌜al⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sl0.last ≠ σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , x0[# x0] = α0 × s1, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. α ^ ≠ ⌜al⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sl0.last ≠ σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al⌝ , ⌜sl0⌝
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ # x0 < n0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ m < n ↔ ¬ n ≤ m; (ss)
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. n1 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n1], x0[n1]), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), n0 ≤ # x0, ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])
Used terms: n0
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), n0 ≤ # x0, ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n0 ≠ # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , n0 = # x0, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0])
Used formulas: n0 ≠ # x0
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, n0 ≠ # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m ≠ n → (m ≤ n ↔ m < n); (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0]) |
⊦ n < # x → (x + y)[n] = x[n]
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n0 < # _a0 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0])
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '[0] = a; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ x ≠ [] → x[0] = x.head; (s) Used terms: n0, x0, _a0 '
| ⊦ n < # x → (x + y)[n] = x[n] |
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n0 < # _a0 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0]) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, n0 ≠ 0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, n0 ≠ 0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0]) |
⊦ n < # x → (x + y)[n] = x[n]
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, n0 ≠ 0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n0 < # _a0 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0])
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] Used terms: n0, x0 + (⌜al⌝ ^ × sl0.last)', _a0 '
| ⊦ n < # x → (x + y)[n] = x[n] |
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, n0 ≠ 0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ n0 < # _a0 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0]) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, n0 ≠ 0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = x0.last, a ≠ τ, n0 ≠ # x0, n0 ≠ 0, x0 ≠ [], n0 < # x0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], x0[n0]) |
⊦ n < # x → (x + a ')[n] = x[n]
Used simplifier rules: ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ m ≠ n → (m < n + 1 ↔ m < n); (s) ⊦ m ≠ n → (m < n ↔ ¬ n < m); (ss) ⊦ m < n → ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n0, ⌜al⌝ ^ × sl0.last, _a0 ' + x0
| ⊦ n < # x → (x + a ')[n] = x[n] |
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , n0 = # x0, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , n0 ≤ # x0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), n0 < # x0 → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0)[n0], x0[n0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) ((_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n0], (x0 + (⌜al⌝ ^ × sl0.last)')[n0]) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜al0⌝ × sl0[# al1], ⌜al⌝ ^ × sl0.last)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ (x + a ')[# x] = a; (s) ⊦ (a ' + x + y)[# x] = (a ' + x).last; (s) ⊦ ¬ n < n; (s) ⊦ m ≤ m; (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜al0⌝ × sl0[# al1], ⌜al⌝ ^ × sl0.last) |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∃ a. actstream(⌜al⌝ ^ × sl0.last) = actstream(⌜al0⌝ × sl0[# al1]) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(⌜al0⌝ × sl0[# al1]), ⌜a '⌝ , endstate(⌜al⌝ ^ × sl0.last))) ∧ ( after(IOAut(startf, stepf))(actstream(⌜al0⌝ × sl0[# al1]), endstate(⌜al0⌝ × sl0[# al1])) ∧ actstream(⌜al0⌝ × sl0[# al1]) ≤ ⌜af⌝ ∧ finp(actstream(⌜al0⌝ × sl0[# al1]))) ∧ after(IOAut(startf, stepf))(actstream(⌜al⌝ ^ × sl0.last), endstate(⌜al⌝ ^ × sl0.last)) ∧ actstream(⌜al⌝ ^ × sl0.last) ≤ ⌜af⌝ ∧ finp(actstream(⌜al⌝ ^ × sl0.last))
Used terms: ⌜al⌝ ^ × sl0.last, ⌜al0⌝ × sl0[# al1], λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∃ a. actstream(⌜al⌝ ^ × sl0.last) = actstream(⌜al0⌝ × sl0[# al1]) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(⌜al0⌝ × sl0[# al1]), ⌜a '⌝ , endstate(⌜al⌝ ^ × sl0.last))) ∧ ( after(IOAut(startf, stepf))(actstream(⌜al0⌝ × sl0[# al1]), endstate(⌜al0⌝ × sl0[# al1])) ∧ actstream(⌜al0⌝ × sl0[# al1]) ≤ ⌜af⌝ ∧ finp(actstream(⌜al0⌝ × sl0[# al1]))) ∧ after(IOAut(startf, stepf))(actstream(⌜al⌝ ^ × sl0.last), endstate(⌜al⌝ ^ × sl0.last)) ∧ actstream(⌜al⌝ ^ × sl0.last) ≤ ⌜af⌝ ∧ finp(actstream(⌜al⌝ ^ × sl0.last)) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∃ a0. ⌜al⌝ ^ = ⌜al0⌝ + ⌜a0 '⌝ ∧ move(IOAut(startf, stepf))(sl0[# al1], ⌜a0 '⌝ , sl0.last)) ∧ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ after(IOAut(startf, stepf))(⌜al⌝ ^, sl0.last)
Used simplifier rules: ⊦ finp(⌜al⌝ ^); (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ endstate(ασ × st) = st; (s) ⊦ finp(⌜x⌝ ); (s)
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , α2 ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∃ a0. ⌜al⌝ ^ = ⌜al0⌝ + ⌜a0 '⌝ ∧ move(IOAut(startf, stepf))(sl0[# al1], ⌜a0 '⌝ , sl0.last)) ∧ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ after(IOAut(startf, stepf))(⌜al⌝ ^, sl0.last) |
⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, α2 = ⌜al2⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∃ a0. ⌜al⌝ ^ = ⌜al0⌝ + ⌜a0 '⌝ ∧ move(IOAut(startf, stepf))(sl0[# al1], ⌜a0 '⌝ , sl0.last)) ∧ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ after(IOAut(startf, stepf))(⌜al⌝ ^, sl0.last)
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ σ + ⌜nf0⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| ⌜al1⌝ + α2 = ⌜al⌝ , (_a0 ' + x0 + (⌜al⌝ ^ × sl0.last)')[n] = α × s0, α2 ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, α2 = ⌜al2⌝ , a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al⌝ ), startf(sl0[0]), ⌜al⌝ ^ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ (∃ a0. ⌜al⌝ ^ = ⌜al0⌝ + ⌜a0 '⌝ ∧ move(IOAut(startf, stepf))(sl0[# al1], ⌜a0 '⌝ , sl0.last)) ∧ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ after(IOAut(startf, stepf))(⌜al⌝ ^, sl0.last) |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ move(IOAut(startf, stepf))(sl0[# al1], ⌜a '⌝ , sl0.last) ∧ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]) ∧ after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last)
Used simplifier rules: ⊦ σ0 + σ1 ≤ σ → (σ0 ≤ σ ↔ true); (ss) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + y = x + z ↔ y = z; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜x0⌝ + ⌜z⌝ ↔ x + y = x0 + z; (s) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ move(IOAut(startf, stepf))(sl0[# al1], ⌜a '⌝ , sl0.last) ∧ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]) ∧ after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last) |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ move(IOAut(startf, stepf))(sl0[# al1], ⌜a '⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ move(IOAut(startf, stepf))(sl0[# al1], ⌜a '⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ sl0[# al1] = sl[0] ∧ sl0.last = sl.last ∧ α ^ = ⌜a '⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: sl0.last, ⌜a '⌝ , sl0[# al1], stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ sl0[# al1] = sl[0] ∧ sl0.last = sl.last ∧ α ^ = ⌜a '⌝ ), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α0, sl. ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , α0) ∨ ¬ finp(α0) ∨ sl0[# al1] ≠ sl[0] ∨ sl0.last ≠ sl.last ∨ α0 ^ ≠ ⌜a '⌝ , ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α0, sl. ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , α0) ∨ ¬ finp(α0) ∨ sl0[# al1] ≠ sl[0] ∨ sl0.last ≠ sl.last ∨ α0 ^ ≠ ⌜a '⌝ , ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ) ∨ ¬ finp(⌜al2⌝ ) ∨ sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last ∨ ⌜al2⌝ ^ ≠ ⌜a '⌝ , ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: ⌜al2⌝ , sl0 from # al1
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ) ∨ ¬ finp(⌜al2⌝ ) ∨ sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last ∨ ⌜al2⌝ ^ ≠ ⌜a '⌝ , ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ) ∨ sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ) ∨ sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ n < # al → (frag(IOAut(startf, stepf))(⌜sl from n⌝ , ⌜al from n⌝ ) ↔ true)
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1 + al2⌝ ) ∧ # al1 < #(al1 + al2) → (frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al1 + al2 from # al1⌝ ) ↔ true), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ) ∨ sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: startf, stepf, sl0, al1 + al2, # al1
| ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ n < # al → (frag(IOAut(startf, stepf))(⌜sl from n⌝ , ⌜al from n⌝ ) ↔ true) |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1 + al2⌝ ) ∧ # al1 < #(al1 + al2) → (frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al1 + al2 from # al1⌝ ) ↔ true), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ) ∨ sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ a ' ≠ []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ x + y from # x = y; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
m + m0 < # x ⊦ (x from m)[m0] = x[m + m0]
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # al1 + 0 < # sl0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], # al1 + 0 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), sl0[# al1] ≠ sl0[# al1 + 0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: 0, # al1, sl0
| m + m0 < # x ⊦ (x from m)[m0] = x[m + m0] |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # al1 + 0 < # sl0, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl0⌝ = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), # sl0 ≤ # al1, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf(⌜sl0⌝ [n], (⌜al1⌝ + ⌜al2⌝ )[n], ⌜sl0⌝ [n +1]), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: ⌜al1⌝ + ⌜al2⌝ , ⌜sl0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl0⌝ = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), # sl0 ≤ # al1, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf(⌜sl0⌝ [n], (⌜al1⌝ + ⌜al2⌝ )[n], ⌜sl0⌝ [n +1]), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 + # al2 + 1 = # sl0, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. n0 < # al1 + # al2 → stepf(sl0[n0], (al1 + al2)[n0], sl0[n0 + 1]), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al1 + # al2 + 1 = # sl0, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. n0 < # al1 + # al2 → stepf(sl0[n0], (al1 + al2)[n0], sl0[n0 + 1]), sl0[# al1] ≠ (sl0 from # al1)[0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, al2 ≠ [], # al1 + 0 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), sl0[# al1] ≠ sl0[# al1 + 0] ∨ sl0.last ≠ (sl0 from # al1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0.last ≠ (sl0 from # al1).last, a ≠ τ, al2 ≠ [], sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(hd(sl0)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0.last ≠ (sl0 from # al1).last, a ≠ τ, al2 ≠ [], sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(hd(sl0)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , sl0 = s1 + sl, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0.last ≠ (sl0 from # al1).last, a ≠ τ, al2 ≠ [], sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: sl0, s1, y
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , sl0 = s1 + sl, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0.last ≠ (sl0 from # al1).last, a ≠ τ, al2 ≠ [], sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 from # al1⌝ , ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl).last ≠ (s1 ' + sl from # al1).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 ' + sl from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact]
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl).last ≠ (s1 ' + sl from # al1).last, a ≠ τ, al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 ' + sl from # al1⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ # x < n → x + y from n = y from (n - # x)
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl).last ≠ (sl from (# al1 - # s1 ')).last, a ≠ τ, al2 ≠ [], # s1 ' < # al1, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl from (# al1 - # s1 ')⌝ , ⌜al2⌝ ), startf(s1), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ x from 0 = x; (s) not-zero: 0 < n ⊦ (* n) ≤ m → m ≠ 0; (forward) from specification nat n ≠ 0 ⊦ (a ' + x)[(* n)] = x[n -1]; (s) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ' + x from 1 = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: # al1, sl, s1 '
| ⊦ # x < n → x + y from n = y from (n - # x) |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl).last ≠ (sl from (# al1 - # s1 ')).last, a ≠ τ, al2 ≠ [], # s1 ' < # al1, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl from (# al1 - # s1 ')⌝ , ⌜al2⌝ ), startf(s1), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, # al1 ≠ 1, (s1 ' + sl).last ≠ (sl from (# al1 - 1)).last, a ≠ τ, al1 ≠ [], al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl from (# al1 - 1)⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ 1 < m ↔ ¬(m = 0 ∨ m = 1); (s) ⊦ # a ' = 0 +1; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, # al1 ≠ 1, (s1 ' + sl).last ≠ (sl from (# al1 - 1)).last, a ≠ τ, al1 ≠ [], al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl from (# al1 - 1)⌝ , ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, # al1 ≠ 0, # al1 ≠ 1, (s1 ' + sl).last ≠ (sl from n0).last, a ≠ τ, al1 ≠ [], al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl from n0⌝ , ⌜al2⌝ ), startf(s1), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # al1, m
| # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, # al1 ≠ 0, # al1 ≠ 1, (s1 ' + sl).last ≠ (sl from n0).last, a ≠ τ, al1 ≠ [], al2 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl from n0⌝ , ⌜al2⌝ ), startf(s1), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl[n0] = (_a0 ' + x0).last, sl.last ≠ (sl from n0).last, a ≠ τ, al1 ≠ [], al2 ≠ [], n0 ≠ 0, sl ≠ [], n0 < # sl, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl from n0⌝ , ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≤ n ↔ m < n; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x ≠ [] → (a ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m + n = 1 ↔ m = 0 ∧ n = 1 ∨ n = 0 ∧ m = 1; (ws) ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ # x = 0 ↔ x = []; (s)
| # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl[n0] = (_a0 ' + x0).last, sl.last ≠ (sl from n0).last, a ≠ τ, al1 ≠ [], al2 ≠ [], n0 ≠ 0, sl ≠ [], n0 < # sl, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl from n0⌝ , ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ #(x + y) = # x + # y; (s) ⊦ # a ' = 0 +1; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ n ≤ # x → x + y from n = (x from n) + y; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: sl, s2, y
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ , sl0[# al1]), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜al0⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0[# al1] = σ.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: sl0[# al1], ⌜al0⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜al0⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0[# al1] = σ.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α0, σ. α0 ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α0) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α0) ∨ sl0[# al1] ≠ σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α0, σ. α0 ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α0) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α0) ∨ sl0[# al1] ≠ σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜al1⌝ ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf(⌜sl0 to # al1 + 1⌝ [0]) ∨ ¬ finp(⌜al1⌝ ) ∨ sl0[# al1] ≠ ⌜sl0 to # al1 + 1⌝ .l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: ⌜al1⌝ , ⌜sl0 to # al1 + 1⌝
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜al1⌝ ^ ≠ ⌜al0⌝ ∨ ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf(⌜sl0 to # al1 + 1⌝ [0]) ∨ ¬ finp(⌜al1⌝ ) ∨ sl0[# al1] ≠ ⌜sl0 to # al1 + 1⌝ .l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(startf, stepf))(σ to n + 1, α to n)
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ) ∧ ¬ #(⌜al1⌝ + ⌜al2⌝ ) < ⌜# al1⌝ → frag*(IOAut(startf, stepf))(⌜sl0⌝ to # al1 + 1, ⌜al1⌝ + ⌜al2⌝ to # al1), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: startf, stepf, ⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ , # al1
| ⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → frag*(IOAut(startf, stepf))(σ to n + 1, α to n) |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ) ∧ ¬ #(⌜al1⌝ + ⌜al2⌝ ) < ⌜# al1⌝ → frag*(IOAut(startf, stepf))(⌜sl0⌝ to # al1 + 1, ⌜al1⌝ + ⌜al2⌝ to # al1), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ) ∨ ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ to # x = ⌜x⌝ ; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
¬ # x < n, m < n ⊦ (x to n)[m] = x[m]
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ¬ # sl0 < # al1 + 1 ∧ 0 < # al1 + 1
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, 0 < # al1 + 1, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # sl0 < # al1 + 1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf(sl0[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: 0, # al1 + 1, sl0
| ¬ # x < n, m < n ⊦ (x to n)[m] = x[m] |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ ¬ # sl0 < # al1 + 1 ∧ 0 < # al1 + 1 |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl0⌝ = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), # sl0 ≤ # al1, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf(⌜sl0⌝ [n], (⌜al1⌝ + ⌜al2⌝ )[n], ⌜sl0⌝ [n +1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: ⌜al1⌝ + ⌜al2⌝ , ⌜sl0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl0⌝ = #(⌜al1⌝ + ⌜al2⌝ ) + ⌜1⌝ , (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), # sl0 ≤ # al1, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜n⌝ < #(⌜al1⌝ + ⌜al2⌝ ) → stepf(⌜sl0⌝ [n], (⌜al1⌝ + ⌜al2⌝ )[n], ⌜sl0⌝ [n +1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 + # al2 + 1 = # sl0, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n0. n0 < # al1 + # al2 → stepf(sl0[n0], (al1 + al2)[n0], sl0[n0 + 1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # al1 + # al2 + 1 = # sl0, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # sl0 ≤ # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ n0. n0 < # al1 + # al2 → stepf(sl0[n0], (al1 + al2)[n0], sl0[n0 + 1]), ¬ startf((sl0 to # al1 + 1)[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, 0 < # al1 + 1, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # sl0 < # al1 + 1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ¬ startf(sl0[0]) ∨ sl0[# al1] ≠ (sl0 to # al1 + 1).last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(hd(sl0)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(hd(sl0)), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , sl0 = s1 + sl, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: sl0, s1, y
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , sl0 = s1 + sl, ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, sl0[# al1] ≠ (sl0 to # al1 + 1).last, a ≠ τ, sl0 ≠ [], # al1 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜sl0 to # al1 + 1⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl)[# al1] ≠ (s1 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x to n + 1 = a + (x to n); (s) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact]
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl)[# al1] ≠ (s1 ' + (sl to # al1)).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl to # al1⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , # al1 ≤ # sl, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , sl = sl0 + sl1, ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl)[# al1] ≠ (s1 ' + sl0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # sl < # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ ¬ # x < n → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n); (elim) Used terms: sl, # al1, sl0, sl1
| # sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , sl = sl0 + sl1, ⌜al0⌝ × (s1 ' + sl)[# al1] = (_a0 ' + x0).last, (s1 ' + sl)[# al1] ≠ (s1 ' + sl0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), # al1 ≤ # sl, ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # sl < # al1, ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (s1 ' + sl0 + sl1)[# al1] = (_a0 ' + x0).last, (s1 ' + sl0 + sl1)[# al1] ≠ (s1 ' + sl0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≤ m + n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ #(x + y) = # x + # y; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| # sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (s1 ' + sl0 + sl1)[# al1] = (_a0 ' + x0).last, (s1 ' + sl0 + sl1)[# al1] ≠ (s1 ' + sl0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ n < # x → (x + y)[n] = x[n]
# sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl0 + sl1)[# al1] = (_a0 ' + x0).last, (s1 ' + sl0 + sl1)[# al1] ≠ (s1 ' + sl0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # al1 < # s1 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ # a ' = 0 +1; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] + σ = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a '.last = a; (s) Used terms: # al1, sl0 + sl1, s1 '
| ⊦ n < # x → (x + y)[n] = x[n] |
| # sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (s1 ' + sl0 + sl1)[# al1] = (_a0 ' + x0).last, (s1 ' + sl0 + sl1)[# al1] ≠ (s1 ' + sl0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ # al1 < # s1 ', ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (sl0 + sl1)[# al1 - 1] = (_a0 ' + x0).last, (sl0 + sl1)[# al1 - 1] ≠ (s1 ' + sl0).last, a ≠ τ, al1 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ ¬ n < # x → (x + y)[n] = y[n - # x]; (s)
| # sl0 = # al1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (sl0 + sl1)[# al1 - 1] = (_a0 ' + x0).last, (sl0 + sl1)[# al1 - 1] ≠ (s1 ' + sl0).last, a ≠ τ, al1 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# sl0 = # al1, # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, # al1 ≠ 0, (sl0 + sl1)[n0] ≠ (s1 ' + sl0).last, a ≠ τ, al1 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # al1, m
| # sl0 = # al1, # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, # al1 ≠ 0, (sl0 + sl1)[n0] ≠ (s1 ' + sl0).last, a ≠ τ, al1 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 = n0 + 1, # sl0 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ (s1 ' + sl0).last, a ≠ τ, al1 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s)
| # al1 = n0 + 1, # sl0 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ (s1 ' + sl0).last, a ≠ τ, al1 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
# sl0 = n0 + 1, # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: sl0, s1 '
| ⊦ y ≠ [] → (x + y).last = y.last |
| # sl0 = n0 + 1, # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (s1 ' + sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 = n0 + 1, # sl0 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[Koenigs-Lemma-gen-behact] a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)
| # al1 = n0 + 1, # sl0 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
# sl0 = n0 + 1, # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], n0 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: n0, sl1, sl0
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| # sl0 = n0 + 1, # al1 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (sl0 + sl1).last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × (sl0 + sl1)[n0] = (_a0 ' + x0).last, (sl0 + sl1)[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], n0 < # sl0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
# al1 = n0 + 1, # sl0 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[n0] = (_a0 ' + x0).last, sl0[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m + 1 ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ n < # x → (x + y)[n] = x[n]; (s)
| # al1 = n0 + 1, # sl0 = n0 + 1, (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × (sl0 + sl1).last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[n0] = (_a0 ' + x0).last, sl0[n0] ≠ sl0.last, a ≠ τ, al1 ≠ [], sl0 ≠ [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ + ⌜sl1⌝ , ⌜al1⌝ + ⌜al2⌝ ), frag(IOAut(startf, stepf))(⌜s1 '⌝ + ⌜sl0⌝ , ⌜al1⌝ ), startf(s1), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ n = # x - 1 ∧ 0 < # x → x[n] = x.last
Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ n + 0 = n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n0, sl0
| ⊦ n = # x - 1 ∧ 0 < # x → x[n] = x.last |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜al0⌝ + ⌜a '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0.last = σ.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used terms: sl0.last, ⌜al0⌝ + ⌜a '⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ α, σ. ¬(α ^ = ⌜al0⌝ + ⌜a '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl0.last = σ.l.last), ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
(_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α0, σ. α0 ^ ≠ ⌜al0⌝ + ⌜a '⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α0) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α0) ∨ sl0.last ≠ σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| (_a0 ' + x0 + ((⌜al0⌝ + ⌜a '⌝ ) × sl0.last)')[n] = α × s0, ⌜al2⌝ ^ = ⌜a '⌝ , ⌜al1⌝ ^ = ⌜al0⌝ , ⌜al0⌝ × sl0[# al1] = (_a0 ' + x0).last, a ≠ τ, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ + ⌜al2⌝ ), startf(sl0[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n1. ¬ # x0 < n1 → after(IOAut(startf, stepf))(actstream((_a0 ' + x0)[n1]), endstate((_a0 ' + x0)[n1])) ∧ actstream((_a0 ' + x0)[n1]) ≤ ⌜af⌝ ∧ finp(actstream((_a0 ' + x0)[n1])), ∀ α0, σ. α0 ^ ≠ ⌜al0⌝ + ⌜a '⌝ ∨ ¬ frag(IOAut(startf, stepf))(σ, α0) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α0) ∨ sl0.last ≠ σ.l.last, ∀ al1, startf, stepf, s, af. # al1 < #(al0 + a) → after(IOAut(startf, stepf))(⌜al1⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al1⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al1⌝ × s)) ⊦ |
Used simplifier rules: ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al1 + al2⌝ , ⌜sl0⌝
| al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s), ∃ al0, a. al0 + a = al |
al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s), ∃ al0, a. al0 + a ' = al
Used simplifier rules: ⊦ x + a = x + a '; (s)
| al ≠ [], after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ⌜al⌝ ≤ ⌜af⌝ , ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al0, startf, stepf, s, af. # al0 < # al → after(IOAut(startf, stepf))(⌜al0⌝ , s) ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ ⌜al0⌝ ≤ ⌜af⌝ ∧ ¬ trace(IOAut(startf, stepf))(⌜af⌝ ) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) → (∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al0⌝ × s)) ⊦ ∃ _a. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a) ∧ path ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (_a, ⌜al⌝ × s), ∃ al0, a. al0 + a ' = al |
Used simplifier rules: x ≠ [] ⊦ x.butlast + x.last ' = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: al.butlast, al.last
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ nf. isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(0)) ∧ pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(0)), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), isroot ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(0)), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ¬ trace(IOAut(startf, stepf))(⌜af⌝ ), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ¬(⌜af⌝ = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦
Used terms: ⌜af⌝ , stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ¬(⌜af⌝ = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), pathp ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ ) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. ⌜n⌝ < # ⌜nf⌝ → dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ [n]), ∀ n. ⌜n + 1⌝ < # ⌜nf⌝ → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ [n], ⌜nf⌝ [n + 1]), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used terms: ⌜nf⌝ , (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. ⌜n⌝ < # ⌜nf⌝ → dom ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ [n]), ∀ n. ⌜n + 1⌝ < # ⌜nf⌝ → edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜nf⌝ [n], ⌜nf⌝ [n + 1]), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
Used simplifier rules: ⊦ dom(vs × es) = vs; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ sl, al, m. exec(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af⌝ to m ∧ actstream(nf(0)) = ⌜al⌝ ^ ∧ endstate(nf(0)) = sl.last ⊦
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al, m. exec(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af⌝ to m ∧ actstream(nf(0)) = ⌜al⌝ ^ ∧ endstate(nf(0)) = sl.last
Used formulas: ∃ sl, al, m. exec(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af⌝ to m ∧ actstream(nf(0)) = ⌜al⌝ ^ ∧ endstate(nf(0)) = sl.last
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ sl, al, m. exec(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af⌝ to m ∧ actstream(nf(0)) = ⌜al⌝ ^ ∧ endstate(nf(0)) = sl.last ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , actstream(nf(0)) = ⌜af to m⌝ , endstate(nf(0)) = sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , actstream(nf(0)) = ⌜af to m⌝ , endstate(nf(0)) = sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = α × s, s = sl.last, α = ⌜af to m⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(0), ασ, st
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = α × s, s = sl.last, α = ⌜af to m⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af⌝ to m + n ⊦
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ n. actstream(nf(n)) = ⌜af⌝ to m + n
Used formulas: ∀ n. actstream(nf(n)) = ⌜af⌝ to m + n
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af⌝ to m + n ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = endstate(nf(n)) ∧ sl0.last = endstate(nf(n + 1)) ∧ ⌜al0⌝ ^ = ⌜af(n + m) '⌝ ^ ⊦
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ n. ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = endstate(nf(n)) ∧ sl0.last = endstate(nf(n + 1)) ∧ ⌜al0⌝ ^ = ⌜af(n + m) '⌝ ^
Used formulas: ∀ n. ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = endstate(nf(n)) ∧ sl0.last = endstate(nf(n + 1)) ∧ ⌜al0⌝ ^ = ⌜af(n + m) '⌝ ^
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = endstate(nf(n)) ∧ sl0.last = endstate(nf(n + 1)) ∧ ⌜al0⌝ ^ = ⌜af(n + m) '⌝ ^ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ n. ∃ m. # slf(n) = m ⊦
Used formulas: ∀ n. ∃ m. # slf(n) = m
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ n. ∃ m. # slf(n) = m ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → lf(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦
Used terms: λ n. (n = 0 ⊃ sl;tl(slf(n - 1)))
| ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → lf(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) |
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → lf(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∃ α, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(α) ⊃ ∃ n. # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦
Used terms: λ n. (n = 0 ⊃ al;alf(n - 1))
| ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → lf(m) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) |
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∃ α, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii(n + 1)⌝ ∧ (α from ii(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(α) ⊃ ∃ n. # α = ⌜ii(n)⌝ ∧ (∀ m. n ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ⊦ ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1
Used formulas: ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦
Used terms: σ, α
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦
Used formulas: startf(σ[0])
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α = ⌜al0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ⊦
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α = ⌜af0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α = ⌜al0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1) ⊦
Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜al⌝ ^ ≠ ⌜af⌝ ; (s)
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1) ⊦ |
⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n]))
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ⌜n⌝ < # ⌜af⌝ → ext(⌜af⌝ [n]) ⊦
Used terms: ⌜af⌝
| ⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n])) |
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ⌜n⌝ < # ⌜af⌝ → ext(⌜af⌝ [n]) ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ext(a) ↔ a ≠ τ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: m1 + 1
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ¬ ii0(m1) < ii0(m1 + 1), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: m1
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ¬ ii0(m1) < ii0(m1 + 1), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: m1
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m1), slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦
Used terms: m1
| # al0 = ii0(m1), slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦ |
# al0 = ii0(m1), slf(m1).last = s, slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m1 + 1), ασ, st
| # al0 = ii0(m1), slf(m1).last = s, slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m1), slf(m1)[0] = endstate(nf(m1)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(m1 + 1) = α × slf(m1).last, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦
| # al0 = ii0(m1), slf(m1)[0] = endstate(nf(m1)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(m1 + 1) = α × slf(m1).last, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦ |
# al0 = ii0(m1), slf(m1)[0] = s, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × s, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m1), ασ, st
| # al0 = ii0(m1), slf(m1)[0] = s, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × s, (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), ii0(0) = 0, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # (m1 = 0 ⊃ al;alf(m1 - 1)) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦ |
# al0 = ii0(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), m1 = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # al = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
# al0 = ii0(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # alf(m1 - 1) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, m1 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
| # al0 = ii0(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), m1 = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # al = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
sl.last = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = 0, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = [] × sl.last, σ to # sl = ⌜sl⌝ , af(1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , []), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), startf(σ[0]), ¬ # σ < ⌜# sl⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ nf to 0 = []; (s) ⊦ x to 0 = []; (s) ⊦ nf to n = [] ↔ n = 0; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ [] ^ = []; (s) ⊦ # [] = 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m ≤ 0 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ x from 0 = x; (s) ⊦ σ from 0 = σ; (s) ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws) ⊦ 0 ≤ m; (s)
| sl.last = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = 0, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = [] × sl.last, σ to # sl = ⌜sl⌝ , af(1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , []), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), startf(σ[0]), ¬ # σ < ⌜# sl⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜sl⌝ = # [] + ⌜1⌝ , sl.last = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × sl.last, nf(1) = α × slf(0).last, σ to # sl = ⌜sl⌝ , af(1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ⌜n⌝ < # [] → stepf(⌜sl⌝ [n], [][n], ⌜sl⌝ [n +1]) ⊦
Used terms: [], ⌜sl⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜sl⌝ = # [] + ⌜1⌝ , sl.last = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × sl.last, nf(1) = α × slf(0).last, σ to # sl = ⌜sl⌝ , af(1) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ⌜n⌝ < # [] → stepf(⌜sl⌝ [n], [][n], ⌜sl⌝ [n +1]) ⊦ |
# sl = 1, sl.last = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × sl.last, nf(1) = α × slf(0).last, σ to 1 = ⌜sl⌝ , af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦
Used simplifier rules: ⊦ # σ = ⌜0⌝ ↔ σ = []; (s) ⊦ n∞ < ⌜1⌝ ↔ n∞ = ⌜0⌝ ; (s) ⊦ ¬ n < 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # sl = 1, sl.last = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × sl.last, nf(1) = α × slf(0).last, σ to 1 = ⌜sl⌝ , af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦ |
# sl = 1, ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = [] × s, s = slf(0)[0], sl = sl0 + s ', σ to 1 = ⌜sl⌝ , af(1) ≠ τ, sl ≠ [], σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ ⊦
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ σ ≠ [] → σ to 1 ≠ []; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: sl, s, y
| # sl = 1, ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = [] × s, s = slf(0)[0], sl = sl0 + s ', σ to 1 = ⌜sl⌝ , af(1) ≠ τ, sl ≠ [], σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ ⊦ |
σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = [] × σ[0], af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ [] + x = x; (s) ⊦ a '[0] = a; (s) σ ≠ [] ⊦ σ to 1 = ⌜a '⌝ ↔ σ[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ [] + σ = σ; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ x + a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = [] × σ[0], af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦ |
slf(0).last = endstate(nf(0 + 1)), σ[0] = slf(0)[0], slf(0)[0] = endstate(nf(0)), ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α × slf(0).last, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦
Used terms: 0
| slf(0).last = endstate(nf(0 + 1)), σ[0] = slf(0)[0], slf(0)[0] = endstate(nf(0)), ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α × slf(0).last, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦ |
slf(0).last = endstate(nf(1)), σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α × endstate(nf(1)), af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| slf(0).last = endstate(nf(1)), σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α × endstate(nf(1)), af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦ |
slf(0).last = s, σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α × s, nf(0) = [] × σ[0], nf(1) = α0 × s, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(1), ασ, st
| slf(0).last = s, σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α × s, nf(0) = [] × σ[0], nf(1) = α0 × s, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦ |
σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α0 × slf(0).last, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦
Used simplifier rules: ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws)
| σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α0 × slf(0).last, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦ |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, af(0) = τ, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = [] × σ[0], af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦
σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ , ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = [] × σ[0], af(0) ≠ τ, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦
Used terms: af(0)
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ ^, af(0) = τ, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = [] × σ[0], af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦ |
σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = [], af(0) = τ, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = [] × σ[0], af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦
Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)
| σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = [], af(0) = τ, ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = [] × σ[0], af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦ |
Used terms: 0
| σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ , ii(0) = 0, ii(1) = 1, ii0(1) = 0, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = [] × σ[0], af(0) ≠ τ, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ ⊦ |
σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ , ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α0 × slf(0).last, af(0) ≠ τ, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦
| σ[0] = slf(0)[0], ⌜alf(0)⌝ ^ = ⌜af(0) '⌝ , ii(1) = 1, ii(0) = 0, ii0(0) = 0, ii0(1) = 0, nf(0) = [] × σ[0], nf(1) = α0 × slf(0).last, af(0) ≠ τ, af(1) ≠ τ, σ ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ σ[0] ';tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ σ[0] ';tl(slf(n - 1))) = ⌜(n = 0 ⊃ σ[0] ';tl(slf(n - 1)))⌝ , ∀ n. actstream(nf(n)) = ⌜af to n⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ [];alf(n - 1)) ∧ ii0(n + 1) = 0 ∧ ([] from ii0(n)) to # (n = 0 ⊃ [];alf(n - 1)) = (n = 0 ⊃ [];alf(n - 1)), ∀ m1. (m1 ≠ 0 → [] = alf(m1 - 1)) ∧ ii0(m1) = 0 ⊦ |
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) Used terms: 0 +1
| # al0 = ii0(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # (m1 = 0 ⊃ al;alf(m1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (σ from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = ⌜(m1 = 0 ⊃ sl;tl(slf(m1 - 1)))⌝ , (al0 from ii0(m1)) to # alf(m1 - 1) = (m1 = 0 ⊃ al;alf(m1 - 1)), af(m1 + 1) ≠ τ, m1 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii(m1) + # tl(slf(m1 - 1)), ii0(m1 + 1) = ii0(m1) + # alf(m1 - 1), ii0(0) = 0, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # alf(m1 - 1) = alf(m1 - 1), (σ from ii(m1)) to # tl(slf(m1 - 1)) = ⌜tl(slf(m1 - 1))⌝ , af(m1 + 1) ≠ τ, m1 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦
| # al0 = ii0(m1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii(m1) + # tl(slf(m1 - 1)), ii0(m1 + 1) = ii0(m1) + # alf(m1 - 1), ii0(0) = 0, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, nf(0) = ⌜af to m⌝ × sl.last, (al0 from ii0(m1)) to # alf(m1 - 1) = alf(m1 - 1), (σ from ii(m1)) to # tl(slf(m1 - 1)) = ⌜tl(slf(m1 - 1))⌝ , af(m1 + 1) ≠ τ, m1 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(σ[0]), startf(sl[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. af(n) ≠ τ ⊦ |
# al0 = ii0(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii(m1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # alf(m2), m1 = m2 + 1, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (σ from ii(m1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , (al0 from ii0(m1)) to # alf(m2) = alf(m2), af(m1 + 1) ≠ τ, m1 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: m1, m2
| # al0 = ii0(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii(m1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(m1 + 1) = ii0(m1) + # alf(m2), m1 = m2 + 1, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (σ from ii(m1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , (al0 from ii0(m1)) to # alf(m2) = alf(m2), af(m1 + 1) ≠ τ, m1 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(m1 + 1) ≤ ii0(m1), ¬ # σ < ⌜ii(m1 + 1)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. af(n) ≠ τ, ∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ ii0(m1) < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m2 + 1), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2 + 1)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ x from # x = []; (s) ⊦ m < n → n ≠ 0; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m + 1 ≠ 0; (s)
| # al0 = ii0(m2 + 1), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2 + 1)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = endstate(nf(m2 + 1)), slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2 + 1) = α0 × slf(m2 + 1)[0], nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦
Used terms: m2
| # al0 = ii0(m2 + 1), slf(m2).last = endstate(nf(m2 + 1)), slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2 + 1) = α0 × slf(m2 + 1)[0], nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s)
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = s, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × s, (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m2), ασ, st
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = s, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × s, (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2) = α1 × slf(m2)[0], nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2) = α1 × slf(m2)[0], nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦ |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af((m2 + 1) + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: af((m2 + 1) + m)
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af((m2 + 1) + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = [], af((m2 + 1) + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = [], af((m2 + 1) + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: (m2 + 1) + m
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2) = α1 × slf(m2)[0], nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2) = α1 × slf(m2)[0], nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦ |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , af(m2 + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(m2 + m) ≠ τ, af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: af(m2 + m)
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , af(m2 + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2)⌝ ^ = [], af(m2 + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, af((m2 + 1) + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2)⌝ ^ = [], af(m2 + m) = τ, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(2 + m2) ≠ τ, af((m2 + 1) + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
Used terms: m2 + m
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(0) = 0, ii0(0) = 0, ii0(2 + m2) = # al0 + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m2) = α × slf(m2 + 1).last, nf(m2 + 1) = α0 × slf(m2).last, nf(m2) = α1 × slf(m2)[0], (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , [] to # alf(m2) = alf(m2), af(m2 + m) ≠ τ, af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0, ∀ n. af(n) ≠ τ, ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
# al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ , ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2) = α1 × slf(m2)[0], nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(m2 + m) ≠ τ, af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦
| # al0 = ii0(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ , ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ , ii(0) = 0, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii0(2 + m2) = # al0 + # alf(m2), ii0(0) = 0, nf(m2) = α1 × slf(m2)[0], nf(m2 + 1) = α0 × slf(m2).last, nf(2 + m2) = α × slf(m2 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, [] to # alf(m2) = alf(m2), (σ from ii(m2 + 1)) to # tl(slf(m2)) = ⌜tl(slf(m2))⌝ , af(m2 + m) ≠ τ, af((m2 + 1) + m) ≠ τ, af(2 + m2) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(σ[0]), startf(sl[0]), ii0(2 + m2) ≤ # al0, ¬ # σ < ⌜ii(2 + m2)⌝ , (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # al0 < ii0(n + 1) ∧ (al0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. af(n) ≠ τ, ∀ m1. m2 < m1 → alf(m1 - 1) = [] ∧ ii0(m1) = # al0 ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ n + 0 = n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) Used terms: m2 + 1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α = ⌜af0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ) ⊦
Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(σ[0]), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, σ = ⌜sl0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ) ⊦
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, σ = ⌜sf0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ) ⊦
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;;
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, σ = ⌜sl0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ) ⊦ |
# sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦
Used simplifier rules: ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜af⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| # sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦ |
# sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl0[0]), startf(sl[0]), m0 ≤ m0 +1 → (m0 +1 = 0 ⊃ sl;tl(slf(m0 +1 - 1))) = [] ∧ ii(m0 +1) = ii(m0), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used terms: m0 +1
| # sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl0[0]), startf(sl[0]), m0 ≤ m0 +1 → (m0 +1 = 0 ⊃ sl;tl(slf(m0 +1 - 1))) = [] ∧ ii(m0 +1) = ii(m0), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ m + 1 ≠ 0; (s) ⊦ m ≤ m + n; (s)
| # sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦ |
# sl0 = ii(m0), slf(m0).last = endstate(nf(m0 + 1)), slf(m0)[0] = endstate(nf(m0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used terms: m0
| # sl0 = ii(m0), slf(m0).last = endstate(nf(m0 + 1)), slf(m0)[0] = endstate(nf(m0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), slf(m0).last = endstate(nf(m0 + 1)), slf(m0)[0] = endstate(nf(m0)), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦
| # sl0 = ii(m0), slf(m0).last = endstate(nf(m0 + 1)), slf(m0)[0] = endstate(nf(m0)), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦ |
# sl0 = ii(m0), slf(m0).last = s, slf(m0)[0] = endstate(nf(m0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × s, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m0 + 1), ασ, st
| # sl0 = ii(m0), slf(m0).last = s, slf(m0)[0] = endstate(nf(m0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × s, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), slf(m0)[0] = endstate(nf(m0)), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦
| # sl0 = ii(m0), slf(m0)[0] = endstate(nf(m0)), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦ |
# sl0 = ii(m0), slf(m0)[0] = s, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × s, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m0), ασ, st
| # sl0 = ii(m0), slf(m0)[0] = s, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × s, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦
| # sl0 = ii(m0), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦ |
# sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used terms: m0
| # sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦
| # sl0 = ii(m0), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦ |
# sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), (sl0 from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ¬ ii(m0) < ii(m0 + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used terms: m0
| # sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), (sl0 from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ¬ ii(m0) < ii(m0 + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦
Used simplifier rules: ⊦ x to 0 = []; (s) ⊦ # [] = 0; (s) ⊦ m ≤ m; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m = m + n ↔ n = 0; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0) ⊦ |
⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n]))
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ⌜n⌝ < # ⌜af⌝ → ext(⌜af⌝ [n]) ⊦
Used terms: ⌜af⌝
| ⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n])) |
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ⌜n⌝ < # ⌜af⌝ → ext(⌜af⌝ [n]) ⊦ |
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ext(a) ↔ a ≠ τ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. af(n) ≠ τ ⊦ |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, af(m0 + m) = τ, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), af(m0 + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used terms: af(m0 + m)
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ ^, af(m0 + m) = τ, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = [], af(m0 + m) = τ, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = [], af(m0 + m) = τ, ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
Used terms: m0 + m
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), af(m0 + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), af(m0 + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. af(n) ≠ τ ⊦
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), af(m0 + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. af(n) ≠ τ ⊦ |
# sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # alf(m0 - 1), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), af(m0 + m) ≠ τ, m0 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ 0 ≤ m; (s) ⊦ n + 0 = n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws) ⊦ nf from 0 = nf; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)
| # sl0 = ii(m0), (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = [], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # alf(m0 - 1), nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m0)) = [], (af0 from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = (m0 = 0 ⊃ al;alf(m0 - 1)), af(m0 + m) ≠ τ, m0 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m0), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # alf(m0 - 1), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], tl(slf(m0 - 1)) = [], (af0 from ii0(m0)) to # alf(m0 - 1) = alf(m0 - 1), af(m0 + m) ≠ τ, m0 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. af(n) ≠ τ ⊦
| # sl0 = ii(m0), ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(m0 + 1) = ii(m0), ii0(m0 + 1) = ii0(m0) + # alf(m0 - 1), ii0(0) = 0, nf(m0) = α0 × slf(m0)[0], nf(m0 + 1) = α × slf(m0).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m0)) = [], tl(slf(m0 - 1)) = [], (af0 from ii0(m0)) to # alf(m0 - 1) = alf(m0 - 1), af(m0 + m) ≠ τ, m0 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. af(n) ≠ τ ⊦ |
# sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # alf(m1), m0 = m1 + 1, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m1)) = [], tl(slf(m0)) = [], (af0 from ii0(m0)) to # alf(m1) = alf(m1), af(m0 + m) ≠ τ, m0 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: m0, m1
| # sl0 = ii(m0), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m0)⌝ ^ = ⌜af(m0 + m) '⌝ , ii(m0 + 1) = ii(m0), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # alf(m1), m0 = m1 + 1, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α × slf(m0).last, nf(m0) = α0 × slf(m0)[0], tl(slf(m1)) = [], tl(slf(m0)) = [], (af0 from ii0(m0)) to # alf(m1) = alf(m1), af(m0 + m) ≠ τ, m0 ≠ 0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m0)⌝ , ⌜alf(m0)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ ii(m0) < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m1 + 1), ⌜alf(m1 + 1)⌝ ^ = ⌜af((m1 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(2 + m1) = # sl0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1 + 1) = α0 × slf(m1 + 1)[0], nf(2 + m1) = α × slf(m1 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m1 + 1)) = [], tl(slf(m1)) = [], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), af((m1 + 1) + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1 + 1)⌝ , ⌜alf(m1 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # sl0 < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ m0. m1 < m0 → tl(slf(m0 - 1)) = [] ∧ ii(m0) = # sl0 ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m + 1 ≠ 0; (s)
| # sl0 = ii(m1 + 1), ⌜alf(m1 + 1)⌝ ^ = ⌜af((m1 + 1) + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(2 + m1) = # sl0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1 + 1) = α0 × slf(m1 + 1)[0], nf(2 + m1) = α × slf(m1 + 1).last, nf(0) = ⌜af to m⌝ × sl.last, tl(slf(m1 + 1)) = [], tl(slf(m1)) = [], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), af((m1 + 1) + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m1 + 1)⌝ , ⌜alf(m1 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sl0[0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # sl0 < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ m0. m1 < m0 → tl(slf(m0 - 1)) = [] ∧ ii(m0) = # sl0 ⊦ |
# sl0 = ii(m1 + 1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1 + 1)⌝ ^ = ⌜af((m1 + 1) + m) '⌝ , ii(2 + m1) = # sl0, ii(0) = 0, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m1) = α × slf(m1 + 1).last, nf(m1 + 1) = α0 × slf(m1 + 1)[0], sl1 = [], slf(m1 + 1) = s + sl1, tl(slf(m1)) = [], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), af((m1 + 1) + m) ≠ τ, slf(m1 + 1) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1 + 1)⌝ , ⌜alf(m1 + 1)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m0. m1 < m0 → tl(slf(m0 - 1)) = [] ∧ ii(m0) = # sl0, ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # sl0 < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s) ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: slf(m1 + 1), head, tail
| # sl0 = ii(m1 + 1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1 + 1)⌝ ^ = ⌜af((m1 + 1) + m) '⌝ , ii(2 + m1) = # sl0, ii(0) = 0, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m1) = α × slf(m1 + 1).last, nf(m1 + 1) = α0 × slf(m1 + 1)[0], sl1 = [], slf(m1 + 1) = s + sl1, tl(slf(m1)) = [], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), af((m1 + 1) + m) ≠ τ, slf(m1 + 1) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1 + 1)⌝ , ⌜alf(m1 + 1)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m0. m1 < m0 → tl(slf(m0 - 1)) = [] ∧ ii(m0) = # sl0, ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # sl0 < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
# sl0 = ii(m1 + 1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1 + 1)⌝ ^ = ⌜af((m1 + 1) + m) '⌝ , ii(2 + m1) = # sl0, ii(0) = 0, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × s, nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m1) = α × s, slf(m1 + 1) = s ', tl(slf(m1)) = [], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), af((m1 + 1) + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜s '⌝ , ⌜alf(m1 + 1)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m0. m1 < m0 → tl(slf(m0 - 1)) = [] ∧ ii(m0) = # sl0, ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # sl0 < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ a ' ≠ []; (s) ⊦ a '.last = a; (s) ⊦ hd(a ') = a; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) ⊦ a + x = a ' + x; (s)
| # sl0 = ii(m1 + 1), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m1 + 1)⌝ ^ = ⌜af((m1 + 1) + m) '⌝ , ii(2 + m1) = # sl0, ii(0) = 0, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × s, nf(0) = ⌜af to m⌝ × sl.last, nf(2 + m1) = α × s, slf(m1 + 1) = s ', tl(slf(m1)) = [], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), af((m1 + 1) + m) ≠ τ, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜s '⌝ , ⌜alf(m1 + 1)⌝ ), startf(sl0[0]), startf(sl[0]), ∀ m0. m1 < m0 → tl(slf(m0 - 1)) = [] ∧ ii(m0) = # sl0, ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # sl0 < ii(n + 1) ∧ (sl0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ m ≤ n → (⌜(* n)⌝ = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ = n∞2); (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # x = 0 ↔ x = []; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) Used terms: ⌜alf(m1 + 1)⌝ , ⌜s '⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, σ = ⌜sf0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, ⌜af0⌝ ) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ⊦
Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ⊦ |
⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n]))
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ⌜n⌝ < # ⌜af⌝ → ext(⌜af⌝ [n]), ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ⊦
Used terms: ⌜af⌝
| ⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n])) |
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ⌜n⌝ < # ⌜af⌝ → ext(⌜af⌝ [n]), ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ, ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ⊦
Used simplifier rules: ⊦ ext(a) ↔ a ≠ τ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ, ⌜af⌝ ≠ ⌜af0⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ⌜af0⌝ ^ = ⌜af⌝ ^, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used formulas: ⌜af0⌝ ^ = ⌜af⌝ ^
| ⌜al⌝ ^ = ⌜af to m⌝ , ⌜af0⌝ ^ = ⌜af⌝ ^, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
∀ m. ⌜m⌝ < # α → α[m] ≠ τ ⊦ α ^ = α
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ ∀ m. ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] ≠ τ
Used terms: ⌜af⌝
| ∀ m. ⌜m⌝ < # α → α[m] ≠ τ ⊦ α ^ = α |
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ ∀ m. ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] ≠ τ |
⌜al⌝ ^ = ⌜af to m⌝ , af(m0) = τ, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , af(m0) = τ, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ ≠ ⌜af⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
Used terms: m0
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ = (⌜af⌝ to m) + (⌜af⌝ from m), ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜nf to n⌝ + ⌜nf from n⌝ = ⌜nf⌝ ↔ true; (ss) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used formulas: ⌜af⌝ = (⌜af⌝ to m) + (⌜af⌝ from m)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ = (⌜af⌝ to m) + (⌜af⌝ from m), ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ = ⌜af to m⌝ + ⌜af from m⌝ , ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ⌜af⌝ = ⌜af to m⌝ + ⌜af from m⌝ , ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # (0 = 0 ⊃ al;alf(0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, (af0 from ii0(0)) to # (0 = 0 ⊃ al;alf(0 - 1)) = (0 = 0 ⊃ al;alf(0 - 1)), ⌜af⌝ = ⌜af to m⌝ + ⌜af from m⌝ , ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # (0 = 0 ⊃ al;alf(0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, (af0 from ii0(0)) to # (0 = 0 ⊃ al;alf(0 - 1)) = (0 = 0 ⊃ al;alf(0 - 1)), ⌜af⌝ = ⌜af to m⌝ + ⌜af from m⌝ , ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, af0 to # al = al, ⌜af⌝ = ⌜af to m⌝ + ⌜af from m⌝ , ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ nf from 0 = nf; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, af0 to # al = al, ⌜af⌝ = ⌜af to m⌝ + ⌜af from m⌝ , ⌜af0⌝ ^ ≠ ⌜af⌝ ^, ⌜af⌝ ≠ ⌜af0⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, af0 to # al = al, ⌜af to m⌝ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ (⌜af to m⌝ + ⌜af from m⌝ )^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af to m⌝ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, af0 to # al = al, ⌜af to m⌝ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ (⌜af to m⌝ + ⌜af from m⌝ )^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af to m⌝ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, af0 to # al = al, ⌜af to m⌝ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜af to m⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af to m⌝ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, af0 to # al = al, ⌜af to m⌝ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜af to m⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af to m⌝ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
| ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ α ^ ^ = α ^; (s)
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0⌝ = (⌜af0⌝ to # al) + (⌜af0⌝ from # al), ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜nf to n⌝ + ⌜nf from n⌝ = ⌜nf⌝ ↔ true; (ss) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used formulas: ⌜af0⌝ = (⌜af0⌝ to # al) + (⌜af0⌝ from # al)
| ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0⌝ = (⌜af0⌝ to # al) + (⌜af0⌝ from # al), ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0⌝ = ⌜al⌝ + ⌜af0 from # al⌝ , ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0⌝ = ⌜al⌝ + ⌜af0 from # al⌝ , ⌜al⌝ ^ + ⌜af from m⌝ ≠ ⌜af0⌝ ^, ⌜af0⌝ ^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al⌝ ^ + ⌜af from m⌝ ≠ (⌜al⌝ + ⌜af0 from # al⌝ )^, (⌜al⌝ + ⌜af0 from # al⌝ )^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
| ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al⌝ ^ + ⌜af from m⌝ ≠ (⌜al⌝ + ⌜af0 from # al⌝ )^, (⌜al⌝ + ⌜af0 from # al⌝ )^ ≠ ⌜al⌝ ^ + ⌜af from m⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0 from # al⌝ ^ ≠ ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # ⌜al⌝ ^ ≠ ∞; (s) ⊦ σ + σ1 = σ + σ2 ↔ σ1 = σ2 ∨ # σ = ∞; (ws) ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0 from # al⌝ ^ ≠ ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0 from # al⌝ ^ ≠ ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used formulas: ⌜af from m⌝ ^ = ⌜af0 from # al⌝ ^
| ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0 from # al⌝ ^ ≠ ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^)
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0 from # al⌝ ^ ≠ ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), finp(⌜af from m⌝ ^), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ¬ finp(⌜af from m⌝ ^), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∃ n. ¬(∃ m0. (⌜af from m⌝ to n)^ = (⌜af0 from # al⌝ to m0)^) ⊦
Used terms: af0 from # al, af from m
| ¬ finp(⌜af⌝ ^) ⊦ ⌜af⌝ ^ = ⌜af0⌝ ^ ↔ (∀ n. ∃ m. (⌜af⌝ to n)^ = (⌜af0⌝ to m)^) |
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af0 from # al⌝ ^ ≠ ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), finp(⌜af from m⌝ ^), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ)
ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), finp(⌜af from m⌝ ^) ↔ (∃ n. ∀ m0. n ≤ m0 → ((af from m))(m0) = τ), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used terms: af from m
| ⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) |
| ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), finp(⌜af from m⌝ ^) ↔ (∃ n. ∀ m0. n ≤ m0 → ((af from m))(m0) = τ), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ, ∀ m1. m0 ≤ m1 → af(m1 + m) = τ ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ ((nf from n))(m) = nf(m + n); (s)
| ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ, ∀ m1. m0 ≤ m1 → af(m1 + m) = τ ⊦ |
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), m0 ≤ m0 +1 → af(m0 +1 + m) = τ, ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: m0 +1
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), m0 ≤ m0 +1 → af(m0 +1 + m) = τ, ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
af((m0 + 1) + m) = τ, ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m +1 = m + 1; (s) c: ⊦ m + n = n + m; from specification nat-basic ⊦ m ≤ m + n; (s)
| af((m0 + 1) + m) = τ, ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜al0⌝ = ⌜af from m⌝ ^, ⌜af0 from # al⌝ ^ ≠ ⌜al0⌝ , ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: (m0 + 1) + m
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ¬ finp(⌜af from m⌝ ^), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∃ n. ¬(∃ m0. (⌜af from m⌝ to n)^ = (⌜af0 from # al⌝ to m0)^) ⊦ |
ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af1⌝ = ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ ∃ m1. ⌜(af from m) to m0⌝ ^ = ⌜(af0 from # al) to m1⌝ ^
Used simplifier rules: ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ α ^ = ⌜af⌝ → (af(n) = τ ↔ false); (s) remtau-fin: ⊦ ¬ finp(α ^) → ¬ finp(α); (forward) from specification remtau ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af1⌝ = ⌜af from m⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ ∃ m1. ⌜(af from m) to m0⌝ ^ = ⌜(af0 from # al) to m1⌝ ^ |
ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af1⌝ = ⌜af from m⌝ ^, ⌜(af from m) to m0⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m0 + 1) - # al)⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
Used terms: ii0(m0 + 1) - # al
| ii(0) = 0, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜al⌝ ^ × sl.last, af0 to # al = al, ⌜af1⌝ = ⌜af from m⌝ ^, ⌜(af from m) to m0⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m0 + 1) - # al)⌝ ^, ⌜af from m⌝ ≠ ⌜af0 from # al⌝ ^, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜al⌝ ^ + ⌜af from m⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii0(1) = # al, ⌜(af from m) to m0⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m0 + 1) - # al)⌝ ^, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| ii0(1) = # al, ⌜(af from m) to m0⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m0 + 1) - # al)⌝ ^, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
ii0(1) = # al, ⌜(af from m) to m1 +1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 +1 + 1) - # al)⌝ ^, ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ ii0, al, af, m, af0, alf, startf, stepf, slf, nf. ¬ ( ii0(1) = # al ∧ ⌜(af from m) to m1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ ∧ (∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1))) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∧ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^)) ⊦
Used simplifier rules: nat freely generated by 0, +1;; a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m - m = 0; (s) ⊦ nf to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ [] ^ = []; (s)
| ii0(1) = # al, ⌜(af from m) to m1 +1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 +1 + 1) - # al)⌝ ^, ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ ii0, al, af, m, af0, alf, startf, stepf, slf, nf. ¬ ( ii0(1) = # al ∧ ⌜(af from m) to m1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ ∧ (∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1))) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∧ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^)) ⊦ |
ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ ii, al0, af1, m0, af2, alf0, startf0, stepf0, slf0, nf0. ii(1) ≠ # al0 ∨ ⌜(af1 from m0) to m1⌝ ^ = ⌜(af2 from # al0) to (ii(m1 + 1) - # al0)⌝ ^ ∨ ¬(∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ al0;alf0(n - 1)) ∧ (af2 from ii(n)) to # (n = 0 ⊃ al0;alf0(n - 1)) = (n = 0 ⊃ al0;alf0(n - 1))) ∨ ¬(∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∨ ¬ (∀ n0. frag(IOAut(startf0, stepf0))(⌜slf0(n0)⌝ , ⌜alf0(n0)⌝ ) ∧ slf0(n0)[0] = endstate(nf0(n0)) ∧ slf0(n0).last = endstate(nf0(n0 + 1)) ∧ ⌜alf0(n0)⌝ ^ = ⌜af1(n0 + m0) '⌝ ^) ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m +1 = m + 1; (s)
| ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ ii, al0, af1, m0, af2, alf0, startf0, stepf0, slf0, nf0. ii(1) ≠ # al0 ∨ ⌜(af1 from m0) to m1⌝ ^ = ⌜(af2 from # al0) to (ii(m1 + 1) - # al0)⌝ ^ ∨ ¬(∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ al0;alf0(n - 1)) ∧ (af2 from ii(n)) to # (n = 0 ⊃ al0;alf0(n - 1)) = (n = 0 ⊃ al0;alf0(n - 1))) ∨ ¬(∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∨ ¬ (∀ n0. frag(IOAut(startf0, stepf0))(⌜slf0(n0)⌝ , ⌜alf0(n0)⌝ ) ∧ slf0(n0)[0] = endstate(nf0(n0)) ∧ slf0(n0).last = endstate(nf0(n0 + 1)) ∧ ⌜alf0(n0)⌝ ^ = ⌜af1(n0 + m0) '⌝ ^) ⊦ |
ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ii0(1) ≠ # al ∨ ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ ∨ ¬(∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1))) ∨ ¬(∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∨ ¬ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^) ⊦
Used terms: ii0, al, af, m, af0, alf, startf, stepf, slf, nf
| ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ii0(1) ≠ # al ∨ ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ ∨ ¬(∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1))) ∨ ¬(∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∨ ¬ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^) ⊦ |
⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: m1
| slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
slf(m1).last = s, slf(m1)[0] = endstate(nf(m1)), ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, nf(m1 + 1) = α × s, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m1 + 1), ασ, st
| slf(m1).last = s, slf(m1)[0] = endstate(nf(m1)), ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, nf(m1 + 1) = α × s, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
slf(m1)[0] = s, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × s, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m1), ασ, st
| slf(m1)[0] = s, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × s, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ii0((m1 + 1) + 1) = ii0(m1 + 1) + # (m1 + 1 = 0 ⊃ al;alf(m1 + 1 - 1)), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (af0 from ii0(m1 + 1)) to # (m1 + 1 = 0 ⊃ al;alf(m1 + 1 - 1)) = (m1 + 1 = 0 ⊃ al;alf(m1 + 1 - 1)), ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: m1 + 1
| ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ii0((m1 + 1) + 1) = ii0(m1 + 1) + # (m1 + 1 = 0 ⊃ al;alf(m1 + 1 - 1)), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (af0 from ii0(m1 + 1)) to # (m1 + 1 = 0 ⊃ al;alf(m1 + 1 - 1)) = (m1 + 1 = 0 ⊃ al;alf(m1 + 1 - 1)), ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ m + 1 ≠ 0; (s)
| ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜(af from m) to m1 + 1⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
⊦ nf to m + 1 = (nf to m) + nf(m) '
⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜((af from m) to m1) + ((af from m))(m1) '⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used terms: m1, af from m
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜((af from m) to m1) + ((af from m))(m1) '⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜(af from m) to m1⌝ ^ + ⌜alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ((nf from n))(m) = nf(m + n); (s)
| ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ⌜(af from m) to m1⌝ ^ = ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜(af from m) to m1⌝ ^ + ⌜alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
| ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], (af0 from ii0(m1 + 1)) to # alf(m1) = alf(m1), ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + #((af0 from ii0(m1 + 1)) to # alf(m1)), nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + #((af0 from ii0(m1 + 1)) to # alf(m1)), nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜af(m1 + m) '⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: ⊦ #(nf to n) = n; (s)
| ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜af(m1 + m) '⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ = ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ , ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ , ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used formulas: ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ = ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝
| ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ = ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ , ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)) = (af0 from # al) to (ii0(2 + m1) - # al), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| ((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)) = (af0 from # al) to (ii0(2 + m1) - # al), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ σ + σ1 = σ + σ2 ↔ σ1 = σ2 ∨ # σ = ∞; (ws) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ , ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)) ≠ (af0 from # al) to (ii0(2 + m1) - # al), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)
| ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, ((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)) ≠ (af0 from # al) to (ii0(2 + m1) - # al), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), #(((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1))) ≠ #((af0 from # al) to (ii0(2 + m1) - # al)) ∨ (∃ n. ¬ ( n < #(((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1))) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[n] = ((af0 from # al) to (ii0(2 + m1) - # al))[n])) ⊦
Used terms: (af0 from # al) to (ii0(2 + m1) - # al), ((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1))
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| ii0(1) = # al, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), #(((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1))) ≠ #((af0 from # al) to (ii0(2 + m1) - # al)) ∨ (∃ n. ¬ ( n < #(((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1))) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[n] = ((af0 from # al) to (ii0(2 + m1) - # al))[n])) ⊦ |
ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(2 + m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n → n ≠ 0; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ #(nf to n) = n; (s) ⊦ #(x + y) = # x + # y; (s)
| ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(2 + m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(2 + m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦ |
ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦
| ii0(1) = # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦ |
m ≤ n ⊦ (n - m) + n0 = n + n0 - m
ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ¬ # al ≤ ii0(m1 + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦
ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), # al ≤ ii0(m1 + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii0(m1 + 1) + # alf(m1) - # al ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < ii0(m1 + 1) + # alf(m1) - # al → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦
Used terms: # alf(m1), # al, ii0(m1 + 1)
| m ≤ n ⊦ (n - m) + n0 = n + n0 - m |
| ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ¬ # al ≤ ii0(m1 + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦ |
ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, al ≠ [], ii0(m1 + 1) < # al, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)
| ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, al ≠ [], ii0(m1 + 1) < # al, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, (ii0(m1 + 1) - # al) + # alf(m1) ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < (ii0(m1 + 1) - # al) + # alf(m1) → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦ |
Used simplifier rules: ⊦ m ≤ m + n; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ¬ n < n; (s) Used terms: 1, m1 + 1
| ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) + # alf(m1) - # al)⌝ ^, frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), # al ≤ ii0(m1 + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii0(m1 + 1) + # alf(m1) - # al ≠ ii0(m1 + 1) + # alf(m1) - # al ∨ ¬ ( m0 < ii0(m1 + 1) + # alf(m1) - # al → (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] = af0(m0 + # al)) ⊦ |
ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) - # al) + # alf(m1)⌝ ^, ii0(m1 + 1) + # alf(m1) ≠ # al, (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] ≠ af0(m0 + # al), m0 < (ii0(m1 + 1) - # al) + # alf(m1), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), # al ≤ ii0(m1 + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s)
| ii0(1) = # al, nf(m1) = α0 × slf(m1)[0], nf(m1 + 1) = α × slf(m1).last, ⌜(af0 from # al) to (ii0(m1 + 1) - # al)⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to (ii0(m1 + 1) - # al) + # alf(m1)⌝ ^, ii0(m1 + 1) + # alf(m1) ≠ # al, (((af0 from # al) to (ii0(m1 + 1) - # al)) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] ≠ af0(m0 + # al), m0 < (ii0(m1 + 1) - # al) + # alf(m1), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), # al ≤ ii0(m1 + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
ii0(1) = # al, ii0(m1 + 1) = n1 + # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to n1⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to n1 + # alf(m1)⌝ ^, ii0(m1 + 1) + # alf(m1) ≠ # al, (((af0 from # al) to n1) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] ≠ af0(m0 + # al), m0 < n1 + # alf(m1), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), # al ≤ ii0(m1 + 1), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: ii0(m1 + 1), # al, n1
| ii0(1) = # al, ii0(m1 + 1) = n1 + # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to n1⌝ ^ + ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to n1 + # alf(m1)⌝ ^, ii0(m1 + 1) + # alf(m1) ≠ # al, (((af0 from # al) to n1) + ((af0 from ii0(m1 + 1)) to # alf(m1)))[m0] ≠ af0(m0 + # al), m0 < n1 + # alf(m1), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from ii0(m1 + 1)) to # alf(m1)⌝ ), # al ≤ ii0(m1 + 1), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
ii0(1) = # al, ii0(m1 + 1) = n1 + # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to n1⌝ ^ + ⌜(af0 from n1 + # al) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to n1 + # alf(m1)⌝ ^, (((af0 from # al) to n1) + ((af0 from n1 + # al) to # alf(m1)))[m0] ≠ af0(m0 + # al), m0 < n1 + # alf(m1), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from n1 + # al) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≤ m + n; (s) ⊦ m < n → n ≠ 0; (s) ⊦ m = m + n ↔ n = 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ii0(1) = # al, ii0(m1 + 1) = n1 + # al, nf(m1 + 1) = α × slf(m1).last, nf(m1) = α0 × slf(m1)[0], ⌜(af0 from # al) to n1⌝ ^ + ⌜(af0 from n1 + # al) to # alf(m1)⌝ ^ ≠ ⌜(af0 from # al) to n1 + # alf(m1)⌝ ^, (((af0 from # al) to n1) + ((af0 from n1 + # al) to # alf(m1)))[m0] ≠ af0(m0 + # al), m0 < n1 + # alf(m1), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜(af0 from n1 + # al) to # alf(m1)⌝ ), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ m ≤ n ↔ ¬ n < m; (ss) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n → (n ≤ m ↔ false); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ #(nf to n) = n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ n ≤ n0 → (m + (n0 - n)) + n = m + n0; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n < # x → (x + y)[n] = x[n]; (s) ⊦ m ≤ n → (n < m ↔ false); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: m0, (af0 from n1 + # al) to # alf(m1), (af0 from # al) to n1
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(0 + 1) = ii(0) + # (0 = 0 ⊃ sl;tl(slf(0 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(0)) to # (0 = 0 ⊃ sl;tl(slf(0 - 1))) = (0 = 0 ⊃ sl;tl(slf(0 - 1))), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used terms: 0
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(0 + 1) = ii(0) + # (0 = 0 ⊃ sl;tl(slf(0 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(0)) to # (0 = 0 ⊃ sl;tl(slf(0 - 1))) = (0 = 0 ⊃ sl;tl(slf(0 - 1))), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ nf from 0 = nf; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ¬ frag(IOAut(startf, stepf))(⌜sf0⌝ , ⌜af0⌝ ), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , # ⌜sf0⌝ ≠ # ⌜af0⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜af0⌝ → stepf(⌜sf0⌝ [n], ⌜af0⌝ [n], ⌜sf0⌝ [n +1]))) ⊦
Used terms: ⌜af0⌝ , ⌜sf0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , # ⌜sf0⌝ ≠ # ⌜af0⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜af0⌝ → stepf(⌜sf0⌝ [n], ⌜af0⌝ [n], ⌜sf0⌝ [n +1]))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∃ m. ii(m) ≤ m0 ∧ m0 < ii(m + 1) ⊦
Used terms: m0
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∃ m. ii(m) ≤ m0 ∧ m0 < ii(m + 1) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used terms: m1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, m1 + 1 ≠ 0 → ii(m1 + 1) = ii0(m1 + 1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: m1 + 1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, m1 + 1 ≠ 0 → ii(m1 + 1) = ii0(m1 + 1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m + 1 ≠ 0; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ ii0(m1 + 1), m0 ≤ ii0(m1 + 1), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used terms: m1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ ii0(m1 + 1), m0 ≤ ii0(m1 + 1), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) ≠ [], ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ ii0(m1 + 1), m0 ≤ ii0(m1 + 1), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) ≠ [], ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ ii0(m1 + 1), m0 ≤ ii0(m1 + 1), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, m1 = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # sl = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) ≠ [], m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # tl(slf(m1 - 1)) = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) ≠ [], m1 ≠ 0, m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, m1 = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # sl = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) ≠ [], m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl = ii0(1) + 1, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, sl ≠ [], m0 < # sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(hd(sl)), startf(sf0(0)), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ 0 ≤ m; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ n + 0 = n; (s) ⊦ m < n → n ≠ 0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ nf from 0 = nf; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ x ≠ [] → x[0] = hd(x); (s)
| # sl = ii0(1) + 1, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, sl ≠ [], m0 < # sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(hd(sl)), startf(sf0(0)), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# sl = ii0(1) + 1, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sl = s + sl0, sf0 to # sl = sl, sl ≠ [], m0 < # sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: sl, s, y
| # sl = ii0(1) + 1, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sl = s + sl0, sf0 to # sl = sl, sl ≠ [], m0 < # sl, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = ii0(1) + 1, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(s), startf(sf0(0)), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)
| # sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = ii0(1) + 1, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(s), startf(sf0(0)), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = ii0(1) + 1, ii(0) = 0, ii(0 + 1) = ii(0) + # (0 = 0 ⊃ s ' + sl0;tl(slf(0 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, (sf0 from ii(0)) to # (0 = 0 ⊃ s ' + sl0;tl(slf(0 - 1))) = (0 = 0 ⊃ s ' + sl0;tl(slf(0 - 1))), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| # sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = ii0(1) + 1, ii(0) = 0, ii(0 + 1) = ii(0) + # (0 = 0 ⊃ s ' + sl0;tl(slf(0 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, (sf0 from ii(0)) to # (0 = 0 ⊃ s ' + sl0;tl(slf(0 - 1))) = (0 = 0 ⊃ s ' + sl0;tl(slf(0 - 1))), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = ii0(1) + 1, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(s), startf(sf0(0)), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ nf from 0 = nf; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = ii0(1) + 1, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(s), startf(sf0(0)), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = ii0(1) + 1, ii(0) = 0, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # (0 = 0 ⊃ al;alf(0 - 1)), nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, (af0 from ii0(0)) to # (0 = 0 ⊃ al;alf(0 - 1)) = (0 = 0 ⊃ al;alf(0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| # sl0 = ii0(1), ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = ii0(1) + 1, ii(0) = 0, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # (0 = 0 ⊃ al;alf(0 - 1)), nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, (af0 from ii0(0)) to # (0 = 0 ⊃ al;alf(0 - 1)) = (0 = 0 ⊃ al;alf(0 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ ii0(1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ nf from 0 = nf; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜sl0⌝ , ⌜al⌝ ), startf(sf0(0)), startf(s), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜s '⌝ + ⌜sl0⌝ ) = # ⌜al⌝ + ⌜1⌝ , # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf((⌜s '⌝ + ⌜sl0⌝ )[n], ⌜al⌝ [n], (⌜s '⌝ + ⌜sl0⌝ )[n +1]) ⊦
Used terms: ⌜al⌝ , ⌜s '⌝ + ⌜sl0⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜s '⌝ + ⌜sl0⌝ ) = # ⌜al⌝ + ⌜1⌝ , # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf((⌜s '⌝ + ⌜sl0⌝ )[n], ⌜al⌝ [n], (⌜s '⌝ + ⌜sl0⌝ )[n +1]) ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # al → stepf((s ' + sl0)[n], al[n], sl0[n]) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # al → stepf((s ' + sl0)[n], al[n], sl0[n]) ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used terms: m0
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, m0 ≠ # al, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, m0 = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used formulas: m0 ≠ # al
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, m0 ≠ # al, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≠ n → (m ≤ n ↔ m < n); (s)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(sf0 to ii(1)) = #(s ' + sl0), # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < #(sf0 to ii(1)) → (sf0 to ii(1))[n] = (s ' + sl0)[n] ⊦
Used terms: s ' + sl0, sf0 to ii(1)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(sf0 to ii(1)) = #(s ' + sl0), # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < #(sf0 to ii(1)) → (sf0 to ii(1))[n] = (s ' + sl0)[n] ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < ii(1) → sf0(m0) = (s ' + sl0)[m0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦
Used terms: m0
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < ii(1) → sf0(m0) = (s ' + sl0)[m0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, m0 < ii(1), fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < ii(1) → sf0(m0) = (s ' + sl0)[m0], ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n < m ↔ false); (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used formulas: m0 < ii(1)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, m0 < ii(1), fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < ii(1) → sf0(m0) = (s ' + sl0)[m0], ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < ii(1), m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≠ n → (m < n + 1 ↔ m < n); (s) ⊦ m < n → n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < ii(1), m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, m0 < ii(1), fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 + 1 < ii(1) → sf0(m0 + 1) = (s ' + sl0)[m0 + 1], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used terms: m0 + 1
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < # al, m0 < ii(1), fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 + 1 < ii(1) → sf0(m0 + 1) = (s ' + sl0)[m0 + 1], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], sf0(m0 + 1) = sl0[m0], af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < ii(1), m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sl0[m0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], sf0(m0 + 1) = sl0[m0], af0 to # al = al, al ≠ [], m0 ≠ # al, m0 < ii(1), m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sl0[m0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(af0 to # al) = # al, # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0 + 1) = sl0[m0], sf0(m0) = (s ' + sl0)[m0], al ≠ [], m0 ≠ # al, m0 < # al, m0 < ii(1), fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. n < #(af0 to # al) → (af0 to # al)[n] = al[n] ⊦
Used terms: al, af0 to # al
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(af0 to # al) = # al, # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0 + 1) = sl0[m0], sf0(m0) = (s ' + sl0)[m0], al ≠ [], m0 ≠ # al, m0 < # al, m0 < ii(1), fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. n < #(af0 to # al) → (af0 to # al)[n] = al[n] ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], sf0(m0 + 1) = sl0[m0], al ≠ [], m0 ≠ # al, m0 < ii(1), m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sl0[m0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # al → af0(n) = al[n] ⊦
Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0(m0) = (s ' + sl0)[m0], sf0(m0 + 1) = sl0[m0], al ≠ [], m0 ≠ # al, m0 < ii(1), m0 < # al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), stepf(sf0(m0), al[m0], sl0[m0]), ¬ stepf(sf0(m0), af0(m0), sl0[m0]), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # al → af0(n) = al[n] ⊦ |
Used terms: m0
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, m0 = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), m0 ≤ # al, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 < # al → stepf((s ' + sl0)[m0], al[m0], sl0[m0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ¬ n < n; (s) ⊦ m ≤ m; (s)
| # sl0 = # al, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, slf(0).last = endstate(nf(0 + 1)), slf(0)[0] = endstate(nf(0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(0 + m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used terms: 0
| # sl0 = # al, slf(0).last = endstate(nf(0 + 1)), slf(0)[0] = endstate(nf(0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(0 + m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = # al, slf(0).last = endstate(nf(1)), slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × slf(0)[0], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| # sl0 = # al, slf(0).last = endstate(nf(1)), slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × slf(0)[0], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
# sl0 = # al, slf(0).last = s0, slf(0)[0] = (s ' + sl0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × s0, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(1), ασ, st
| # sl0 = # al, slf(0).last = s0, slf(0)[0] = (s ' + sl0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × s0, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = ⌜af to m⌝ × slf(0)[0], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦
| # sl0 = # al, slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = ⌜af to m⌝ × slf(0)[0], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜slf(0)⌝ = # ⌜alf(0)⌝ + ⌜1⌝ , # sl0 = # al, slf(0)[0] = (s ' + sl0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ⌜n⌝ < # ⌜alf(0)⌝ → stepf(⌜slf(0)⌝ [n], ⌜alf(0)⌝ [n], ⌜slf(0)⌝ [n +1]) ⊦
Used terms: ⌜alf(0)⌝ , ⌜slf(0)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜slf(0)⌝ = # ⌜alf(0)⌝ + ⌜1⌝ , # sl0 = # al, slf(0)[0] = (s ' + sl0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ⌜n⌝ < # ⌜alf(0)⌝ → stepf(⌜slf(0)⌝ [n], ⌜alf(0)⌝ [n], ⌜slf(0)⌝ [n +1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = ⌜af to m⌝ × slf(0)[0], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = ⌜af to m⌝ × slf(0)[0], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))) = (n = 0 ⊃ s ' + sl0;tl(slf(n - 1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii(1 + 1) = ii(1) + # (1 = 0 ⊃ s ' + sl0;tl(slf(1 - 1))), ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # (1 = 0 ⊃ s ' + sl0;tl(slf(1 - 1))) = (1 = 0 ⊃ s ' + sl0;tl(slf(1 - 1))), fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 1
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # al + 1, ii(0) = 0, ii(1 + 1) = ii(1) + # (1 = 0 ⊃ s ' + sl0;tl(slf(1 - 1))), ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # (1 = 0 ⊃ s ' + sl0;tl(slf(1 - 1))) = (1 = 0 ⊃ s ' + sl0;tl(slf(1 - 1))), fin(IOAut(startf, stepf)), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = ⌜af to m⌝ × slf(0)[0], (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(0).last, nf(0) = ⌜af to m⌝ × slf(0)[0], (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1).last = endstate(nf(1 + 1)), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = endstate(nf(1)), ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 1
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1).last = endstate(nf(1 + 1)), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = endstate(nf(1)), ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(0).last, sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1).last = endstate(nf(2)), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1).last = endstate(nf(2)), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1).last = s0, slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × s0, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(2), ασ, st
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1).last = s0, slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × s0, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, ii0(1 + 1) = ii0(1) + # (1 = 0 ⊃ al;alf(1 - 1)), nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, (af0 from ii0(1)) to # (1 = 0 ⊃ al;alf(1 - 1)) = (1 = 0 ⊃ al;alf(1 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
Used terms: 1
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, ii0(1 + 1) = ii0(1) + # (1 = 0 ⊃ al;alf(1 - 1)), nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, (af0 from ii0(1)) to # (1 = 0 ⊃ al;alf(1 - 1)) = (1 = 0 ⊃ al;alf(1 - 1)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], (af0 from # al) to # alf(0) = alf(0), sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], (af0 from # al) to # alf(0) = alf(0), sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((af0 from # al) to # alf(0)) = # alf(0), # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. n < #((af0 from # al) to # alf(0)) → ((af0 from # al) to # alf(0))[n] = alf(0)[n] ⊦
Used terms: alf(0), (af0 from # al) to # alf(0)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((af0 from # al) to # alf(0)) = # alf(0), # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. n < #((af0 from # al) to # alf(0)) → ((af0 from # al) to # alf(0))[n] = alf(0)[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(0) → af0(n + # al) = alf(0)[n] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(0) → af0(n + # al) = alf(0)[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), 0 < # alf(0) → af0(0 + # al) = alf(0)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
Used terms: 0
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), 0 < # alf(0) → af0(0 + # al) = alf(0)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), alf(0) ≠ [] → af0(# al) = hd(alf(0)), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), alf(0) ≠ [] → af0(# al) = hd(alf(0)), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af(m) = τ, alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, ii0(2) = # al, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s)
| # sl0 = # al, 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af(m) = τ, alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(1) = # al, ii0(0) = 0, ii0(2) = # al, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
Used terms: m
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), af0(# al), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, (sf0 from ii(1)) to # tl(slf(0)) = tl(slf(0)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((sf0 from ii(1)) to # tl(slf(0))) = # tl(slf(0)), # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. n < #((sf0 from ii(1)) to # tl(slf(0))) → ((sf0 from ii(1)) to # tl(slf(0)))[n] = tl(slf(0))[n] ⊦
Used terms: tl(slf(0)), (sf0 from ii(1)) to # tl(slf(0))
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((sf0 from ii(1)) to # tl(slf(0))) = # tl(slf(0)), # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. n < #((sf0 from ii(1)) to # tl(slf(0))) → ((sf0 from ii(1)) to # tl(slf(0)))[n] = tl(slf(0))[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # tl(slf(0)) → sf0(n + ii(1)) = tl(slf(0))[n] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # tl(slf(0)) → sf0(n + ii(1)) = tl(slf(0))[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), 0 < # tl(slf(0)) → sf0(0 + ii(1)) = tl(slf(0))[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
Used terms: 0
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), 0 < # tl(slf(0)) → sf0(0 + ii(1)) = tl(slf(0))[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), tl(slf(0)) ≠ [] → sf0(ii(1)) = hd(tl(slf(0))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), tl(slf(0)) ≠ [] → sf0(ii(1)) = hd(tl(slf(0))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, tl(slf(0)) = [], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(tl(slf(0))), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, tl(slf(0)) = [], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, tl(slf(0)) = [], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ # [] = 0; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, tl(slf(0)) = [], af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sl = [], slf(0) = s0 + sl, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: slf(0), head, tail
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sl = [], slf(0) = s0 + sl, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, slf(1)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af(m) = τ, af0(# al) = hd([]), alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1), ii0(2) = # al, ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(1)[0], nf(2) = α0 × slf(1).last, slf(0) = slf(1)[0] ', af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd([]), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ a ' ≠ []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ # a ' = 0 +1; (s) ⊦ hd(a ') = a; (s) ⊦ a '.last = a; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) ⊦ a + x = a ' + x; (s)
| # sl0 = # al, slf(1)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af(m) = τ, af0(# al) = hd([]), alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1), ii0(2) = # al, ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(1)[0], nf(2) = α0 × slf(1).last, slf(0) = slf(1)[0] ', af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd([]), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
Used terms: m
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(tl(slf(0))), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(0) → stepf(slf(0)[n], alf(0)[n], slf(0)[n + 1]) ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(tl(slf(0))), sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), 0 < # alf(0) → stepf(slf(0)[0], alf(0)[0], slf(0)[0 + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # tl(slf(0)), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(tl(slf(0))), sf0 to ii(1) = s ' + sl0, af0 to # al = al, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), 0 < # alf(0) → stepf(slf(0)[0], alf(0)[0], slf(0)[0 + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(tl(slf(0))), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), alf(0) ≠ [] → stepf(slf(0)[0], hd(alf(0)), slf(0)[1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, slf(0)[0] = (s ' + sl0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # tl(slf(0)), ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × slf(0)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(tl(slf(0))), af0 to # al = al, sf0 to ii(1) = s ' + sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), alf(0) ≠ [] → stepf(slf(0)[0], hd(alf(0)), slf(0)[1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), slf(0) = s0 + sl, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), alf(0) ≠ [] → stepf(slf(0)[0], hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: slf(0), head, tail
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(0)[0] = (s ' + sl0).last, slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × slf(0)[0], nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), slf(0) = s0 + sl, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), ¬ stepf(sf0(# al), hd(alf(0)), sf0(ii(1))), alf(0) ≠ [] → stepf(slf(0)[0], hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), hd(slf(0)) = (s ' + sl0).last, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × hd(slf(0)), nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), slf(0) = s0 ' + sl, af0 to # al = al, sf0 to ii(1) = s ' + sl0, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), s0 ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf(hd(slf(0)), hd(alf(0)), slf(0)[1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ a + x = a ' + x; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), hd(slf(0)) = (s ' + sl0).last, ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × hd(slf(0)), nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), slf(0) = s0 ' + sl, af0 to # al = al, sf0 to ii(1) = s ' + sl0, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), s0 ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf(hd(slf(0)), hd(alf(0)), slf(0)[1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × s1, nf(1) = α × slf(1)[0], s1 = (s ' + sl0).last, sf0(ii(1)) = hd(sl), slf(0) = s0 ' + sl, slf(0) = s1 + sl1, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), s0 ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf(s1, hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: slf(0), s1, y
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × s1, nf(1) = α × slf(1)[0], s1 = (s ' + sl0).last, sf0(ii(1)) = hd(sl), slf(0) = s0 ' + sl, slf(0) = s1 + sl1, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), s0 ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf(s1, hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] eq-05: ⊦ x = a ' + y ∧ x = b ' + z → a = b ∧ y = z; (forward) from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ a + x = a ' + x; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, sf0 to ii(1) = s ' + sl0, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(sf0 to ii(1)) = #(s ' + sl0), # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < #(sf0 to ii(1)) → (sf0 to ii(1))[n] = (s ' + sl0)[n] ⊦
Used terms: s ' + sl0, sf0 to ii(1)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(sf0 to ii(1)) = #(s ' + sl0), # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < #(sf0 to ii(1)) → (sf0 to ii(1))[n] = (s ' + sl0)[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), # al < ii(1) → sf0(# al) = (s ' + sl0)[# al], ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦
Used terms: # al
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), # al < ii(1) → sf0(# al) = (s ' + sl0)[# al], ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(2) = α0 × slf(1).last, sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m ≤ m; (s) ⊦ m < n → n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m = n + 1 → ¬ m ≤ n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × (s ' + sl0).last, nf(2) = α0 × slf(1).last, sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), slf(0) = (s ' + sl0).last ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), (s ' + sl0).last ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0).last, hd(alf(0)), slf(0)[1]), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
⊦ x ≠ [] → x[# x - 1] = x.last
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × (s ' + sl0)[#(s ' + sl0) - 1], nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], slf(0) = (s ' + sl0)[#(s ' + sl0) - 1] ' + sl, af0 to # al = al, s ' + sl0 ≠ [], slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), (s ' + sl0)[#(s ' + sl0) - 1] ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0)[#(s ' + sl0) - 1], hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: s ' + sl0
| ⊦ x ≠ [] → x[# x - 1] = x.last |
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(2) = α0 × slf(1).last, nf(0) = ⌜af to m⌝ × (s ' + sl0)[#(s ' + sl0) - 1], nf(1) = α × slf(1)[0], sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], slf(0) = (s ' + sl0)[#(s ' + sl0) - 1] ' + sl, af0 to # al = al, s ' + sl0 ≠ [], slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), (s ' + sl0)[#(s ' + sl0) - 1] ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf((s ' + sl0)[#(s ' + sl0) - 1], hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(0) = ⌜af to m⌝ × sf0(# al), nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], slf(0) = sf0(# al) ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf(sf0(# al), hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s)
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(0) = ⌜af to m⌝ × sf0(# al), nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], slf(0) = sf0(# al) ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), alf(0) ≠ [] → stepf(sf0(# al), hd(alf(0)), slf(0)[1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦ |
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), slf(0) = sf0(# al) ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
# sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), slf(0) = sf0(# al) ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), stepf(sf0(# al), hd(alf(0)), slf(0)[1]), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), alf(0) = [], ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), slf(0) = sf0(# al) ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
# sl0 = # al, 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af(m) = τ, af0(# al) = hd([]), alf(0) = [], ii(2) = ii(1), ii(0) = 0, ii(1) = # al + 1, ii0(2) = # al, ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd([]), slf(0) = sf0(# al) ', af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd([]), hd([])), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ # [] = 0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x = x + y ↔ y = []; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic onein: ⊦ # x = 1 ∧ a ∈ x → x = a '; (forward) from specification list[IOstatestream] ⊦ # [] = 0; (s) ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s)
| # sl0 = # al, 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af(m) = τ, af0(# al) = hd([]), alf(0) = [], ii(2) = ii(1), ii(0) = 0, ii(1) = # al + 1, ii0(2) = # al, ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd([]), slf(0) = sf0(# al) ', af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd([]), hd([])), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
Used terms: m
| # sl0 = # al, # alf(0) + 1 = # slf(0), slf(1)[0] = slf(0).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # alf(0), ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), slf(0) = sf0(# al) ' + sl, af0 to # al = al, slf(0) ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), stepf(sf0(# al), hd(alf(0)), slf(0)[1]), sf0(# al) ∈ slf(0), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
# sl0 = # al, # alf(0) + 1 = #(sf0(# al) ' + sl), slf(1)[0] = (sf0(# al) ' + sl).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(0) = ⌜af to m⌝ × sf0(# al), nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], af0 to # al = al, sf0(# al) ' + sl ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), stepf(sf0(# al), hd(alf(0)), (sf0(# al) ' + sl)[1]), sf0(# al) ∈ sf0(# al) ' + sl, ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦
| # sl0 = # al, # alf(0) + 1 = #(sf0(# al) ' + sl), slf(1)[0] = (sf0(# al) ' + sl).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # alf(0), nf(0) = ⌜af to m⌝ × sf0(# al), nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], af0 to # al = al, sf0(# al) ' + sl ≠ [], # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), stepf(sf0(# al), hd(alf(0)), (sf0(# al) ' + sl)[1]), sf0(# al) ∈ sf0(# al) ' + sl, ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦ |
# sl0 = # al, # alf(0) = # sl, slf(1)[0] = (sf0(# al) ' + sl).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # sl, ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), af0 to # al = al, # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), stepf(sf0(# al), hd(alf(0)), sl[0]), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] n ≠ 0 ⊦ (a ' + x)[(* n)] = x[n -1]; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)
| # sl0 = # al, # alf(0) = # sl, slf(1)[0] = (sf0(# al) ' + sl).last, ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, af0(# al) = hd(alf(0)), ii(0) = 0, ii(1) = # al + 1, ii(2) = ii(1) + # sl, ii0(2) = # al + # sl, ii0(1) = # al, ii0(0) = 0, nf(2) = α0 × slf(1).last, nf(1) = α × slf(1)[0], nf(0) = ⌜af to m⌝ × sf0(# al), sf0(# al) = (s ' + sl0)[# al], sf0(ii(1)) = hd(sl), af0 to # al = al, # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(s), startf(sf0(0)), stepf(sf0(# al), hd(alf(0)), sl[0]), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ ⊦ |
# alf(0) = # sl, # sl0 = # al, slf(1)[0] = (sf0(# al) ' + sl).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # sl, nf(0) = ⌜af to m⌝ × sf0(# al), nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], sl = [], af0 to # al = al, # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), stepf(sf0(# al), hd(alf(0)), sl[0]), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦
Used simplifier rules: statelist freely generated by [], +;; a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ a + x = a ' + x; (s) ⊦ hd(a ' + x) = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream]
| # alf(0) = # sl, # sl0 = # al, slf(1)[0] = (sf0(# al) ' + sl).last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af0(# al) = hd(alf(0)), ii(2) = ii(1) + # sl, ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al + # sl, nf(0) = ⌜af to m⌝ × sf0(# al), nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd(sl), sf0(# al) = (s ' + sl0)[# al], sl = [], af0 to # al = al, # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), stepf(sf0(# al), hd(alf(0)), sl[0]), ¬ stepf(sf0(# al), hd(alf(0)), hd(sl)), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦ |
# sl0 = # al, slf(1)[0] = (s ' + sl0)[# al], slf(1)[0] = sf0(# al), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af(m) = τ, af0(# al) = hd([]), alf(0) = [], ii(2) = ii(1), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al, nf(0) = ⌜af to m⌝ × slf(1)[0], nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd([]), af0 to # al = al, # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), stepf(slf(1)[0], hd([]), [][0]), ¬ stepf(slf(1)[0], hd([]), hd([])), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦
Used simplifier rules: ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| # sl0 = # al, slf(1)[0] = (s ' + sl0)[# al], slf(1)[0] = sf0(# al), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(1)⌝ ^ = ⌜af(1 + m) '⌝ ^, af(m) = τ, af0(# al) = hd([]), alf(0) = [], ii(2) = ii(1), ii(1) = # al + 1, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, ii0(2) = # al, nf(0) = ⌜af to m⌝ × slf(1)[0], nf(1) = α × slf(1)[0], nf(2) = α0 × slf(1).last, sf0(ii(1)) = hd([]), af0 to # al = al, # al < ii(1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(1)⌝ , ⌜alf(1)⌝ ), startf(sf0(0)), startf(s), stepf(slf(1)[0], hd([]), [][0]), ¬ stepf(slf(1)[0], hd([]), hd([])), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < ii(1) → sf0(n) = (s ' + sl0)[n] ⊦ |
Used terms: m
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(m1 + 1) = ii(m1) + # (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # tl(slf(m1 - 1)) = (m1 = 0 ⊃ sl;tl(slf(m1 - 1))), (m1 = 0 ⊃ sl;tl(slf(m1 - 1))) ≠ [], m1 ≠ 0, m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m1 ≠ 0 → ii(m1) = ii0(m1) + 1, ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(m1) = ii0(m1) + 1, ii(m1 + 1) = ii(m1) + # tl(slf(m1 - 1)), ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # tl(slf(m1 - 1)) = tl(slf(m1 - 1)), m1 ≠ 0, tl(slf(m1 - 1)) ≠ [], m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(m1) = ii0(m1) + 1, ii(m1 + 1) = ii(m1) + # tl(slf(m1 - 1)), ii(m1 + 1) = ii0(m1 + 1) + 1, ii(1) = # sl, ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m1)) to # tl(slf(m1 - 1)) = tl(slf(m1 - 1)), m1 ≠ 0, tl(slf(m1 - 1)) ≠ [], m0 < ii(m1 + 1), ii(m1) < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m1) ≤ m0, m0 ≤ ii0(m1 + 1), ii(m1) ≤ ii0(m1 + 1), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(m1 + 1) = ii(m1) + # tl(slf(m2)), ii(m1) = ii0(m1) + 1, ii0(0) = 0, m1 = m2 + 1, nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(m1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, m1 ≠ 0, tl(slf(m2)) ≠ [], ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ ii0(m1 + 1), m0 ≤ ii0(m1 + 1), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: m1, m2
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(m1 + 1) = ii(m1) + # tl(slf(m2)), ii(m1) = ii0(m1) + 1, ii0(0) = 0, m1 = m2 + 1, nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(m1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, m1 ≠ 0, tl(slf(m2)) ≠ [], ii(m1) < ii(m1 + 1), m0 < ii(m1 + 1), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m1) ≤ ii0(m1 + 1), m0 ≤ ii0(m1 + 1), ii(m1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ m < n → n ≠ 0; (s) let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m + 1 ≠ 0; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0((m2 + 1) + 1) = ii0(m2 + 1) + # (m2 + 1 = 0 ⊃ al;alf(m2 + 1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), (af0 from ii0(m2 + 1)) to # (m2 + 1 = 0 ⊃ al;alf(m2 + 1 - 1)) = (m2 + 1 = 0 ⊃ al;alf(m2 + 1 - 1)), tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: m2 + 1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0((m2 + 1) + 1) = ii0(m2 + 1) + # (m2 + 1 = 0 ⊃ al;alf(m2 + 1 - 1)), nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), (af0 from ii0(m2 + 1)) to # (m2 + 1 = 0 ⊃ al;alf(m2 + 1 - 1)) = (m2 + 1 = 0 ⊃ al;alf(m2 + 1 - 1)), tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, (af0 from ii0(m2 + 1)) to # alf(m2) = alf(m2), (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ m + 1 ≠ 0; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, (af0 from ii0(m2 + 1)) to # alf(m2) = alf(m2), (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((af0 from ii0(m2 + 1)) to # alf(m2)) = # alf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < #((af0 from ii0(m2 + 1)) to # alf(m2)) → ((af0 from ii0(m2 + 1)) to # alf(m2))[n] = alf(m2)[n] ⊦
Used terms: alf(m2), (af0 from ii0(m2 + 1)) to # alf(m2)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((af0 from ii0(m2 + 1)) to # alf(m2)) = # alf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < #((af0 from ii0(m2 + 1)) to # alf(m2)) → ((af0 from ii0(m2 + 1)) to # alf(m2))[n] = alf(m2)[n] ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2) → af0(n + ii0(m2 + 1)) = alf(m2)[n] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2) → af0(n + ii0(m2 + 1)) = alf(m2)[n] ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: m0 - ii0(m2 + 1)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, (sf0 from ii(m2 + 1)) to # tl(slf(m2)) = tl(slf(m2)), tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((sf0 from ii(m2 + 1)) to # tl(slf(m2))) = # tl(slf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < #((sf0 from ii(m2 + 1)) to # tl(slf(m2))) → ((sf0 from ii(m2 + 1)) to # tl(slf(m2)))[n] = tl(slf(m2))[n] ⊦
Used terms: tl(slf(m2)), (sf0 from ii(m2 + 1)) to # tl(slf(m2))
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((sf0 from ii(m2 + 1)) to # tl(slf(m2))) = # tl(slf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < #((sf0 from ii(m2 + 1)) to # tl(slf(m2))) → ((sf0 from ii(m2 + 1)) to # tl(slf(m2)))[n] = tl(slf(m2))[n] ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n] ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], m0 - ii(m2 + 1) < # tl(slf(m2)) → sf0((m0 - ii(m2 + 1)) + ii(m2 + 1)) = tl(slf(m2))[m0 - ii(m2 + 1)], ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used terms: m0 - ii(m2 + 1)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], m0 - ii(m2 + 1) < # tl(slf(m2)) → sf0((m0 - ii(m2 + 1)) + ii(m2 + 1)) = tl(slf(m2))[m0 - ii(m2 + 1)], ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0((m0 - ii(m2 + 1)) + ii(m2 + 1)) = tl(slf(m2))[m0 - ii(m2 + 1)], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0((m0 - ii(m2 + 1)) + ii(m2 + 1)) = tl(slf(m2))[m0 - ii(m2 + 1)], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), m0 < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ m0, ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, m0 = n1 + ii(m2 + 1), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n] ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: m0, ii(m2 + 1), n1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, m0 = n1 + ii(m2 + 1), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], m0 < ii(2 + m2), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), ii(m2 + 1) ≤ m0, m0 ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sf0(m0), af0(m0), sf0(m0 + 1)), m0 - ii0(m2 + 1) < # alf(m2) → af0((m0 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[m0 - ii0(m2 + 1)], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n] ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ m + n; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # tl(slf(m2)) → sf0(n + ii(m2 + 1)) = tl(slf(m2))[n], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: n1 + 1
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
slf(m2 + 1).last = endstate(nf((m2 + 1) + 1)), slf(m2 + 1)[0] = endstate(nf(m2 + 1)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used terms: m2 + 1
| slf(m2 + 1).last = endstate(nf((m2 + 1) + 1)), slf(m2 + 1)[0] = endstate(nf(m2 + 1)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
slf(m2 + 1).last = endstate(nf(2 + m2)), slf(m2 + 1)[0] = endstate(nf(m2 + 1)), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| slf(m2 + 1).last = endstate(nf(2 + m2)), slf(m2 + 1)[0] = endstate(nf(m2 + 1)), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
slf(m2 + 1).last = endstate(nf(2 + m2)), slf(m2 + 1)[0] = s, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m2 + 1), ασ, st
| slf(m2 + 1).last = endstate(nf(2 + m2)), slf(m2 + 1)[0] = s, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
slf(m2 + 1).last = endstate(nf(2 + m2)), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| slf(m2 + 1).last = endstate(nf(2 + m2)), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
slf(m2 + 1).last = s, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × s, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(2 + m2), ασ, st
| slf(m2 + 1).last = s, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × s, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 1)⌝ , ⌜alf(m2 + 1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜slf(m2 + 1)⌝ = # ⌜alf(m2 + 1)⌝ + ⌜1⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ⌜n⌝ < # ⌜alf(m2 + 1)⌝ → stepf(⌜slf(m2 + 1)⌝ [n], ⌜alf(m2 + 1)⌝ [n], ⌜slf(m2 + 1)⌝ [n +1]) ⊦
Used terms: ⌜alf(m2 + 1)⌝ , ⌜slf(m2 + 1)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜slf(m2 + 1)⌝ = # ⌜alf(m2 + 1)⌝ + ⌜1⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. ⌜n⌝ < # ⌜alf(m2 + 1)⌝ → stepf(⌜slf(m2 + 1)⌝ [n], ⌜alf(m2 + 1)⌝ [n], ⌜slf(m2 + 1)⌝ [n +1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = endstate(nf(m2 + 1)), slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used terms: m2
| # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = endstate(nf(m2 + 1)), slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s)
| # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = endstate(nf(m2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = s, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m2), ασ, st
| # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], slf(m2)[0] = s, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(m2) = α1 × slf(m2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
| # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(m2) = α1 × slf(m2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2)⌝ , ⌜alf(m2)⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜slf(m2)⌝ = # ⌜alf(m2)⌝ + ⌜1⌝ , # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × slf(m2)[0], sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. ⌜n⌝ < # ⌜alf(m2)⌝ → stepf(⌜slf(m2)⌝ [n], ⌜alf(m2)⌝ [n], ⌜slf(m2)⌝ [n +1]) ⊦
Used terms: ⌜alf(m2)⌝ , ⌜slf(m2)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜slf(m2)⌝ = # ⌜alf(m2)⌝ + ⌜1⌝ , # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × slf(m2)[0], sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. ⌜n⌝ < # ⌜alf(m2)⌝ → stepf(⌜slf(m2)⌝ [n], ⌜alf(m2)⌝ [n], ⌜slf(m2)⌝ [n +1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(m2) = α1 × slf(m2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2) → stepf(slf(m2)[n], alf(m2)[n], slf(m2)[n + 1]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(m2) = α1 × slf(m2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2) → stepf(slf(m2)[n], alf(m2)[n], slf(m2)[n + 1]) ⊦ |
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × slf(m2)[0], sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + 1 < # alf(m2) → stepf(slf(m2)[n1 + 1], alf(m2)[n1 + 1], slf(m2)[(n1 + 1) + 1]), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used terms: n1 + 1
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × slf(m2)[0], sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # tl(slf(m2)), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + 1 < # alf(m2) → stepf(slf(m2)[n1 + 1], alf(m2)[n1 + 1], slf(m2)[(n1 + 1) + 1]), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(m2) = α1 × slf(m2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # alf(m2) → stepf(slf(m2)[n1 + 1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # tl(slf(m2)), ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(m2) = α1 × slf(m2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, sf0(n1 + ii(m2 + 1)) = tl(slf(m2))[n1], sf0 to # sl = sl, tl(slf(m2)) ≠ [], n1 < # tl(slf(m2)), ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(tl(slf(m2))[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # tl(slf(m2)) → sf0((n1 + 1) + ii(m2 + 1)) = tl(slf(m2))[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # alf(m2) → stepf(slf(m2)[n1 + 1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × slf(m2)[0], sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # alf(m2) → stepf(slf(m2)[n1 + 1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: slf(m2), head, tail
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2) = α1 × slf(m2)[0], sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # alf(m2) → stepf(slf(m2)[n1 + 1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × hd(slf(m2)), nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ a + x = a ' + x; (s)
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × hd(slf(m2)), nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s0, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = s0 + sl1, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: slf(m2), s0, y
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s0, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = s0 + sl1, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] eq-05: ⊦ x = a ' + y ∧ x = b ' + z → a = b ∧ y = z; (forward) from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ a + x = a ' + x; (s)
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), ¬ # alf(m2) ≤ n1 + 1, n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used formulas: ¬ # alf(m2) ≤ n1 + 1
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), ¬ # alf(m2) ≤ n1 + 1, n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], n1 + 1 < # alf(m2), ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), s ∈ slf(m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m ≤ n ↔ ¬ n < m; (ss)
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], n1 + 1 < # alf(m2), ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), s ∈ slf(m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = (ii0(m2 + 1) + 1) + # sl0, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii0(m2 + 1) + 1) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii0(m2 + 1) + 1 < ii(2 + m2), n1 + 1 < # alf(m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), s ∈ slf(m2), ii0(m2 + 1) + 1 ≤ ii0(2 + m2), n1 + ii0(m2 + 1) + 1 ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii0(m2 + 1) + 1), sf0((n1 + ii0(m2 + 1) + 1) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii0(m2 + 1) + 1) = sl0[n1 + 1], n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = (ii0(m2 + 1) + 1) + # sl0, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii0(m2 + 1) + 1) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii0(m2 + 1) + 1 < ii(2 + m2), n1 + 1 < # alf(m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), s ∈ slf(m2), ii0(m2 + 1) + 1 ≤ ii0(2 + m2), n1 + ii0(m2 + 1) + 1 ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii0(m2 + 1) + 1), sf0((n1 + ii0(m2 + 1) + 1) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii0(m2 + 1) + 1) = sl0[n1 + 1], n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2) = # sl0, # alf(m2 + 1) + 1 = # slf(m2 + 1), # sl0 + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af0((n1 + 1) + ii0(m2 + 1)) = alf(m2)[n1 + 1], ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = (ii0(m2 + 1) + 1) + # sl0, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # sl0, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(2 + n1 + ii0(m2 + 1)) = sl0[n1 + 1], sf0(n1 + ii0(m2 + 1) + 1) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), n1 + 1 < # sl0, n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(m2)[n1 + 1], sl0[n1 + 1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m + n - m = n; (s) ⊦ m + 1 ≤ n ↔ m < n; (s)
| # alf(m2) = # sl0, # alf(m2 + 1) + 1 = # slf(m2 + 1), # sl0 + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af0((n1 + 1) + ii0(m2 + 1)) = alf(m2)[n1 + 1], ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = (ii0(m2 + 1) + 1) + # sl0, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # sl0, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(2 + n1 + ii0(m2 + 1)) = sl0[n1 + 1], sf0(n1 + ii0(m2 + 1) + 1) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), n1 + 1 < # sl0, n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(m2)[n1 + 1], sl0[n1 + 1]), ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ a ' + x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) n ≠ 0 ⊦ (a ' + x)[m + (* n)] = x[m + (n - 1)]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream]
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), slf(m2).last = slf(m2 + 1)[0], ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × slf(m2).last, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # alf(m2) → stepf(sl0[n1], alf(m2)[n1 + 1], slf(m2)[2 + n1]), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic le-one: ⊦ m ≤ n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m ≤ n → (n < m ↔ false); (s)
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), slf(m2).last = slf(m2 + 1)[0], ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2).last, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, s0 = slf(m2 + 1)[0], sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: slf(m2), s0, y
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, s0 = slf(m2 + 1)[0], sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = sl1 + slf(m2 + 1)[0] ', slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), slf(m2 + 1)[0] ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[IOstatestream]
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × slf(m2 + 1)[0], nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = sl1 + slf(m2 + 1)[0] ', slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), slf(m2 + 1)[0] ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
⊦ x ≠ [] → x[0] = hd(x)
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × hd(slf(m2 + 1)), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + hd(slf(m2 + 1)) ', sf0 to # sl = sl, sl0 ≠ [], slf(m2 + 1) ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), hd(slf(m2 + 1)) ∈ slf(m2), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[IOstatestream] a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: slf(m2 + 1)
| ⊦ x ≠ [] → x[0] = hd(x) |
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × hd(slf(m2 + 1)), nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + hd(slf(m2 + 1)) ', sf0 to # sl = sl, sl0 ≠ [], slf(m2 + 1) ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), hd(slf(m2 + 1)) ∈ slf(m2), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × hd(slf(m2 + 1)), nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = sl1 + hd(slf(m2 + 1)) ', slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2 + 1) ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), hd(slf(m2 + 1)) ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[IOstatestream]
| # alf(m2 + 1) + 1 = # slf(m2 + 1), # alf(m2) + 1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × hd(slf(m2 + 1)), nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = sl1 + hd(slf(m2 + 1)) ', slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2 + 1) ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), hd(slf(m2 + 1)) ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ ⊦ |
# alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 + sl2, sf0 to # sl = sl, sl0 ≠ [], slf(m2 + 1) ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: slf(m2 + 1), s0, y
| # alf(m2) + 1 = # slf(m2), # alf(m2 + 1) + 1 = # slf(m2 + 1), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 1).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 + sl2, sf0 to # sl = sl, sl0 ≠ [], slf(m2 + 1) ≠ [], slf(m2) ≠ [], ii(m2 + 1) < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii(m2 + 1) ≤ ii0(2 + m2), ii(m2 + 1) ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # alf(m2 + 1) → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], slf(m2 + 1)[n + 1]) ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) + 1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) ⊦ a + x = a ' + x; (s)
| # alf(m2 + 1) = # sl2, # alf(m2) + 1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = ii0(2 + m2) + 1, ii(2 + m2) = ii(m2 + 1) + # sl0, ii(m2 + 1) = ii0(m2 + 1) + 1, ii(0) = 0, ii(1) = # sl, ii0(0) = 0, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(n1 + ii(m2 + 1)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], n1 < # sl0, ii(m2 + 1) < ii(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ii(m2 + 1) ≤ ii0(2 + m2), n1 + ii(m2 + 1) ≤ ii0(2 + m2), # alf(m2) ≤ n1 + 1, # alf(m2) ≤ # sl0, ¬ stepf(sl0[n1], af0(n1 + ii(m2 + 1)), sf0((n1 + ii(m2 + 1)) + 1)), n1 + 1 < # sl0 → sf0((n1 + 1) + ii(m2 + 1)) = sl0[n1 + 1], n1 + ii(m2 + 1) - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii(m2 + 1) - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii(m2 + 1) - ii0(m2 + 1)], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) + 1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(2 + m2) = (ii0(m2 + 1) + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii0(m2 + 1) + 1) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) + 1 < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii0(m2 + 1) + 1 ≤ ii0(2 + m2), ii0(m2 + 1) + 1 ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii0(m2 + 1) + 1), sf0((n1 + ii0(m2 + 1) + 1) + 1)), n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii0(m2 + 1) + 1) = sl0[n1 + 1], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| # alf(m2 + 1) = # sl2, # alf(m2) + 1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii(2 + m2) = (ii0(m2 + 1) + 1) + # sl0, ii(2 + m2) = ii0(2 + m2) + 1, ii0(2 + m2) = ii0(m2 + 1) + # alf(m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(n1 + ii0(m2 + 1) + 1) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) + 1 < ii(2 + m2), n1 < # sl0, fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), # alf(m2) ≤ # sl0, # alf(m2) ≤ n1 + 1, n1 + ii0(m2 + 1) + 1 ≤ ii0(2 + m2), ii0(m2 + 1) + 1 ≤ ii0(2 + m2), ¬ stepf(sl0[n1], af0(n1 + ii0(m2 + 1) + 1), sf0((n1 + ii0(m2 + 1) + 1) + 1)), n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1) < # alf(m2) → af0((n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)) + ii0(m2 + 1)) = alf(m2)[n1 + ii0(m2 + 1) + 1 - ii0(m2 + 1)], n1 + 1 < # sl0 → sf0((n1 + 1) + ii0(m2 + 1) + 1) = sl0[n1 + 1], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ # x = 0 ↔ x = []; (s) lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ m + n < m; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ m + 1 ≠ 0; (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n → n ≠ 0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m + n - m = n; (s)
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ (af0 from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = (n = 0 ⊃ al;alf(n - 1)), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii0(0) = 0, ii0((2 + m2) + 1) = ii0(2 + m2) + # (2 + m2 = 0 ⊃ al;alf(2 + m2 - 1)), nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (af0 from ii0(2 + m2)) to # (2 + m2 = 0 ⊃ al;alf(2 + m2 - 1)) = (2 + m2 = 0 ⊃ al;alf(2 + m2 - 1)), alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 2 + m2
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii0(0) = 0, ii0((2 + m2) + 1) = ii0(2 + m2) + # (2 + m2 = 0 ⊃ al;alf(2 + m2 - 1)), nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (af0 from ii0(2 + m2)) to # (2 + m2 = 0 ⊃ al;alf(2 + m2 - 1)) = (2 + m2 = 0 ⊃ al;alf(2 + m2 - 1)), alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (af0 from ii0(2 + m2)) to # sl2 = alf(1 + m2), sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s)
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (af0 from ii0(2 + m2)) to # sl2 = alf(1 + m2), sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ (sf0 from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = (n = 0 ⊃ sl;tl(slf(n - 1))), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii((2 + m2) + 1) = ii(2 + m2) + # (2 + m2 = 0 ⊃ sl;tl(slf(2 + m2 - 1))), ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (af0 from ii0(2 + m2)) to # sl2 = alf(1 + m2), (sf0 from ii(2 + m2)) to # (2 + m2 = 0 ⊃ sl;tl(slf(2 + m2 - 1))) = (2 + m2 = 0 ⊃ sl;tl(slf(2 + m2 - 1))), alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 2 + m2
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii((2 + m2) + 1) = ii(2 + m2) + # (2 + m2 = 0 ⊃ sl;tl(slf(2 + m2 - 1))), ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (af0 from ii0(2 + m2)) to # sl2 = alf(1 + m2), (sf0 from ii(2 + m2)) to # (2 + m2 = 0 ⊃ sl;tl(slf(2 + m2 - 1))) = (2 + m2 = 0 ⊃ sl;tl(slf(2 + m2 - 1))), alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (af0 from ii0(2 + m2)) to # sl2 = alf(1 + m2), (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ tl(a ' + x) = x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s)
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (af0 from ii0(2 + m2)) to # sl2 = alf(1 + m2), (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((af0 from ii0(2 + m2)) to # sl2) = # alf(1 + m2), # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < #((af0 from ii0(2 + m2)) to # sl2) → ((af0 from ii0(2 + m2)) to # sl2)[n] = alf(1 + m2)[n] ⊦
Used terms: alf(1 + m2), (af0 from ii0(2 + m2)) to # sl2
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((af0 from ii0(2 + m2)) to # sl2) = # alf(1 + m2), # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < #((af0 from ii0(2 + m2)) to # sl2) → ((af0 from ii0(2 + m2)) to # sl2)[n] = alf(1 + m2)[n] ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # sl2 → af0(n + ii0(2 + m2)) = alf(1 + m2)[n] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s) c: ⊦ m + n = n + m; from specification nat-basic
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # sl2 → af0(n + ii0(2 + m2)) = alf(1 + m2)[n] ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), 0 < # sl2 → af0(0 + ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦
Used terms: 0
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), 0 < # sl2 → af0(0 + ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, slf(m2 + 2).last = endstate(nf((m2 + 2) + 1)), slf(m2 + 2)[0] = endstate(nf(m2 + 2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦
Used terms: m2 + 2
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, slf(m2 + 2).last = endstate(nf((m2 + 2) + 1)), slf(m2 + 2)[0] = endstate(nf(m2 + 2)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × (s0 ' + sl2).last, nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, slf(m2 + 2).last = endstate(nf(3 + m2)), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, slf(m2 + 2).last = endstate(nf(3 + m2)), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2).last = s1, slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × s1, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(3 + m2), ασ, st
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2).last = s1, slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × s1, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m2 + 2)⌝ , ⌜alf(m2 + 2)⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜slf(m2 + 2)⌝ = # ⌜alf(m2 + 2)⌝ + ⌜1⌝ , # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ⌜n⌝ < # ⌜alf(m2 + 2)⌝ → stepf(⌜slf(m2 + 2)⌝ [n], ⌜alf(m2 + 2)⌝ [n], ⌜slf(m2 + 2)⌝ [n +1]) ⊦
Used terms: ⌜alf(m2 + 2)⌝ , ⌜slf(m2 + 2)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜slf(m2 + 2)⌝ = # ⌜alf(m2 + 2)⌝ + ⌜1⌝ , # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. ⌜n⌝ < # ⌜alf(m2 + 2)⌝ → stepf(⌜slf(m2 + 2)⌝ [n], ⌜alf(m2 + 2)⌝ [n], ⌜slf(m2 + 2)⌝ [n +1]) ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), sl2 ≠ [] → af0(ii0(2 + m2)) = alf(1 + m2)[0], ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sl2 = [], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sl2 = [], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af((m2 + 1) + m) = τ, alf(m2 + 1) = [], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2), ii0(3 + m2) = ii0(2 + m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × slf(m2 + 2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + slf(m2 + 1), slf(m2 + 1) = slf(m2 + 2)[0] ', sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), slf(m2 + 2)[0] ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ nf to 0 = []; (s)
| # alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af((m2 + 1) + m) = τ, alf(m2 + 1) = [], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2), ii0(3 + m2) = ii0(2 + m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × slf(m2 + 2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + slf(m2 + 1), slf(m2 + 1) = slf(m2 + 2)[0] ', sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), slf(m2 + 2)[0] ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: (m2 + 1) + m
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, (sf0 from ii(2 + m2)) to # sl2 = sl2, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], af0(ii0(2 + m2)), sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, (sf0 from ii(2 + m2)) to # sl2 = sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((sf0 from ii(2 + m2)) to # sl2) = # sl2, # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < #((sf0 from ii(2 + m2)) to # sl2) → ((sf0 from ii(2 + m2)) to # sl2)[n] = sl2[n] ⊦
Used terms: sl2, (sf0 from ii(2 + m2)) to # sl2
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((sf0 from ii(2 + m2)) to # sl2) = # sl2, # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < #((sf0 from ii(2 + m2)) to # sl2) → ((sf0 from ii(2 + m2)) to # sl2)[n] = sl2[n] ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → sf0(n + ii(2 + m2)) = sl2[n] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → sf0(n + ii(2 + m2)) = sl2[n] ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), 0 < # sl2 → sf0(0 + ii(2 + m2)) = sl2[0], ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), 0 < # sl2 → sf0(0 + ii(2 + m2)) = sl2[0], ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), sl2 ≠ [] → sf0(ii(2 + m2)) = hd(sl2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦
Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), sl2 ≠ [] → sf0(ii(2 + m2)) = hd(sl2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sl2 = [], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = hd(sl2), slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sl2 = [], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af((m2 + 1) + m) = τ, af0(ii0(2 + m2)) = [][0], alf(m2 + 1) = [], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2), ii0(3 + m2) = ii0(2 + m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × slf(m2 + 2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + slf(m2 + 1), slf(m2 + 1) = slf(m2 + 2)[0] ', sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), slf(m2 + 2)[0] ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], [][0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| # alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af((m2 + 1) + m) = τ, af0(ii0(2 + m2)) = [][0], alf(m2 + 1) = [], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2), ii0(3 + m2) = ii0(2 + m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × slf(m2 + 2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + slf(m2 + 1), slf(m2 + 1) = slf(m2 + 2)[0] ', sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), slf(m2 + 2)[0] ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], [][0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: (m2 + 1) + m
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = hd(sl2), slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii(2 + m2)) = hd(sl2), sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], hd(sl2)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦
| # alf(m2 + 1) = # sl2, # alf(m2) = n1 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl2, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl2, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii(2 + m2)) = hd(sl2), sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sl2, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], hd(sl2)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = hd(sl2), sl2 = [], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], hd(sl2)), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = s1, sl2 = s1 + sl3, slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], sl2 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], s1), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = hd(x) ∧ tail = tl(x) ↔ x = head + tail); (elim) Used terms: sl2, head, tail
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = hd(sl2), sl2 = [], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], hd(sl2)), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af((m2 + 1) + m) = τ, af0(ii0(2 + m2)) = [][0], alf(m2 + 1) = [], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2), ii0(3 + m2) = ii0(2 + m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × slf(m2 + 2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = hd([]), slf(m2) = s ' + sl0, slf(m2) = sl1 + slf(m2 + 1), slf(m2 + 1) = slf(m2 + 2)[0] ', sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), slf(m2 + 2)[0] ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], [][0], hd([])), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; (s) ⊦ [] ^ = []; (s) ⊦ ⌜[]⌝ = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ x + [] = x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| # alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, af((m2 + 1) + m) = τ, af0(ii0(2 + m2)) = [][0], alf(m2 + 1) = [], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2), ii0(3 + m2) = ii0(2 + m2), ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × slf(m2 + 2)[0], nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = hd([]), slf(m2) = s ' + sl0, slf(m2) = sl1 + slf(m2 + 1), slf(m2 + 1) = slf(m2 + 2)[0] ', sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), slf(m2 + 2)[0] ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], [][0], hd([])), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: (m2 + 1) + m
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl2, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (s0 ' + sl2).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl2, ii0(3 + m2) = ii0(2 + m2) + # sl2, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sf0(ii(2 + m2)) = s1, sl2 = s1 + sl3, slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sl2, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], sl2 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], s1), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. n < # sl2 → stepf((s0 ' + sl2)[n], alf(m2 + 1)[n], sl2[n]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl3 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. ¬ # sl3 < n → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], (sf0(ii(2 + m2)) ' + sl3)[n]) ⊦
Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s)
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl3 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. ¬ # sl3 < n → stepf(slf(m2 + 1)[n], alf(m2 + 1)[n], (sf0(ii(2 + m2)) ' + sl3)[n]) ⊦ |
# alf(m2 + 1) = # sl3 + 1, # alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ¬ # sl3 < 0 → stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], (sf0(ii(2 + m2)) ' + sl3)[0]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| # alf(m2 + 1) = # sl3 + 1, # alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ¬ # sl3 < 0 → stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], (sf0(ii(2 + m2)) ' + sl3)[0]), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2) = n1 + 1, # alf(m2 + 1) = # sl3 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], sf0(ii(2 + m2))), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ (a ' + x)[0] = a; (s) ⊦ ¬ n < 0; (s)
| # alf(m2) = n1 + 1, # alf(m2 + 1) = # sl3 + 1, 2 + n1 = # slf(m2), ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), n1 + 1 = # sl0, # alf(m2 + 2) + 1 = # slf(m2 + 2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(0) = 0, ii(1) = # sl, ii(2 + m2) = ii0(2 + m2) + 1, ii0(0) = 0, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, nf(3 + m2) = α3 × slf(m2 + 2).last, nf(0) = ⌜af to m⌝ × sl.last, nf(m2 + 1) = α × s0, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2) = α1 × s, sf0(ii0(2 + m2)) = sl0[n1], slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, slf(m2) = sl1 + s0 ', slf(m2) = s ' + sl0, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), startf(sf0(0)), stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], sf0(ii(2 + m2))), s ∈ slf(m2), s0 ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. af(n) ≠ τ, ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]) ⊦ |
# alf(m2 + 1) = # sl3 + 1, # alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sl1 = s1 + sl2, slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], sf0(ii(2 + m2))), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: statelist freely generated by [], +;; ⊦ [] + x = x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ # a ' = 0 +1; (s) n < n0 ⊦ (* n) ≠ m0 + (* n0); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| # alf(m2 + 1) = # sl3 + 1, # alf(m2) = n1 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), n1 + 1 = # sl0, ii0(m2 + 1) + n1 + 1 = ii0(2 + m2), 2 + n1 = # slf(m2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + n1, ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, sf0(ii0(2 + m2)) = sl0[n1], sl1 = s1 + sl2, slf(m2) = s ' + sl0, slf(m2) = sl1 + s0 ', slf(m2 + 1) = s0 ' + sf0(ii(2 + m2)) ' + sl3, sf0 to # sl = sl, alf(m2) ≠ [], sl0 ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], sf0(ii(2 + m2))), s0 ∈ slf(m2), s ∈ slf(m2), ¬ stepf(sl0[n1], alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
# alf(m2 + 1) = # sl3 + 1, # alf(m2) = # sl2 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), ii0(m2 + 1) + # sl2 + 1 = ii0(2 + m2), 2 + # sl2 = # slf(m2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + # sl2, ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × sf0(ii0(2 + m2)), nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, slf(m2) = s ' + sl2 + sf0(ii0(2 + m2)) ', slf(m2 + 1) = sf0(ii0(2 + m2)) ' + sf0(ii(2 + m2)) ' + sl3, sf0 to # sl = sl, alf(m2) ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], sf0(ii(2 + m2))), sf0(ii0(2 + m2)) ∈ slf(m2), sf0(ii0(2 + m2)) ∈ slf(m2 + 1), s ∈ slf(m2), ¬ stepf(sf0(ii0(2 + m2)), alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[IOstatestream] ⊦ n = # x → (x + a ')[n] = a; (s) ⊦ x + a ' ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) eq-05: ⊦ x = a ' + y ∧ x = b ' + z → a = b ∧ y = z; (forward) from specification list[IOstatestream] ⊦ a + x = a ' + x; (s)
| # alf(m2 + 1) = # sl3 + 1, # alf(m2) = # sl2 + 1, # alf(m2 + 2) + 1 = # slf(m2 + 2), ii0(m2 + 1) + # sl2 + 1 = ii0(2 + m2), 2 + # sl2 = # slf(m2), slf(m2 + 2)[0] = (sf0(ii(2 + m2)) ' + sl3).last, ⌜alf(m2 + 2)⌝ ^ = ⌜af((m2 + 2) + m) '⌝ ^, ⌜alf(m2)⌝ ^ = ⌜af(m2 + m) '⌝ ^, ⌜alf(m2 + 1)⌝ ^ = ⌜af((m2 + 1) + m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , af0(ii0(2 + m2)) = alf(1 + m2)[0], ii(2 + m2) = ii0(2 + m2) + 1, ii(1) = # sl, ii(0) = 0, ii(2 + m2) = 2 + ii0(m2 + 1) + # sl2, ii(3 + m2) = ii(2 + m2) + # sl3 + 1, ii0(3 + m2) = ii0(2 + m2) + # sl3 + 1, ii0(0) = 0, nf(m2) = α1 × s, nf(2 + m2) = α0 × slf(m2 + 2)[0], nf(m2 + 1) = α × sf0(ii0(2 + m2)), nf(0) = ⌜af to m⌝ × sl.last, nf(3 + m2) = α3 × slf(m2 + 2).last, slf(m2) = s ' + sl2 + sf0(ii0(2 + m2)) ', slf(m2 + 1) = sf0(ii0(2 + m2)) ' + sf0(ii(2 + m2)) ' + sl3, sf0 to # sl = sl, alf(m2) ≠ [], slf(m2) ≠ [], ii0(m2 + 1) < ii0(2 + m2), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sf0(0)), startf(sl[0]), stepf(slf(m2 + 1)[0], alf(m2 + 1)[0], sf0(ii(2 + m2))), sf0(ii0(2 + m2)) ∈ slf(m2), sf0(ii0(2 + m2)) ∈ slf(m2 + 1), s ∈ slf(m2), ¬ stepf(sf0(ii0(2 + m2)), alf(1 + m2)[0], sf0(ii(2 + m2))), ∀ n. n < # alf(m2 + 2) → stepf(slf(m2 + 2)[n], alf(m2 + 2)[n], slf(m2 + 2)[n + 1]), ∀ n. af(n) ≠ τ, ∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ⌜af⌝ ≠ α ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(0 + 1) = ii(0) + # (0 = 0 ⊃ sl;tl(slf(0 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(0)) to # (0 = 0 ⊃ sl;tl(slf(0 - 1))) = ⌜(0 = 0 ⊃ sl;tl(slf(0 - 1)))⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜ii(0 + 1)⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(0 + 1) = ii(0) + # (0 = 0 ⊃ sl;tl(slf(0 - 1))), ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, (σ from ii(0)) to # (0 = 0 ⊃ sl;tl(slf(0 - 1))) = ⌜(0 = 0 ⊃ sl;tl(slf(0 - 1)))⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜ii(0 + 1)⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ σ from 0 = σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii(1) = # sl, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # (0 = 0 ⊃ al;alf(0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, σ to # sl = ⌜sl⌝ , (α from ii0(0)) to # (0 = 0 ⊃ al;alf(0 - 1)) = ⌜(0 = 0 ⊃ al;alf(0 - 1))⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(0 + 1)⌝ , ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦
Used terms: 0
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(0 + 1) = ii0(0) + # (0 = 0 ⊃ al;alf(0 - 1)), nf(0) = ⌜af to m⌝ × sl.last, σ to # sl = ⌜sl⌝ , (α from ii0(0)) to # (0 = 0 ⊃ al;alf(0 - 1)) = ⌜(0 = 0 ⊃ al;alf(0 - 1))⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(0 + 1)⌝ , ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, σ to # sl = ⌜sl⌝ , α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜# al⌝ , ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦
Used simplifier rules: ⊦ σ from 0 = σ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, σ to # sl = ⌜sl⌝ , α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜# al⌝ , ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦ |
slf(0).last = endstate(nf(0 + 1)), slf(0)[0] = endstate(nf(0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(0 + m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # α < ⌜# al⌝ , ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: 0
| slf(0).last = endstate(nf(0 + 1)), slf(0)[0] = endstate(nf(0)), ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(0 + m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # α < ⌜# al⌝ , ¬ # σ < ⌜# sl⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
slf(0).last = endstate(nf(1)), slf(0)[0] = sl.last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: ⊦ endstate(ασ × st) = st; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ n + 0 = n; (s)
| slf(0).last = endstate(nf(1)), slf(0)[0] = sl.last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
slf(0).last = s, slf(0)[0] = sl.last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, nf(1) = α0 × s, σ to # sl = ⌜sl⌝ , α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(1), ασ, st
| slf(0).last = s, slf(0)[0] = sl.last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, nf(1) = α0 × s, σ to # sl = ⌜sl⌝ , α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 ⊦ |
slf(0)[0] = sl.last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| slf(0)[0] = sl.last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , σ to # sl = ⌜sl⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#(σ to # sl) = # ⌜sl⌝ , slf(0)[0] = sl.last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, nf(1) = α0 × slf(0).last, α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ⌜n⌝ < #(σ to # sl) → (σ to # sl)[n] = ⌜sl⌝ [n] ⊦
Used terms: ⌜sl⌝ , σ to # sl
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #(σ to # sl) = # ⌜sl⌝ , slf(0)[0] = sl.last, ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ⌜al⌝ ^ = ⌜af to m⌝ , ii(1) = # sl, ii(0) = 0, ii0(0) = 0, ii0(1) = # al, nf(0) = ⌜af to m⌝ × sl.last, nf(1) = α0 × slf(0).last, α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ n. ⌜n⌝ < #(σ to # sl) → (σ to # sl)[n] = ⌜sl⌝ [n] ⊦ |
slf(0)[0] = sl.last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # sl → σ[n] = sl[n] ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| slf(0)[0] = sl.last, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜alf(0)⌝ ^ = ⌜af(m) '⌝ ^, ii(0) = 0, ii(1) = # sl, ii0(1) = # al, ii0(0) = 0, nf(1) = α0 × slf(0).last, nf(0) = ⌜af to m⌝ × sl.last, α to # al = ⌜al⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(0)⌝ , ⌜alf(0)⌝ ), startf(sl[0]), ¬ # σ < ⌜# sl⌝ , ¬ # α < ⌜# al⌝ , ¬ startf(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1, ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. n < # sl → σ[n] = sl[n] ⊦ |
Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s) ⊦ x ≠ [] → x[0] = hd(x); (s) Used terms: 0
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ⊦ ∀ n. n ≠ 0 → ii(n) = ii0(n) + 1 |
⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ii(m2) ≠ ii0(m2) + 1, m2 ≠ 0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , ii(0) = 0, ii0(0) = 0, nf(0) = ⌜af to m⌝ × sl.last, ii(m2) ≠ ii0(m2) + 1, m2 ≠ 0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), (finp(σ) ⊃ # σ = ⌜ii(m0)⌝ ∧ (∀ m. m0 ≤ m → (m = 0 ⊃ sl;tl(slf(m - 1))) = [] ∧ ii(m) = ii(m0));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), (finp(α) ⊃ # α = ⌜ii0(m1)⌝ ∧ (∀ m. m1 ≤ m → (m = 0 ⊃ al;alf(m - 1)) = [] ∧ ii0(m) = ii0(m1));∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1)), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
ii(0) = 0, ii0(0) = 0, ii(m2) ≠ ii0(m2) + 1, m2 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ⊦
| ii(0) = 0, ii0(0) = 0, ii(m2) ≠ ii0(m2) + 1, m2 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ⊦ |
ii(0) = 0, ii0(0) = 0, m0 +1 ≠ 0, ii(m0 +1) ≠ ii0(m0 +1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ ii, ii0, af, startf, stepf, sl, al, slf, alf, nf, m, σ, α. ¬ ( ii(0) = 0 ∧ ii0(0) = 0 ∧ ii(m0) ≠ ii0(m0) + 1 ∧ m0 ≠ 0 ∧ ext(⌜af⌝ ) ∧ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ ) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∧ (∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ )) ⊦
Used simplifier rules: nat freely generated by 0, +1;;
| ii(0) = 0, ii0(0) = 0, m0 +1 ≠ 0, ii(m0 +1) ≠ ii0(m0 +1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ ii, ii0, af, startf, stepf, sl, al, slf, alf, nf, m, σ, α. ¬ ( ii(0) = 0 ∧ ii0(0) = 0 ∧ ii(m0) ≠ ii0(m0) + 1 ∧ m0 ≠ 0 ∧ ext(⌜af⌝ ) ∧ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ ) ∧ (∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∧ (∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ )) ⊦ |
ii(0) = 0, ii0(0) = 0, ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ ii1, ii2, af0, startf0, stepf0, sl0, al0, slf0, alf0, nf0, m1, σ0, α0. ii1(0) ≠ 0 ∨ ii2(0) ≠ 0 ∨ ii1(m0) = ii2(m0) + 1 ∨ m0 = 0 ∨ ¬ ext(⌜af0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl0⌝ , ⌜al0⌝ ) ∨ ¬ startf0(sl0[0]) ∨ ¬ (∀ n0. frag(IOAut(startf0, stepf0))(⌜slf0(n0)⌝ , ⌜alf0(n0)⌝ ) ∧ slf0(n0)[0] = endstate(nf0(n0)) ∧ slf0(n0).last = endstate(nf0(n0 + 1)) ∧ ⌜alf0(n0)⌝ ^ = ⌜af0(n0 + m1) '⌝ ^) ∨ ¬(∀ m, n. m ≤ n → ii1(m) ≤ ii1(n)) ∨ ¬ (∀ n. ii1(n + 1) = ii1(n) + # (n = 0 ⊃ sl0;tl(slf0(n - 1))) ∧ ¬ # σ0 < ⌜ii1(n + 1)⌝ ∧ (σ0 from ii1(n)) to # (n = 0 ⊃ sl0;tl(slf0(n - 1))) = ⌜(n = 0 ⊃ sl0;tl(slf0(n - 1)))⌝ ) ∨ ¬(∀ m, n. m ≤ n → ii2(m) ≤ ii2(n)) ∨ ¬ (∀ n. ii2(n + 1) = ii2(n) + # (n = 0 ⊃ al0;alf0(n - 1)) ∧ ¬ # α0 < ⌜ii2(n + 1)⌝ ∧ (α0 from ii2(n)) to # (n = 0 ⊃ al0;alf0(n - 1)) = ⌜(n = 0 ⊃ al0;alf0(n - 1))⌝ ) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s)
| ii(0) = 0, ii0(0) = 0, ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ ii1, ii2, af0, startf0, stepf0, sl0, al0, slf0, alf0, nf0, m1, σ0, α0. ii1(0) ≠ 0 ∨ ii2(0) ≠ 0 ∨ ii1(m0) = ii2(m0) + 1 ∨ m0 = 0 ∨ ¬ ext(⌜af0⌝ ) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl0⌝ , ⌜al0⌝ ) ∨ ¬ startf0(sl0[0]) ∨ ¬ (∀ n0. frag(IOAut(startf0, stepf0))(⌜slf0(n0)⌝ , ⌜alf0(n0)⌝ ) ∧ slf0(n0)[0] = endstate(nf0(n0)) ∧ slf0(n0).last = endstate(nf0(n0 + 1)) ∧ ⌜alf0(n0)⌝ ^ = ⌜af0(n0 + m1) '⌝ ^) ∨ ¬(∀ m, n. m ≤ n → ii1(m) ≤ ii1(n)) ∨ ¬ (∀ n. ii1(n + 1) = ii1(n) + # (n = 0 ⊃ sl0;tl(slf0(n - 1))) ∧ ¬ # σ0 < ⌜ii1(n + 1)⌝ ∧ (σ0 from ii1(n)) to # (n = 0 ⊃ sl0;tl(slf0(n - 1))) = ⌜(n = 0 ⊃ sl0;tl(slf0(n - 1)))⌝ ) ∨ ¬(∀ m, n. m ≤ n → ii2(m) ≤ ii2(n)) ∨ ¬ (∀ n. ii2(n + 1) = ii2(n) + # (n = 0 ⊃ al0;alf0(n - 1)) ∧ ¬ # α0 < ⌜ii2(n + 1)⌝ ∧ (α0 from ii2(n)) to # (n = 0 ⊃ al0;alf0(n - 1)) = ⌜(n = 0 ⊃ al0;alf0(n - 1))⌝ ) ⊦ |
ii(0) = 0, ii0(0) = 0, ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(0) ≠ 0 ∨ ii0(0) ≠ 0 ∨ ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ∨ ¬ ext(⌜af⌝ ) ∨ ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ startf(sl[0]) ∨ ¬ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^) ∨ ¬(∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∨ ¬ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ ) ∨ ¬(∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ) ⊦
Used terms: ii, ii0, af, startf, stepf, sl, al, slf, alf, nf, m, σ, α
| ii(0) = 0, ii0(0) = 0, ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(0) ≠ 0 ∨ ii0(0) ≠ 0 ∨ ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ∨ ¬ ext(⌜af⌝ ) ∨ ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ startf(sl[0]) ∨ ¬ (∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^) ∨ ¬(∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∨ ¬ (∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ ) ∨ ¬(∀ m, n. m ≤ n → ii0(m) ≤ ii0(n)) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ ) ⊦ |
ii(0) = 0, ii0(0) = 0, ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦
| ii(0) = 0, ii0(0) = 0, ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # (n = 0 ⊃ sl;tl(slf(n - 1))) ∧ ¬ # σ < ⌜ii(n + 1)⌝ ∧ (σ from ii(n)) to # (n = 0 ⊃ sl;tl(slf(n - 1))) = ⌜(n = 0 ⊃ sl;tl(slf(n - 1)))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦ |
ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦
Used terms: m0
| ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦ |
ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii(0) = 0, ii0(0) = 0, (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦
| ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii(0) = 0, ii0(0) = 0, (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. ii0(n + 1) = ii0(n) + # (n = 0 ⊃ al;alf(n - 1)) ∧ ¬ # α < ⌜ii0(n + 1)⌝ ∧ (α from ii0(n)) to # (n = 0 ⊃ al;alf(n - 1)) = ⌜(n = 0 ⊃ al;alf(n - 1))⌝ , ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦ |
ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , (α from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = ⌜(m0 = 0 ⊃ al;alf(m0 - 1))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦
Used terms: m0
| ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , (α from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = ⌜(m0 = 0 ⊃ al;alf(m0 - 1))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦ |
ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, (α from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = ⌜(m0 = 0 ⊃ al;alf(m0 - 1))⌝ , (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦
| ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), ii0(0) = 0, (α from ii0(m0)) to # (m0 = 0 ⊃ al;alf(m0 - 1)) = ⌜(m0 = 0 ⊃ al;alf(m0 - 1))⌝ , (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦ |
ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , (α from ii0(m0)) to # alf(m0 - 1) = ⌜(m0 = 0 ⊃ al;alf(m0 - 1))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, m0 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦
Used simplifier rules: ⊦ n + 0 = n; (s) ⊦ σ from 0 = σ; (s) ⊦ σ from 0 = σ; (s) ⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) → (# sl = # al + 1 ↔ true); (ss) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| ii(0) = 0, ii(m0 + 1) = ii(m0) + # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))), ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # (m0 = 0 ⊃ al;alf(m0 - 1)), (σ from ii(m0)) to # (m0 = 0 ⊃ sl;tl(slf(m0 - 1))) = ⌜(m0 = 0 ⊃ sl;tl(slf(m0 - 1)))⌝ , (α from ii0(m0)) to # alf(m0 - 1) = ⌜(m0 = 0 ⊃ al;alf(m0 - 1))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, m0 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ii(m0) = ii0(m0) + 1 ∨ m0 = 0 ⊦ |
ii(0) = 0, ii(m0 + 1) = ii(m0) + # tl(slf(m0 - 1)), ii(m0) = ii0(m0) + 1, ii0(m0 + 1) = ii0(m0) + # alf(m0 - 1), ii0(0) = 0, (α from ii0(m0)) to # alf(m0 - 1) = ⌜alf(m0 - 1)⌝ , (σ from ii(m0)) to # tl(slf(m0 - 1)) = ⌜tl(slf(m0 - 1))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, m0 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦
| ii(0) = 0, ii(m0 + 1) = ii(m0) + # tl(slf(m0 - 1)), ii(m0) = ii0(m0) + 1, ii0(m0 + 1) = ii0(m0) + # alf(m0 - 1), ii0(0) = 0, (α from ii0(m0)) to # alf(m0 - 1) = ⌜alf(m0 - 1)⌝ , (σ from ii(m0)) to # tl(slf(m0 - 1)) = ⌜tl(slf(m0 - 1))⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, m0 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ |
ii(m0) = ii0(m0) + 1, ii(m0 + 1) = ii(m0) + # tl(slf(m1)), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # alf(m1), m0 = m1 + 1, (σ from ii(m0)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m0)) to # alf(m1) = ⌜alf(m1)⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, m0 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: m0, m1
| ii(m0) = ii0(m0) + 1, ii(m0 + 1) = ii(m0) + # tl(slf(m1)), ii(0) = 0, ii0(0) = 0, ii0(m0 + 1) = ii0(m0) + # alf(m1), m0 = m1 + 1, (σ from ii(m0)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m0)) to # alf(m1) = ⌜alf(m1)⌝ , ii(m0 + 1) ≠ ii0(m0 + 1) + 1, m0 ≠ 0, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(m0 + 1)⌝ , ¬ # σ < ⌜ii(m0 + 1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m + 1 ≠ 0; (s)
| ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ |
slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used terms: m1
| slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦
| slf(m1).last = endstate(nf(m1 + 1)), slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ |
slf(m1).last = s, slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × s, (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m1 + 1), ασ, st
| slf(m1).last = s, slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × s, (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦
| slf(m1)[0] = endstate(nf(m1)), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ |
slf(m1)[0] = s, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × s, (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m1), ασ, st
| slf(m1)[0] = s, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × s, (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × slf(m1)[0], nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦
| ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × slf(m1)[0], nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜slf(m1)⌝ , ⌜alf(m1)⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
# ⌜slf(m1)⌝ = # ⌜alf(m1)⌝ + ⌜1⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × slf(m1)[0], (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ n. ⌜n⌝ < # ⌜alf(m1)⌝ → stepf(⌜slf(m1)⌝ [n], ⌜alf(m1)⌝ [n], ⌜slf(m1)⌝ [n +1]) ⊦
Used terms: ⌜alf(m1)⌝ , ⌜slf(m1)⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| # ⌜slf(m1)⌝ = # ⌜alf(m1)⌝ + ⌜1⌝ , ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × slf(m1)[0], (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ n. ⌜n⌝ < # ⌜alf(m1)⌝ → stepf(⌜slf(m1)⌝ [n], ⌜alf(m1)⌝ [n], ⌜slf(m1)⌝ [n +1]) ⊦ |
# alf(m1) + 1 = # slf(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × slf(m1)[0], nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # alf(m1) + 1 = # slf(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii(2 + m1) = ii(m1 + 1) + # tl(slf(m1)), ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × slf(m1)[0], nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # tl(slf(m1)) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]) ⊦ |
⊦ x ≠ [] → # tl(x) = (# x)-1
# alf(m1) + 1 = # slf(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + (# slf(m1))-1, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × slf(m1)[0], (σ from ii(m1 + 1)) to (# slf(m1))-1 = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: slf(m1)
| ⊦ x ≠ [] → # tl(x) = (# x)-1 |
| # alf(m1) + 1 = # slf(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(2 + m1) = ii(m1 + 1) + (# slf(m1))-1, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × slf(m1)[0], (σ from ii(m1 + 1)) to (# slf(m1))-1 = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
# alf(m1) + 1 = # slf(m1), # slf(m1) + ii(m1 + 1) = 1 + ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × hd(slf(m1)), nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to (# slf(m1) - 1) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic n ≤ m ⊦ (m - n) + n0 = n1 ↔ m + n0 = n + n1; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ n -1 = n - 1; (s) ⊦ x ≠ [] → x[0] = hd(x); (s)
| # alf(m1) + 1 = # slf(m1), # slf(m1) + ii(m1 + 1) = 1 + ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × hd(slf(m1)), nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to (# slf(m1) - 1) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]) ⊦ |
# slf(m1) = m0 + 1, # slf(m1) + ii(m1 + 1) = 1 + ii(2 + m1), # alf(m1) + 1 = # slf(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × hd(slf(m1)), (σ from ii(m1 + 1)) to m0 = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , # slf(m1) ≠ 0, ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # slf(m1), m0
| # slf(m1) = m0 + 1, # slf(m1) + ii(m1 + 1) = 1 + ii(2 + m1), # alf(m1) + 1 = # slf(m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × hd(slf(m1)), (σ from ii(m1 + 1)) to m0 = ⌜tl(slf(m1))⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , # slf(m1) ≠ 0, ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
# slf(m1) = # alf(m1) + 1, # alf(m1) + ii(m1 + 1) = ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × hd(slf(m1)), nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # alf(m1) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ # x = 0 ↔ x = []; (s)
| # slf(m1) = # alf(m1) + 1, # alf(m1) + ii(m1 + 1) = ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × hd(slf(m1)), nf(m1 + 1) = α0 × slf(m1).last, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # alf(m1) = ⌜tl(slf(m1))⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]) ⊦ |
# slf(m1) = # alf(m1) + 1, # alf(m1) + ii(m1 + 1) = ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × s, slf(m1) = s + sl0, (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: slf(m1), s, y
| # slf(m1) = # alf(m1) + 1, # alf(m1) + ii(m1 + 1) = ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × s, slf(m1) = s + sl0, (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], slf(m1)[n + 1]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
# slf(m1) = # alf(m1) + 1, # alf(m1) + ii(m1 + 1) = ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × s, nf(m1 + 1) = α0 × slf(m1).last, slf(m1) = s ' + sl0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), s ∈ slf(m1), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], sl0[n]) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[IOstatestream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) ⊦ a + x = a ' + x; (s)
| # slf(m1) = # alf(m1) + 1, # alf(m1) + ii(m1 + 1) = ii(2 + m1), ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × s, nf(m1 + 1) = α0 × slf(m1).last, slf(m1) = s ' + sl0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , ii(2 + m1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), s ∈ slf(m1), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜ii(2 + m1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], sl0[n]) ⊦ |
# slf(m1) = # alf(m1) + 1, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × s, slf(m1) = s ' + sl0, (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , # alf(m1) + ii(m1 + 1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), s ∈ slf(m1), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜# alf(m1) + ii(m1 + 1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], sl0[n]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦
| # slf(m1) = # alf(m1) + 1, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(0) = 0, ii(m1 + 1) = ii0(m1 + 1) + 1, ii0(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), nf(m1 + 1) = α0 × slf(m1).last, nf(m1) = α1 × s, slf(m1) = s ' + sl0, (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , # alf(m1) + ii(m1 + 1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), s ∈ slf(m1), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜# alf(m1) + ii(m1 + 1)⌝ , ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], sl0[n]), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^ ⊦ |
# slf(m1) = # alf(m1) + 1, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × s, nf(m1 + 1) = α0 × slf(m1).last, slf(m1) = s ' + sl0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , # alf(m1) + ii(m1 + 1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), s ∈ slf(m1), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜# alf(m1)⌝ + ⌜ii(m1 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], sl0[n]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| # slf(m1) = # alf(m1) + 1, ⌜alf(m1)⌝ ^ = ⌜af(m1 + m) '⌝ ^, ii(m1 + 1) = ii0(m1 + 1) + 1, ii(0) = 0, ii0(2 + m1) = ii0(m1 + 1) + # alf(m1), ii0(0) = 0, nf(m1) = α1 × s, nf(m1 + 1) = α0 × slf(m1).last, slf(m1) = s ' + sl0, (α from ii0(m1 + 1)) to # alf(m1) = ⌜alf(m1)⌝ , (σ from ii(m1 + 1)) to # alf(m1) = ⌜sl0⌝ , # alf(m1) + ii(m1 + 1) ≠ ii0(2 + m1) + 1, slf(m1) ≠ [], ext(⌜af⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), s ∈ slf(m1), ¬ # α < ⌜ii0(2 + m1)⌝ , ¬ # σ < ⌜# alf(m1)⌝ + ⌜ii(m1 + 1)⌝ , ∀ n0. frag(IOAut(startf, stepf))(⌜slf(n0)⌝ , ⌜alf(n0)⌝ ) ∧ slf(n0)[0] = endstate(nf(n0)) ∧ slf(n0).last = endstate(nf(n0 + 1)) ∧ ⌜alf(n0)⌝ ^ = ⌜af(n0 + m) '⌝ ^, ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m, n. m ≤ n → ii0(m) ≤ ii0(n), ∀ n. n < # alf(m1) → stepf(slf(m1)[n], alf(m1)[n], sl0[n]) ⊦ |
Used simplifier rules: ⊦ m + n = m + n0 ↔ n = n0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ n. ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = endstate(nf(n)) ∧ sl0.last = endstate(nf(n + 1)) ∧ ⌜al0⌝ ^ = ⌜af(n + m) '⌝ ^ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = endstate(nf(m0)) ∧ sl0.last = endstate(nf(m0 + 1)) ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = endstate(nf(m0)) ∧ sl0.last = endstate(nf(m0 + 1)) ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = endstate(nf(m0 + 1)) ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m0), ασ, st
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = endstate(nf(m0 + 1)) ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m0) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α0 × s0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m0 + 1), ασ, st
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m0) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α0 × s0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m0 + 1) = α0 × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(m0), nf(m0 + 1)) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used terms: m0
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m0 + 1) = α0 × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(m0), nf(m0 + 1)) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m0) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α0 × s0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (α × s, α0 × s0) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m0) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m0 + 1) = α0 × s0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (α × s, α0 × s0) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
⌜al⌝ ^ = ⌜af to m⌝ , nf(m0 + 1) = α0 × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, after(IOAut(startf, stepf))(actstream(α × s), endstate(α × s)), after(IOAut(startf, stepf))(actstream(α0 × s0), endstate(α0 × s0)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), finp(actstream(α × s)), finp(actstream(α0 × s0)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), actstream(α × s) ≤ ⌜af⌝ , actstream(α0 × s0) ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ a. actstream(α0 × s0) = actstream(α × s) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(α × s), ⌜a '⌝ , endstate(α0 × s0)) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used terms: α0 × s0, α × s, λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m0 + 1) = α0 × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, after(IOAut(startf, stepf))(actstream(α × s), endstate(α × s)), after(IOAut(startf, stepf))(actstream(α0 × s0), endstate(α0 × s0)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), finp(actstream(α × s)), finp(actstream(α0 × s0)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), actstream(α × s) ≤ ⌜af⌝ , actstream(α0 × s0) ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ a. actstream(α0 × s0) = actstream(α × s) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(α × s), ⌜a '⌝ , endstate(α0 × s0)) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜al0⌝ × s, nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × s0, after(IOAut(startf, stepf))(⌜al0⌝ , s), after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), startf(sl[0]), ⌜al0⌝ ≤ ⌜af⌝ , ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[actionstream] ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜al0⌝ × s, nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × s0, after(IOAut(startf, stepf))(⌜al0⌝ , s), after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), startf(sl[0]), ⌜al0⌝ ≤ ⌜af⌝ , ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
⌜al⌝ ^ = ⌜af to m⌝ , nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × s0, nf(m0) = ⌜al0⌝ × s, nf(0) = ⌜af to m⌝ × sl.last, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s0), after(IOAut(startf, stepf))(⌜al0⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s0 = sl.last ∧ α ^ = ⌜a '⌝ ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used terms: s0, ⌜a '⌝ , s, stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × s0, nf(m0) = ⌜al0⌝ × s, nf(0) = ⌜af to m⌝ × sl.last, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , s0), after(IOAut(startf, stepf))(⌜al0⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s0 = sl.last ∧ α ^ = ⌜a '⌝ ⊦ ∃ sl0, al0. frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al0⌝ ) ∧ sl0[0] = s ∧ sl0.last = s0 ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜al0⌝ ≤ ⌜af⌝ , ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ sl[0] = sl0[0] ∧ sl.last = sl0.last ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜al0⌝ ≤ ⌜af⌝ , ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ sl[0] = sl0[0] ∧ sl.last = sl0.last ∧ ⌜al0⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ) ∧ sl0[0] = sl0[0] ∧ sl0.last = sl0.last ∧ ⌜al1⌝ ^ = ⌜af(m0 + m) '⌝ ^
Used terms: sl0, al1
| ⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ) ∧ sl0[0] = sl0[0] ∧ sl0.last = sl0.last ∧ ⌜al1⌝ ^ = ⌜af(m0 + m) '⌝ ^ |
⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜al0⌝ ≤ ⌜af⌝ , ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
| ⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜al0⌝ ≤ ⌜af⌝ , ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , actstream(nf(m0)) = ⌜af to m + m0⌝ , nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: m0
| ⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , actstream(nf(m0)) = ⌜af to m + m0⌝ , nf(m0 + 1) = (⌜al0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜al0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜al0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜al0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜al0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜af to m + m0⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ actstream(ασ × st) = ασ; (s)
| ⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜af to m + m0⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , actstream(nf(m0 + 1)) = ⌜af to m + m0 + 1⌝ , nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used terms: m0 + 1
| ⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , actstream(nf(m0 + 1)) = ⌜af to m + m0 + 1⌝ , nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
(af to m + m0) + a ' = af to m + m0 + 1, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), a ∈ af to m + m0 + 1, ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[actionstream] append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) ⊦ actstream(ασ × st) = ασ; (s)
| (af to m + m0) + a ' = af to m + m0 + 1, ⌜al⌝ ^ = ⌜af to m⌝ , ⌜al1⌝ ^ = ⌜a '⌝ , nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(0) = ⌜af to m⌝ × sl.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), a ∈ af to m + m0 + 1, ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ ⊦ |
⊦ nf to m + 1 = (nf to m) + nf(m) '
(af to m + m0) + a ' = (af to m0 + m) + af(m0 + m) ', ⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), a ∈ (af to m0 + m) + af(m0 + m) ', ⌜af to m + m0⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: m0 + m, af
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| (af to m + m0) + a ' = (af to m0 + m) + af(m0 + m) ', ⌜al1⌝ ^ = ⌜a '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜a '⌝ ) × sl0.last, ⌜a '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜a '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), a ∈ (af to m0 + m) + af(m0 + m) ', ⌜af to m + m0⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜al1⌝ ^ = ⌜af(m0 + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜af(m0 + m) '⌝ ) × sl0.last, ⌜af(m0 + m) '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜af(m0 + m) '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜af to m + m0⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ + ⌜af(m0 + m) '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) c: ⊦ m + n = n + m; from specification nat-basic ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws)
| ⌜al1⌝ ^ = ⌜af(m0 + m) '⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = ⌜af to m + m0⌝ × sl0[0], nf(m0 + 1) = (⌜af to m + m0⌝ + ⌜af(m0 + m) '⌝ ) × sl0.last, ⌜af(m0 + m) '⌝ ≠ ⌜af(m0 + m) '⌝ ^, after(IOAut(startf, stepf))(⌜af to m + m0⌝ , sl0[0]), after(IOAut(startf, stepf))(⌜af to m + m0⌝ + ⌜af(m0 + m) '⌝ , sl0.last), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), startf(sl[0]), ⌜af to m + m0⌝ ≤ ⌜af⌝ , ⌜af to m + m0⌝ + ⌜af(m0 + m) '⌝ ≤ ⌜af⌝ , ∀ n. actstream(nf(n)) = ⌜af to m + n⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
Used simplifier rules: ⊦ ⌜al⌝ ^ ≠ ⌜τ '⌝ ; (s) Used terms: af(m0 + m)
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∀ n. actstream(nf(n)) = ⌜af⌝ to m + n |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, actstream(nf(m0)) ≠ ⌜af to m + m0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, actstream(nf(m0)) ≠ ⌜af to m + m0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, α ≠ ⌜af to m + m0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m0), ασ, st
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m0) = α × s, α ≠ ⌜af to m + m0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m0) = α × s, nf(0) = ⌜af to m⌝ × sl.last, α ≠ ⌜af to m + m0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m0) = α × s, nf(0) = ⌜af to m⌝ × sl.last, α ≠ ⌜af to m + m0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m1 +1) = α × s, α ≠ ⌜af to m + m1 +1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al, af, m, nf, α, s, sl, startf, stepf. ¬ ( ⌜al⌝ ^ = ⌜af to m⌝ ∧ nf(m1) = α × s ∧ nf(0) = ⌜af to m⌝ × sl.last ∧ α ≠ ⌜af to m + m1⌝ ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) ∧ (∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1))) ∧ (∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))))) ⊦
Used simplifier rules: nat freely generated by 0, +1;; ⊦ n + 0 = n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws)
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m1 +1) = α × s, α ≠ ⌜af to m + m1 +1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ al, af, m, nf, α, s, sl, startf, stepf. ¬ ( ⌜al⌝ ^ = ⌜af to m⌝ ∧ nf(m1) = α × s ∧ nf(0) = ⌜af to m⌝ × sl.last ∧ α ≠ ⌜af to m + m1⌝ ∧ ext(⌜af⌝ ) ∧ fin(IOAut(startf, stepf)) ∧ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ (∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) ∧ (∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1))) ∧ (∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ al0, af0, m0, nf0, α0, s0, sl0, startf0, stepf0. ⌜al0⌝ ^ ≠ ⌜af0 to m0⌝ ∨ nf0(m1) ≠ α0 × s0 ∨ nf0(0) ≠ ⌜af0 to m0⌝ × sl0.last ∨ α0 = ⌜af0 to m0 + m1⌝ ∨ ¬ ext(⌜af0⌝ ) ∨ ¬ fin(IOAut(startf0, stepf0)) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl0⌝ , ⌜al0⌝ ) ∨ ¬ startf0(sl0[0]) ∨ ¬(∀ α2. finp(α2) ∧ α2 ≤ ⌜af0⌝ → trace(IOAut(startf0, stepf0))(α2)) ∨ ¬ (∀ n. edge ( (λ αs. after(IOAut(startf0, stepf0))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af0⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf0, stepf0))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf0(n), nf0(n + 1))) ∨ ¬(∀ n. after(IOAut(startf0, stepf0))(actstream(nf0(n)), endstate(nf0(n))) ∧ actstream(nf0(n)) ≤ ⌜af0⌝ ∧ finp(actstream(nf0(n)))) ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m +1 = m + 1; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ al0, af0, m0, nf0, α0, s0, sl0, startf0, stepf0. ⌜al0⌝ ^ ≠ ⌜af0 to m0⌝ ∨ nf0(m1) ≠ α0 × s0 ∨ nf0(0) ≠ ⌜af0 to m0⌝ × sl0.last ∨ α0 = ⌜af0 to m0 + m1⌝ ∨ ¬ ext(⌜af0⌝ ) ∨ ¬ fin(IOAut(startf0, stepf0)) ∨ ¬ frag(IOAut(startf0, stepf0))(⌜sl0⌝ , ⌜al0⌝ ) ∨ ¬ startf0(sl0[0]) ∨ ¬(∀ α2. finp(α2) ∧ α2 ≤ ⌜af0⌝ → trace(IOAut(startf0, stepf0))(α2)) ∨ ¬ (∀ n. edge ( (λ αs. after(IOAut(startf0, stepf0))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af0⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf0, stepf0))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf0(n), nf0(n + 1))) ∨ ¬(∀ n. after(IOAut(startf0, stepf0))(actstream(nf0(n)), endstate(nf0(n))) ∧ actstream(nf0(n)) ≤ ⌜af0⌝ ∧ finp(actstream(nf0(n)))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜al⌝ ^ ≠ ⌜af to m⌝ ∨ nf(m1) ≠ actstream(nf(m1)) × endstate(nf(m1)) ∨ nf(0) ≠ ⌜af to m⌝ × sl.last ∨ actstream(nf(m1)) = ⌜af to m + m1⌝ ∨ ¬ ext(⌜af⌝ ) ∨ ¬ fin(IOAut(startf, stepf)) ∨ ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ startf(sl[0]) ∨ ¬(∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) ∨ ¬ (∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1))) ∨ ¬(∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n)))) ⊦
Used terms: al, af, m, nf, actstream(nf(m1)), endstate(nf(m1)), sl, startf, stepf
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ⌜al⌝ ^ ≠ ⌜af to m⌝ ∨ nf(m1) ≠ actstream(nf(m1)) × endstate(nf(m1)) ∨ nf(0) ≠ ⌜af to m⌝ × sl.last ∨ actstream(nf(m1)) = ⌜af to m + m1⌝ ∨ ¬ ext(⌜af⌝ ) ∨ ¬ fin(IOAut(startf, stepf)) ∨ ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∨ ¬ startf(sl[0]) ∨ ¬(∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2)) ∨ ¬ (∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1))) ∨ ¬(∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n)))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), nf(m1) ≠ actstream(nf(m1)) × endstate(nf(m1)) ∨ actstream(nf(m1)) = ⌜af to m + m1⌝ ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), nf(m1) ≠ actstream(nf(m1)) × endstate(nf(m1)) ∨ actstream(nf(m1)) = ⌜af to m + m1⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = α0 × s0, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), nf(m1) ≠ α0 × s0 ∨ α0 = ⌜af to m + m1⌝ ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(m1), ασ, st
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = α0 × s0, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), nf(m1) ≠ α0 × s0 ∨ α0 = ⌜af to m + m1⌝ ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(m1), nf(m1 + 1)) ⊦
Used terms: m1
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(m1), nf(m1 + 1)) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜af to m + m1⌝ × s0, α × s) ⊦
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = α × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, α ≠ ⌜af to m + m1 + 1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (⌜af to m + m1⌝ × s0, α × s) ⊦ |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , after(IOAut(startf, stepf))(actstream(⌜af to m + m1⌝ × s0), endstate(⌜af to m + m1⌝ × s0)), after(IOAut(startf, stepf))(actstream(α × s), endstate(α × s)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), finp(actstream(⌜af to m + m1⌝ × s0)), finp(actstream(α × s)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), actstream(⌜af to m + m1⌝ × s0) ≤ ⌜af⌝ , actstream(α × s) ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∃ a. actstream(α × s) = actstream(⌜af to m + m1⌝ × s0) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(⌜af to m + m1⌝ × s0), ⌜a '⌝ , endstate(α × s)) ⊦
Used terms: α × s, ⌜af to m + m1⌝ × s0, λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = α × s, α ≠ ⌜af to m + m1 + 1⌝ , after(IOAut(startf, stepf))(actstream(⌜af to m + m1⌝ × s0), endstate(⌜af to m + m1⌝ × s0)), after(IOAut(startf, stepf))(actstream(α × s), endstate(α × s)), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), finp(actstream(⌜af to m + m1⌝ × s0)), finp(actstream(α × s)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), actstream(⌜af to m + m1⌝ × s0) ≤ ⌜af⌝ , actstream(α × s) ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∃ a. actstream(α × s) = actstream(⌜af to m + m1⌝ × s0) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(⌜af to m + m1⌝ × s0), ⌜a '⌝ , endstate(α × s)) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, (af to m + m1) + a ' ≠ af to m + m1 + 1, after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[actionstream] append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ finp(⌜x⌝ + σ) ↔ finp(σ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s) ⊦ finp(⌜nf to n⌝ ); (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, (af to m + m1) + a ' ≠ af to m + m1 + 1, after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ nf to m + 1 = (nf to m) + nf(m) '
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, (af to m + m1) + a ' ≠ (af to m + m1) + af(m + m1) ', after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ⌜af to m + m1⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: m + m1, af
| ⊦ nf to m + 1 = (nf to m) + nf(m) ' |
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, (af to m + m1) + a ' ≠ (af to m + m1) + af(m + m1) ', after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ⌜af to m + m1⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + y = x + z ↔ y = z; (s)
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)
⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∃ α. (⌜af to m + m1⌝ + ⌜a '⌝ ) + α = ⌜af⌝ ⊦
Used terms: ⌜af⌝ , ⌜af to m + m1⌝ + ⌜a '⌝
| ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2) |
| ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∃ α. (⌜af to m + m1⌝ + ⌜a '⌝ ) + α = ⌜af⌝ ⊦ |
(⌜af to m + m1⌝ + ⌜a '⌝ ) + α = ⌜af⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
| (⌜af to m + m1⌝ + ⌜a '⌝ ) + α = ⌜af⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#((⌜af to m + m1⌝ + ⌜a '⌝ ) + α) = # ⌜af⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. ⌜n⌝ < #((⌜af to m + m1⌝ + ⌜a '⌝ ) + α) → ((⌜af to m + m1⌝ + ⌜a '⌝ ) + α)[n] = ⌜af⌝ [n] ⊦
Used terms: ⌜af⌝ , (⌜af to m + m1⌝ + ⌜a '⌝ ) + α
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #((⌜af to m + m1⌝ + ⌜a '⌝ ) + α) = # ⌜af⌝ , ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. ⌜n⌝ < #((⌜af to m + m1⌝ + ⌜a '⌝ ) + α) → ((⌜af to m + m1⌝ + ⌜a '⌝ ) + α)[n] = ⌜af⌝ [n] ⊦ |
# α = ∞, ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. ((⌜af to m + m1⌝ + ⌜a '⌝ ) + α)[n] = af(n) ⊦
Used simplifier rules: ⊦ ¬ ∞ < n∞; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| # α = ∞, ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. ((⌜af to m + m1⌝ + ⌜a '⌝ ) + α)[n] = af(n) ⊦ |
# α = ∞, ((⌜af to m + m1⌝ + ⌜a '⌝ ) + α)[m + m1] = af(m + m1), ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used terms: m + m1
| # α = ∞, ((⌜af to m + m1⌝ + ⌜a '⌝ ) + α)[m + m1] = af(m + m1), ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
# α = ∞, (⌜af to m + m1⌝ + ⌜a '⌝ )[m + m1] = af(m + m1), ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), ⌜m + m1⌝ < #(⌜af to m + m1⌝ + ⌜a '⌝ ), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
Used simplifier rules: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ ⌜n⌝ ≠ ∞; (s) n∞ ≠ ∞ ⊦ (⌜m⌝ + n∞).n = m + n∞.n; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ m + n - n + n1 = m - n1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜n⌝ + n∞1 < ⌜n⌝ + n∞2 ↔ n∞1 < n∞2; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf Used terms: m + m1, α, ⌜af to m + m1⌝ + ⌜a '⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| # α = ∞, (⌜af to m + m1⌝ + ⌜a '⌝ )[m + m1] = af(m + m1), ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1) = ⌜af to m + m1⌝ × s0, nf(0) = ⌜af to m⌝ × sl.last, nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, a ≠ af(m + m1), ⌜m + m1⌝ < #(⌜af to m + m1⌝ + ⌜a '⌝ ), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
# α = ∞, ((af to m + m1) + a ')[m + m1] = af(m + m1), ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ¬ n < n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜n⌝ + n∞1 < ⌜n⌝ + n∞2 ↔ n∞1 < n∞2; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s)
| # α = ∞, ((af to m + m1) + a ')[m + m1] = af(m + m1), ⌜al⌝ ^ = ⌜af to m⌝ , nf(m1 + 1) = (⌜af to m + m1⌝ + ⌜a '⌝ ) × s, nf(0) = ⌜af to m⌝ × sl.last, nf(m1) = ⌜af to m + m1⌝ × s0, a ≠ af(m + m1), after(IOAut(startf, stepf))(⌜af to m + m1⌝ + ⌜a '⌝ , s), after(IOAut(startf, stepf))(⌜af to m + m1⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), move(IOAut(startf, stepf))(s0, ⌜a '⌝ , s), startf(sl[0]), ⌜af to m + m1⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ ¬ n < # x → (x + y)[n] = y[n - # x]
Used simplifier rules: ⊦ #(nf to n) = n; (s) ⊦ m + n - n + n1 = m - n1; (s) ⊦ m - m = 0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ a '[0] = a; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ¬ n < n; (s) Used terms: m + m1, a ', af to m + m1
| ⊦ ¬ n < # x → (x + y)[n] = y[n - # x] |
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al, m. exec(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ ⌜al⌝ ^ = ⌜af⌝ to m ∧ actstream(nf(0)) = ⌜al⌝ ^ ∧ endstate(nf(0)) = sl.last |
ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ actstream(nf(0)) = ⌜al⌝ ^ ∧ endstate(nf(0)) = sl.last
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ actstream(nf(0)) = ⌜al⌝ ^ ∧ endstate(nf(0)) = sl.last |
nf(0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(0), ασ, st
| nf(0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(n), nf(n + 1)), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last |
nf(0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(0), nf(0 + 1)) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last
Used terms: 0
| nf(0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (nf(0), nf(0 + 1)) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last |
nf(0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (α × s, nf(1)) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic
| nf(0) = α × s, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), edge ( (λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))) × (λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)))) (α × s, nf(1)) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last |
⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b)
nf(0) = α × s, after(IOAut(startf, stepf))(actstream(α × s), endstate(α × s)), after(IOAut(startf, stepf))(actstream(nf(1)), endstate(nf(1))), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), finp(actstream(α × s)), finp(actstream(nf(1))), actstream(α × s) ≤ ⌜af⌝ , actstream(nf(1)) ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∃ a. actstream(nf(1)) = actstream(α × s) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(α × s), ⌜a '⌝ , endstate(nf(1))) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last
Used terms: nf(1), α × s, λ αs1, αs2. ∃ a. actstream(αs2) = actstream(αs1) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(αs1), ⌜a '⌝ , endstate(αs2)), λ αs. after(IOAut(startf, stepf))(actstream(αs), endstate(αs)) ∧ actstream(αs) ≤ ⌜af⌝ ∧ finp(actstream(αs))
| ⊦ edge(vs × es)(a, b) ↔ es(a, b) ∧ vs(a) ∧ vs(b) |
| nf(0) = α × s, after(IOAut(startf, stepf))(actstream(α × s), endstate(α × s)), after(IOAut(startf, stepf))(actstream(nf(1)), endstate(nf(1))), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), finp(actstream(α × s)), finp(actstream(nf(1))), actstream(α × s) ≤ ⌜af⌝ , actstream(nf(1)) ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∃ a. actstream(nf(1)) = actstream(α × s) + ⌜a '⌝ ∧ move(IOAut(startf, stepf))(endstate(α × s), ⌜a '⌝ , endstate(nf(1))) ⊦ ∃ sl, al, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ startf(sl[0]) ∧ ⌜al⌝ ^ = ⌜af to m⌝ ∧ α = ⌜al⌝ ^ ∧ s = sl.last |
⌜al⌝ + ⌜a '⌝ = actstream(nf(1)), nf(0) = ⌜al⌝ × s, after(IOAut(startf, stepf))(⌜al⌝ , s), after(IOAut(startf, stepf))(actstream(nf(1)), endstate(nf(1))), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , endstate(nf(1))), ⌜al⌝ ≤ ⌜af⌝ , actstream(nf(1)) ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[actionstream] ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ endstate(ασ × st) = st; (s) ⊦ actstream(ασ × st) = ασ; (s)
| ⌜al⌝ + ⌜a '⌝ = actstream(nf(1)), nf(0) = ⌜al⌝ × s, after(IOAut(startf, stepf))(⌜al⌝ , s), after(IOAut(startf, stepf))(actstream(nf(1)), endstate(nf(1))), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , endstate(nf(1))), ⌜al⌝ ≤ ⌜af⌝ , actstream(nf(1)) ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last |
⌜al⌝ + ⌜a '⌝ = α, nf(0) = ⌜al⌝ × s, nf(1) = α × s0, after(IOAut(startf, stepf))(α, s0), after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), α ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: nf(1), ασ, st
| ⌜al⌝ + ⌜a '⌝ = α, nf(0) = ⌜al⌝ × s, nf(1) = α × s0, after(IOAut(startf, stepf))(α, s0), after(IOAut(startf, stepf))(⌜al⌝ , s), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), α ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last |
nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, nf(0) = ⌜al⌝ × s, after(IOAut(startf, stepf))(⌜al⌝ , s), after(IOAut(startf, stepf))(⌜al⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), ⌜al⌝ ≤ ⌜af⌝ , ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last
| nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, nf(0) = ⌜al⌝ × s, after(IOAut(startf, stepf))(⌜al⌝ , s), after(IOAut(startf, stepf))(⌜al⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), ⌜al⌝ ≤ ⌜af⌝ , ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
nf(0) = ⌜al⌝ × s, nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, after(IOAut(startf, stepf))(⌜al⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α, σ. α ^ = ⌜al⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last
Used terms: s, ⌜al⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| nf(0) = ⌜al⌝ × s, nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, after(IOAut(startf, stepf))(⌜al⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), move(IOAut(startf, stepf))(s, ⌜a '⌝ , s0), ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α, σ. α ^ = ⌜al⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ s = sl.last |
⌜al0⌝ ^ = ⌜al⌝ , nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, nf(0) = ⌜al⌝ × σ.l.last, after(IOAut(startf, stepf))(⌜al⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s0), startf(σ[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, nf(0) = ⌜al⌝ × σ.l.last, after(IOAut(startf, stepf))(⌜al⌝ + ⌜a '⌝ , s0), ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s0), startf(σ[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
⌜al0⌝ ^ = ⌜al⌝ , nf(0) = ⌜al⌝ × σ.l.last, nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s0), startf(σ[0]), ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α, σ. α ^ = ⌜al⌝ + ⌜a '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s0 = σ.l.last ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last
Used terms: s0, ⌜al⌝ + ⌜a '⌝ , stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| ⌜al0⌝ ^ = ⌜al⌝ , nf(0) = ⌜al⌝ × σ.l.last, nf(1) = (⌜al⌝ + ⌜a '⌝ ) × s0, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , s0), startf(σ[0]), ⌜al⌝ + ⌜a '⌝ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α, σ. α ^ = ⌜al⌝ + ⌜a '⌝ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s0 = σ.l.last ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last |
⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × σ0.l.last, nf(0) = ⌜al⌝ × σ.l.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), frag(IOAut(startf, stepf))(σ0, ⌜al1⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , σ0.l.last), startf(σ[0]), startf(σ0[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × σ0.l.last, nf(0) = ⌜al⌝ × σ.l.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), frag(IOAut(startf, stepf))(σ0, ⌜al1⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , σ0.l.last), startf(σ[0]), startf(σ0[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last |
⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × σ.l.last, nf(1) = ⌜al1⌝ ^ × σ0.l.last, σ0 = ⌜sl0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ0, ⌜al1⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , σ0.l.last), startf(σ0[0]), startf(σ[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × σ.l.last, nf(1) = ⌜al1⌝ ^ × σ0.l.last, σ0 = ⌜sl0⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ0, ⌜al1⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , σ0.l.last), startf(σ0[0]), startf(σ[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last |
⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(0) = ⌜al⌝ × σ.l.last, nf(1) = ⌜al1⌝ ^ × sl0.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , sl0.last), startf(σ[0]), startf(sl0[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(0) = ⌜al⌝ × σ.l.last, nf(1) = ⌜al1⌝ ^ × sl0.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , sl0.last), startf(σ[0]), startf(sl0[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last |
⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × σ.l.last, σ = ⌜sl1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(σ[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s)
| ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × σ.l.last, σ = ⌜sl1⌝ , ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(σ, ⌜al0⌝ ), move(IOAut(startf, stepf))(σ.l.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(σ[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ⌜al⌝ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ ∃ sl, al0, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al0⌝ ) ∧ startf(sl[0]) ∧ ⌜al0⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ σ.l.last = sl.last |
⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al2, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al2⌝ ) ∧ startf(sl[0]) ∧ ⌜al2⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al2⌝ ^ ∧ sl1.last = sl.last
Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜x⌝ [n] = x[n]; (s)
| ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al⌝ ≤ ⌜af⌝ , ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al2, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al2⌝ ) ∧ startf(sl[0]) ∧ ⌜al2⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al2⌝ ^ ∧ sl1.last = sl.last |
⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)
⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α. ⌜al⌝ + α = ⌜af⌝ ⊦ ∃ sl, al2, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al2⌝ ) ∧ startf(sl[0]) ∧ ⌜al2⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al2⌝ ^ ∧ sl1.last = sl.last
Used terms: ⌜af⌝ , ⌜al⌝
| ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2) |
| ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∃ α. ⌜al⌝ + α = ⌜af⌝ ⊦ ∃ sl, al2, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al2⌝ ) ∧ startf(sl[0]) ∧ ⌜al2⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al2⌝ ^ ∧ sl1.last = sl.last |
⌜al⌝ + α = ⌜af⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al2, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al2⌝ ) ∧ startf(sl[0]) ∧ ⌜al2⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al2⌝ ^ ∧ sl1.last = sl.last
| ⌜al⌝ + α = ⌜af⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ ∃ sl, al2, m. frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al2⌝ ) ∧ startf(sl[0]) ∧ ⌜al2⌝ ^ = ⌜af to m⌝ ∧ ⌜al⌝ = ⌜al2⌝ ^ ∧ sl1.last = sl.last |
⌜al⌝ + α = ⌜af⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ) ∧ startf(sl1[0]) ∧ ⌜al0⌝ ^ = ⌜af to (# ⌜al0⌝ ^).n⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ sl1.last = sl1.last
Used terms: sl1, al0, (# ⌜al0⌝ ^).n
| ⌜al⌝ + α = ⌜af⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ) ∧ startf(sl1[0]) ∧ ⌜al0⌝ ^ = ⌜af to (# ⌜al0⌝ ^).n⌝ ∧ ⌜al⌝ = ⌜al0⌝ ^ ∧ sl1.last = sl1.last |
⌜al⌝ + α = ⌜af⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| ⌜al⌝ + α = ⌜af⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⌜al⌝ + α = ⌜af⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, α = ⌜af0⌝ , al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ σ0 + ⌜x⌝ = ⌜nf0⌝ ↔ σ0 = ⌜nf0⌝ ; (s) ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| ⌜al⌝ + α = ⌜af⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, α = ⌜af0⌝ , al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))) ⊦ |
⌜al⌝ + ⌜af0⌝ = ⌜af⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦
| ⌜al⌝ + ⌜af0⌝ = ⌜af⌝ , ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n)
#(⌜al⌝ + ⌜af0⌝ ) = # ⌜af⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. ¬ #(⌜al⌝ + ⌜af0⌝ ) < ⌜n⌝ → ⌜al⌝ + ⌜af0⌝ to n = ⌜af⌝ to n ⊦
Used terms: ⌜af⌝ , ⌜al⌝ + ⌜af0⌝
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n) |
| #(⌜al⌝ + ⌜af0⌝ ) = # ⌜af⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , ⌜al0⌝ ^ = ⌜al⌝ , nf(1) = ⌜al1⌝ ^ × sl0.last, nf(0) = ⌜al⌝ × sl1.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl1[0]), startf(sl0[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ n. ¬ #(⌜al⌝ + ⌜af0⌝ ) < ⌜n⌝ → ⌜al⌝ + ⌜af0⌝ to n = ⌜af⌝ to n ⊦ |
⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜al⌝ + ⌜af0⌝ to n = ⌜af to n⌝ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ¬ ∞ < n∞; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜m⌝ + ∞ = ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| ⌜al0⌝ ^ = ⌜al⌝ , ⌜al1⌝ ^ = ⌜al⌝ + ⌜a '⌝ , nf(0) = ⌜al⌝ × sl1.last, nf(1) = ⌜al1⌝ ^ × sl0.last, al ≠ af to # al, ext(⌜af⌝ ), fin(IOAut(startf, stepf)), frag(IOAut(startf, stepf))(⌜sl0⌝ , ⌜al1⌝ ), frag(IOAut(startf, stepf))(⌜sl1⌝ , ⌜al0⌝ ), move(IOAut(startf, stepf))(sl1.last, ⌜a '⌝ , sl0.last), startf(sl0[0]), startf(sl1[0]), ⌜al1⌝ ^ ≤ ⌜af⌝ , ∀ n. after(IOAut(startf, stepf))(actstream(nf(n)), endstate(nf(n))) ∧ actstream(nf(n)) ≤ ⌜af⌝ ∧ finp(actstream(nf(n))), ∀ σ, β. ⌜af⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]), ∀ α2. finp(α2) ∧ α2 ≤ ⌜af⌝ → trace(IOAut(startf, stepf))(α2), ∀ n. ⌜al⌝ + ⌜af0⌝ to n = ⌜af to n⌝ ⊦ |
Used simplifier rules: ⊦ ⌜x⌝ + σ to # x = ⌜x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) Used terms: # al
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.