| ⊦ forest(IOAut(startf, stepf)) → (∀ s. ∃ β. after(IOAut(startf, stepf))(β, s)) |
forest(IOAut(startf, stepf)) ⊦ ∀ s. ∃ β. after(IOAut(startf, stepf))(β, s)
| forest(IOAut(startf, stepf)) ⊦ ∀ s. ∃ β. after(IOAut(startf, stepf))(β, s) |
forest(IOAut(startf, stepf)) ⊦ ∃ β. after(IOAut(startf, stepf))(β, s)
| forest(IOAut(startf, stepf)) ⊦ ∃ β. after(IOAut(startf, stepf))(β, s) |
⊦ forest(IOAut(startf, stepf)) ↔ (∀ s2. (∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2))
∀ s2. (∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ β. after(IOAut(startf, stepf))(β, s)
Used terms: stepf, startf
| ⊦ forest(IOAut(startf, stepf)) ↔ (∀ s2. (∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2)) |
| ∀ s2. (∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2) ⊦ ∃ β. after(IOAut(startf, stepf))(β, s) |
∀ α1, sl1, α2, sl2. exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s = sl1.last ∧ s = sl2.last → α1 = α2 ∧ sl1 = sl2, ∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl.last ⊦ ∃ β. after(IOAut(startf, stepf))(β, s)
Used terms: s
| ∀ α1, sl1, α2, sl2. exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s = sl1.last ∧ s = sl2.last → α1 = α2 ∧ sl1 = sl2, ∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl.last ⊦ ∃ β. after(IOAut(startf, stepf))(β, s) |
frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ β. after(IOAut(startf, stepf))(β, sl.last)
Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ exec*(IOAut(startf, stepf))(σ, β) ↔ exec(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ ∃ β. after(IOAut(startf, stepf))(β, sl.last) |
frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ after(IOAut(startf, stepf))(⌜al⌝ ^, sl.last), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦
Used terms: ⌜al⌝ ^
| frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ¬ after(IOAut(startf, stepf))(⌜al⌝ ^, sl.last), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2 ⊦ |
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ α, σ. ¬(α ^ = ⌜al⌝ ^ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl.last = σ.l.last) ⊦
Used terms: sl.last, ⌜al⌝ ^, stepf, startf
| ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) |
| frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ α, σ. ¬(α ^ = ⌜al⌝ ^ ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ sl.last = σ.l.last) ⊦ |
frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ α, σ. α ^ ≠ ⌜al⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sl.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)
| frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), startf(sl[0]), ∀ α1, sl1, α2, sl2. frag(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ startf(sl1[0]) ∧ finp(α1) ∧ frag(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ startf(sl2[0]) ∧ finp(α2) ∧ sl.last = sl1.last ∧ sl.last = sl2.last → α1 = α2 ∧ sl1 = sl2, ∀ α, σ. α ^ ≠ ⌜al⌝ ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, α) ∨ ¬ startf(σ[0]) ∨ ¬ finp(α) ∨ sl.last ≠ σ.l.last ⊦ |
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al⌝ , ⌜sl⌝
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.