| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl0 ∧ frag*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) ↔ s ∈ sl |
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl0 ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl
Used simplifier rules: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl0 ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl |
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ [] ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1) ⊦ ∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ state + sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1
Used simplifier rules: statelist freely generated by [], +;;
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ [] ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl |
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. ¬ s ∈ sl
Used simplifier rules: ⊦ ¬ a ∈ []; (s)
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. ¬ s ∈ sl |
Used simplifier rules: ⊦ ¬ a ∈ []; (s) Used terms: []
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1) ⊦ ∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ state + sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1 |
∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s)
| ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1 |
∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∃ sl. ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1
Used terms: state, β
| ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∃ sl. ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1 |
∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1
| ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1 |
(∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0 ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1
Used terms: startf, stepf, β
| (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0 ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1 |
∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1 ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1
| ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1 ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1 |
∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0 ⊦ ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl0 + sl1
Used terms: sl0 + sl1
| ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0 ⊦ ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl0 + sl1 |
∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1 ⊦ (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl0 ∨ state0 ∈ sl1
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1 ⊦ (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl0 ∨ state0 ∈ sl1 |
¬ state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last ⊦
∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
| ¬ state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last ⊦ |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ s = σ.l.last) ↔ s ∈ sl1, σ[0] = state ∨ σ[0] ∈ sl ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ s = σ.l.last) ↔ s ∈ sl1, σ[0] = state ∨ σ[0] ∈ sl ⊦ |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, (∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ σ0[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last) ↔ σ.l.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, σ[0] = state ∨ σ[0] ∈ sl ⊦
Used terms: σ.l.last
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, (∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ σ0[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last) ↔ σ.l.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, σ[0] = state ∨ σ[0] ∈ sl ⊦ |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, σ[0] = state ∨ σ[0] ∈ sl ⊦ ∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ σ0[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, σ[0] = state ∨ σ[0] ∈ sl ⊦ ∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ σ0[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, σ[0] = state ∨ σ[0] ∈ sl ⊦ ⌜al⌝ ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, ⌜al⌝ ) ∧ finp(⌜al⌝ ) ∧ σ.l.last = σ.l.last
Used terms: ⌜al⌝ , σ
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, σ[0] = state ∨ σ[0] ∈ sl ⊦ ⌜al⌝ ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, ⌜al⌝ ) ∧ finp(⌜al⌝ ) ∧ σ.l.last = σ.l.last |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, s2) ↔ s2 ∈ sl0 ⊦
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, s2) ↔ s2 ∈ sl0 ⊦ |
move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, σ.l.last) ↔ σ.l.last ∈ sl0, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦
Used terms: σ.l.last
| move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, σ.l.last) ↔ σ.l.last ∈ sl0, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, σ.l.last), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, σ.l.last), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ σ[0] = sl[0] ∧ σ.l.last = sl.last ∧ α ^ = ⌜al⌝ ^) ⊦
Used terms: σ.l.last, ⌜al⌝ ^, σ[0], stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ σ[0] = sl[0] ∧ σ.l.last = sl.last ∧ α ^ = ⌜al⌝ ^) ⊦ |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ frag*(IOAut(startf, stepf))(⌜σ.l⌝ , ⌜al⌝ ) ∧ σ[0] = σ.l[0] ∧ σ.l.last = σ.l.last ∧ ⌜al⌝ ^ = ⌜al⌝ ^
Used terms: ⌜al⌝ , σ.l
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ frag*(IOAut(startf, stepf))(⌜σ.l⌝ , ⌜al⌝ ) ∧ σ[0] = σ.l[0] ∧ σ.l.last = σ.l.last ∧ ⌜al⌝ ^ = ⌜al⌝ ^ |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ frag(IOAut(startf, stepf))(⌜σ.l⌝ , ⌜al⌝ ) ∧ σ[0] = σ.l[0]
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ frag(IOAut(startf, stepf))(⌜σ.l⌝ , ⌜al⌝ ) ∧ σ[0] = σ.l[0] |
Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ .l = x; (s)
| ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
(∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
Used terms: state0
| (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
| ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
| state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
move(IOAut(startf, stepf))(state, β, state0) ↔ state0 ∈ sl0, state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
Used terms: state0
| move(IOAut(startf, stepf))(state, β, state0) ↔ state0 ∈ sl0, state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
move(IOAut(startf, stepf))(state, β, state0), state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
| move(IOAut(startf, stepf))(state, β, state0), state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ state = sl[0] ∧ state0 = sl.last ∧ α ^ = β ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last
Used terms: state0, β, state, stepf, startf
| ⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β) |
| state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ state = sl[0] ∧ state0 = sl.last ∧ α ^ = β ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al⌝ ), sl2.last ∈ sl0, ¬ sl2.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ sl2.last = σ.l.last, ∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ (σ[0] = sl2[0] ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ sl2.last = σ.l.last
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)
| frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al⌝ ), sl2.last ∈ sl0, ¬ sl2.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ sl2.last = σ.l.last, ∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ (σ[0] = sl2[0] ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ sl2.last = σ.l.last |
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al⌝ , ⌜sl2⌝
| state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last |
frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), σ[0] ∈ sl, σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ (σ0[0] = state ∨ σ0[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]
| frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), σ[0] ∈ sl, σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ (σ0[0] = state ∨ σ0[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last |
Used simplifier rules: ⊦ finp(⌜x⌝ ); (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.