| ⊦ fwsim(infguess(IOAut(startf, stepf)), IOAut(startf, stepf), λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s) |
¬ fwsim(infguess(IOAut(startf, stepf)), IOAut(startf, stepf), λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s) ⊦
| ¬ fwsim(infguess(IOAut(startf, stepf)), IOAut(startf, stepf), λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s) ⊦ |
⊦ infguess(IOAut(startf, stepf)) = EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))
¬ fwsim (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf), λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s) ⊦
Used terms: stepf, startf
| ⊦ infguess(IOAut(startf, stepf)) = EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)) |
| ¬ fwsim (EXIOAut (λ σα. exec(IOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf), λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s) ⊦ |
¬ fwsim (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf), λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s) ⊦
Used simplifier rules: ⊦ (σ × α).1 = σ; (s) ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| ¬ fwsim (EXIOAut (λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), IOAut(startf, stepf), λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s) ⊦ |
⊦ fwsim(EXIOAut(cstartf, cstepf), IOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. move(IOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0)))
(∃ cs. ¬(frag(IOAut(startf, stepf))(cs.1, cs.2) ∧ startf(cs.1[0]) → (∃ as. (cs.1 ≠ [] ∧ hd(cs.1) = as) ∧ startf(as)))) ∨ (∃ cs, a, cs0, as. ¬ ( (cs.1 ≠ [] ∧ hd(cs.1) = as) ∧ cs.1 ≠ [] ∧ cs.2 ≠ [] ∧ tl(cs.1) ≠ [] ∧ stepf(hd(cs.1), hd(cs.2), hd(tl(cs.1))) ∧ hd(cs.2) = a ∧ cs0 = tl(cs.1) × tl(cs.2) → (∃ as0. move(IOAut(startf, stepf))(as, ⌜a '⌝ ^, as0) ∧ cs0.1 ≠ [] ∧ hd(cs0.1) = as0))) ⊦
Used terms: λ s, σα. σα.1 ≠ [] ∧ hd(σα.1) = s, stepf, startf, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ stepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. frag(IOAut(startf, stepf))(σα.1, σα.2) ∧ startf(σα.1[0])
| ⊦ fwsim(EXIOAut(cstartf, cstepf), IOAut(astartf, astepf), r) ↔ (∀ cs. cstartf(cs) → (∃ as. r(as, cs) ∧ astartf(as))) ∧ (∀ cs, a, cs0, as. r(as, cs) ∧ cstepf(cs, a, cs0) → (∃ as0. move(IOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ r(as0, cs0))) |
| (∃ cs. ¬(frag(IOAut(startf, stepf))(cs.1, cs.2) ∧ startf(cs.1[0]) → (∃ as. (cs.1 ≠ [] ∧ hd(cs.1) = as) ∧ startf(as)))) ∨ (∃ cs, a, cs0, as. ¬ ( (cs.1 ≠ [] ∧ hd(cs.1) = as) ∧ cs.1 ≠ [] ∧ cs.2 ≠ [] ∧ tl(cs.1) ≠ [] ∧ stepf(hd(cs.1), hd(cs.2), hd(tl(cs.1))) ∧ hd(cs.2) = a ∧ cs0 = tl(cs.1) × tl(cs.2) → (∃ as0. move(IOAut(startf, stepf))(as, ⌜a '⌝ ^, as0) ∧ cs0.1 ≠ [] ∧ hd(cs0.1) = as0))) ⊦ |
¬(frag(IOAut(startf, stepf))(cs.1, cs.2) ∧ startf(cs.1[0]) → cs.1 ≠ [] ∧ startf(hd(cs.1))) ∨ ¬ ( hd(cs0.1) = s ∧ cs0.1 ≠ [] ∧ cs0.2 ≠ [] ∧ tl(cs0.1) ≠ [] ∧ stepf(hd(cs0.1), hd(cs0.2), hd(tl(cs0.1))) ∧ hd(cs0.2) = a ∧ cs1 = tl(cs0.1) × tl(cs0.2) → move(IOAut(startf, stepf))(hd(cs0.1), ⌜hd(cs0.2) '⌝ ^, hd(tl(cs0.1)))) ⊦
Used simplifier rules: ⊦ (σ × α).1 = σ; (s)
| ¬(frag(IOAut(startf, stepf))(cs.1, cs.2) ∧ startf(cs.1[0]) → cs.1 ≠ [] ∧ startf(hd(cs.1))) ∨ ¬ ( hd(cs0.1) = s ∧ cs0.1 ≠ [] ∧ cs0.2 ≠ [] ∧ tl(cs0.1) ≠ [] ∧ stepf(hd(cs0.1), hd(cs0.2), hd(tl(cs0.1))) ∧ hd(cs0.2) = a ∧ cs1 = tl(cs0.1) × tl(cs0.2) → move(IOAut(startf, stepf))(hd(cs0.1), ⌜hd(cs0.2) '⌝ ^, hd(tl(cs0.1)))) ⊦ |
cs = σ × α, ¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(cs0.1) = s ∧ cs0.1 ≠ [] ∧ cs0.2 ≠ [] ∧ tl(cs0.1) ≠ [] ∧ stepf(hd(cs0.1), hd(cs0.2), hd(tl(cs0.1))) ∧ hd(cs0.2) = a ∧ cs1 = tl(cs0.1) × tl(cs0.2) → move(IOAut(startf, stepf))(hd(cs0.1), ⌜hd(cs0.2) '⌝ ^, hd(tl(cs0.1)))) ⊦
Used simplifier rules: ⊦ σ = σα.1 ∧ α = σα.2 ↔ σα = σ × α; (elim) Used terms: cs, σ, α
| cs = σ × α, ¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(cs0.1) = s ∧ cs0.1 ≠ [] ∧ cs0.2 ≠ [] ∧ tl(cs0.1) ≠ [] ∧ stepf(hd(cs0.1), hd(cs0.2), hd(tl(cs0.1))) ∧ hd(cs0.2) = a ∧ cs1 = tl(cs0.1) × tl(cs0.2) → move(IOAut(startf, stepf))(hd(cs0.1), ⌜hd(cs0.2) '⌝ ^, hd(tl(cs0.1)))) ⊦ |
¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(cs0.1) = s ∧ cs0.1 ≠ [] ∧ cs0.2 ≠ [] ∧ tl(cs0.1) ≠ [] ∧ stepf(hd(cs0.1), hd(cs0.2), hd(tl(cs0.1))) ∧ hd(cs0.2) = a ∧ cs1 = tl(cs0.1) × tl(cs0.2) → move(IOAut(startf, stepf))(hd(cs0.1), ⌜hd(cs0.2) '⌝ ^, hd(tl(cs0.1)))) ⊦
| ¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(cs0.1) = s ∧ cs0.1 ≠ [] ∧ cs0.2 ≠ [] ∧ tl(cs0.1) ≠ [] ∧ stepf(hd(cs0.1), hd(cs0.2), hd(tl(cs0.1))) ∧ hd(cs0.2) = a ∧ cs1 = tl(cs0.1) × tl(cs0.2) → move(IOAut(startf, stepf))(hd(cs0.1), ⌜hd(cs0.2) '⌝ ^, hd(tl(cs0.1)))) ⊦ |
cs0 = σ0 × α0, ¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(σ0) = s ∧ σ0 ≠ [] ∧ α0 ≠ [] ∧ tl(σ0) ≠ [] ∧ stepf(hd(σ0), hd(α0), hd(tl(σ0))) ∧ hd(α0) = a ∧ cs1 = tl(σ0) × tl(α0) → move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0)))) ⊦
Used simplifier rules: ⊦ σ = σα.1 ∧ α = σα.2 ↔ σα = σ × α; (elim) Used terms: cs0, σ0, α0
| cs0 = σ0 × α0, ¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(σ0) = s ∧ σ0 ≠ [] ∧ α0 ≠ [] ∧ tl(σ0) ≠ [] ∧ stepf(hd(σ0), hd(α0), hd(tl(σ0))) ∧ hd(α0) = a ∧ cs1 = tl(σ0) × tl(α0) → move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0)))) ⊦ |
¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(σ0) = s ∧ σ0 ≠ [] ∧ α0 ≠ [] ∧ tl(σ0) ≠ [] ∧ stepf(hd(σ0), hd(α0), hd(tl(σ0))) ∧ hd(α0) = a ∧ cs1 = tl(σ0) × tl(α0) → move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0)))) ⊦
| ¬(frag(IOAut(startf, stepf))(σ, α) ∧ startf(σ[0]) → σ ≠ [] ∧ startf(hd(σ))) ∨ ¬ ( hd(σ0) = s ∧ σ0 ≠ [] ∧ α0 ≠ [] ∧ tl(σ0) ≠ [] ∧ stepf(hd(σ0), hd(α0), hd(tl(σ0))) ∧ hd(α0) = a ∧ cs1 = tl(σ0) × tl(α0) → move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0)))) ⊦ |
frag(IOAut(startf, stepf))(σ, α), startf(σ[0]) ⊦ σ ≠ [] ∧ startf(hd(σ))
cs1 = tl(σ0) × tl(α0), hd(σ0) = s, hd(α0) = a, tl(σ0) ≠ [], α0 ≠ [], σ0 ≠ [], stepf(hd(σ0), hd(α0), hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0))) ⊦
| frag(IOAut(startf, stepf))(σ, α), startf(σ[0]) ⊦ σ ≠ [] ∧ startf(hd(σ)) |
σ ≠ [], frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ startf(hd(σ)) ⊦
Used simplifier rules: ⊦ ¬ frag(IOAut(startf, stepf))([], α); (s)
| σ ≠ [], frag(IOAut(startf, stepf))(σ, α), startf(σ[0]), ¬ startf(hd(σ)) ⊦ |
Used simplifier rules: ⊦ ⌜a '⌝ + σ ≠ []; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: σ, s, σ0
| cs1 = tl(σ0) × tl(α0), hd(σ0) = s, hd(α0) = a, tl(σ0) ≠ [], α0 ≠ [], σ0 ≠ [], stepf(hd(σ0), hd(α0), hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0))) ⊦ |
tl(σ0) ≠ [], α0 ≠ [], σ0 ≠ [], stepf(hd(σ0), hd(α0), hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0))) ⊦
| tl(σ0) ≠ [], α0 ≠ [], σ0 ≠ [], stepf(hd(σ0), hd(α0), hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜hd(α0) '⌝ ^, hd(tl(σ0))) ⊦ |
α0 = a + α, tl(σ0) ≠ [], α0 ≠ [], σ0 ≠ [], stepf(hd(σ0), a, hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜a '⌝ ^, hd(tl(σ0))) ⊦
Used simplifier rules: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: α0, a0, α
| α0 = a + α, tl(σ0) ≠ [], α0 ≠ [], σ0 ≠ [], stepf(hd(σ0), a, hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜a '⌝ ^, hd(tl(σ0))) ⊦ |
tl(σ0) ≠ [], σ0 ≠ [], stepf(hd(σ0), a, hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜a '⌝ ^, hd(tl(σ0))) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ + σ ≠ []; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| tl(σ0) ≠ [], σ0 ≠ [], stepf(hd(σ0), a, hd(tl(σ0))), ¬ move(IOAut(startf, stepf))(hd(σ0), ⌜a '⌝ ^, hd(tl(σ0))) ⊦ |
σ0 = s + σ1, σ0 ≠ [], σ1 ≠ [], stepf(s, a, hd(σ1)), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, hd(σ1)) ⊦
Used simplifier rules: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: σ0, s, σ
| σ0 = s + σ1, σ0 ≠ [], σ1 ≠ [], stepf(s, a, hd(σ1)), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, hd(σ1)) ⊦ |
σ1 ≠ [], stepf(s, a, hd(σ1)), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, hd(σ1)) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜a '⌝ + σ ≠ []; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| σ1 ≠ [], stepf(s, a, hd(σ1)), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, hd(σ1)) ⊦ |
σ1 = s0 + σ0, σ1 ≠ [], stepf(s, a, s0), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, s0) ⊦
Used simplifier rules: ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: σ1, s0, σ0
| σ1 = s0 + σ0, σ1 ≠ [], stepf(s, a, s0), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, s0) ⊦ |
stepf(s, a, s0), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, s0) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] ⊦ ⌜a '⌝ + σ ≠ []; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| stepf(s, a, s0), ¬ move(IOAut(startf, stepf))(s, ⌜a '⌝ ^, s0) ⊦ |
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
stepf(s, a, s0), ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s0 = sl.last ∧ α ^ = ⌜a '⌝ ^) ⊦
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 ∧ α ^ = β) |
| stepf(s, a, s0), ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s = sl[0] ∧ s0 = sl.last ∧ α ^ = ⌜a '⌝ ^) ⊦ |
stepf(s, a, s0), ∀ α, sl. ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ s ≠ sl[0] ∨ s0 ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ ^ ⊦
Used simplifier rules: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)
| stepf(s, a, s0), ∀ α, sl. ¬ frag(IOAut(startf, stepf))(⌜sl⌝ , α) ∨ ¬ finp(α) ∨ s ≠ sl[0] ∨ s0 ≠ sl.last ∨ α ^ ≠ ⌜a '⌝ ^ ⊦ |
stepf(s, a, s0), ¬ frag(IOAut(startf, stepf))(⌜s +l s0⌝ , ⌜a '⌝ ) ∨ ¬ finp(⌜a '⌝ ) ∨ s ≠ (s +l s0)[0] ∨ s0 ≠ (s +l s0).last ∨ ⌜a '⌝ ^ ≠ ⌜a '⌝ ^ ⊦
Used terms: ⌜a '⌝ , s +l s0
| stepf(s, a, s0), ¬ frag(IOAut(startf, stepf))(⌜s +l s0⌝ , ⌜a '⌝ ) ∨ ¬ finp(⌜a '⌝ ) ∨ s ≠ (s +l s0)[0] ∨ s0 ≠ (s +l s0).last ∨ ⌜a '⌝ ^ ≠ ⌜a '⌝ ^ ⊦ |
stepf(s, a, s0), ¬ frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜s0 '⌝ , ⌜a '⌝ ) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ a +l b = a ' + b '; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| stepf(s, a, s0), ¬ frag(IOAut(startf, stepf))(⌜s '⌝ + ⌜s0 '⌝ , ⌜a '⌝ ) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic 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 ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) n ≠ 0 ⊦ (⌜a '⌝ + σ)[(* n)] = σ[n - 1]; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[IOstatestream] Used terms: ⌜a '⌝ , ⌜s '⌝ + ⌜s0 '⌝ , stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
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.