| IOAut?(IOAut(startf, stepf)) ⊦ traceprop(beh(IOAut(startf, stepf))) |
IOAut?(IOAut(startf, stepf)), ¬ traceprop(beh(IOAut(startf, stepf))) ⊦
| IOAut?(IOAut(startf, stepf)), ¬ traceprop(beh(IOAut(startf, stepf))) ⊦ |
⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP)
IOAut?(IOAut(startf, stepf)), (∃ α. ¬(beh(IOAut(startf, stepf))(α) → ext(α))) ∨ (∀ α. ¬ beh(IOAut(startf, stepf))(α)) ∨ ¬ prefix-closed(beh(IOAut(startf, stepf))) ⊦
Used terms: beh(IOAut(startf, stepf))
| ⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP) |
| IOAut?(IOAut(startf, stepf)), (∃ α. ¬(beh(IOAut(startf, stepf))(α) → ext(α))) ∨ (∀ α. ¬ beh(IOAut(startf, stepf))(α)) ∨ ¬ prefix-closed(beh(IOAut(startf, stepf))) ⊦ |
startf(s), ¬(trace(IOAut(startf, stepf))(α) → ext(α)) ∨ (∀ α0. ¬ trace(IOAut(startf, stepf))(α0)) ∨ ¬ prefix-closed(beh(IOAut(startf, stepf))) ⊦
Used simplifier rules: beh-def: ⊦ beh(IOAut(startf, stepf))(α) ↔ trace(IOAut(startf, stepf))(α); ⊦ IOAut?(IOAut(startf, stepf)) ↔ (∃ s. startf(s)); (s)
| startf(s), ¬(trace(IOAut(startf, stepf))(α) → ext(α)) ∨ (∀ α0. ¬ trace(IOAut(startf, stepf))(α0)) ∨ ¬ prefix-closed(beh(IOAut(startf, stepf))) ⊦ |
startf(s), trace(IOAut(startf, stepf))(α), ¬ ext(α) ⊦
startf(s), ∀ α0. ¬ trace(IOAut(startf, stepf))(α0) ⊦
startf(s), ¬ prefix-closed(beh(IOAut(startf, stepf))) ⊦
| startf(s), trace(IOAut(startf, stepf))(α), ¬ ext(α) ⊦ |
startf(s), trace(IOAut(startf, stepf))(α), ¬ ext(α) ⊦
| startf(s), trace(IOAut(startf, stepf))(α), ¬ ext(α) ⊦ |
⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n]))
startf(s), trace(IOAut(startf, stepf))(α), ∃ n. ¬(⌜n⌝ < # α → ext(α[n])) ⊦
Used terms: α
| ⊦ ext(α) ↔ (∀ n. ⌜n⌝ < # α → ext(α[n])) |
| startf(s), trace(IOAut(startf, stepf))(α), ∃ n. ¬(⌜n⌝ < # α → ext(α[n])) ⊦ |
α[n] = τ, ⌜n⌝ < # α, startf(s), trace(IOAut(startf, stepf))(α) ⊦
Used simplifier rules: ⊦ ext(a) ↔ a ≠ τ; (s)
| α[n] = τ, ⌜n⌝ < # α, startf(s), trace(IOAut(startf, stepf))(α) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
Used simplifier rules: ⌜n⌝ < # α ^ ⊦ α ^[n] ≠ τ; (s) Used terms: α, stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| startf(s), ∀ α0. ¬ trace(IOAut(startf, stepf))(α0) ⊦ |
startf(s), ¬ trace(IOAut(startf, stepf))([]) ⊦
Used terms: []
| startf(s), ¬ trace(IOAut(startf, stepf))([]) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
startf(s), ∀ σ, β. ¬([] = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) ⊦
Used terms: [], stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| startf(s), ∀ σ, β. ¬([] = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) ⊦ |
startf(s), ∀ σ, β. [] ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| startf(s), ∀ σ, β. [] ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ, β) ∨ ¬ startf(σ[0]) ⊦ |
Used simplifier rules: ⊦ [] ^ = []; (s) ⊦ frag(IOAut(startf, stepf))(⌜s '⌝ , []); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) Used terms: ⌜s '⌝ , []
| startf(s), ¬ prefix-closed(beh(IOAut(startf, stepf))) ⊦ |
⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2))
startf(s), ∃ α1, α2. ¬(beh(IOAut(startf, stepf))(α1) ∧ α2 ≤ α1 → beh(IOAut(startf, stepf))(α2)) ⊦
Used terms: beh(IOAut(startf, stepf))
| ⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2)) |
| startf(s), ∃ α1, α2. ¬(beh(IOAut(startf, stepf))(α1) ∧ α2 ≤ α1 → beh(IOAut(startf, stepf))(α2)) ⊦ |
startf(s), trace(IOAut(startf, stepf))(α1), α2 ≤ α1, ¬ trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: beh-def: ⊦ beh(IOAut(startf, stepf))(α) ↔ trace(IOAut(startf, stepf))(α);
| startf(s), trace(IOAut(startf, stepf))(α1), α2 ≤ α1, ¬ trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)
startf(s), trace(IOAut(startf, stepf))(α1), ¬ trace(IOAut(startf, stepf))(α2), ∃ α. α2 + α = α1 ⊦
Used terms: α1, α2
| ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2) |
| startf(s), trace(IOAut(startf, stepf))(α1), ¬ trace(IOAut(startf, stepf))(α2), ∃ α. α2 + α = α1 ⊦ |
startf(s), trace(IOAut(startf, stepf))(α2 + α), ¬ trace(IOAut(startf, stepf))(α2) ⊦
| startf(s), trace(IOAut(startf, stepf))(α2 + α), ¬ trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
startf(s), ¬ trace(IOAut(startf, stepf))(α2), ∃ σ, β. α2 + α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β) ⊦
Used terms: α2 + α, stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| startf(s), ¬ trace(IOAut(startf, stepf))(α2), ∃ σ, β. α2 + α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β) ⊦ |
α2 + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ trace(IOAut(startf, stepf))(α2) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| α2 + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ trace(IOAut(startf, stepf))(α2) ⊦ |
⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β))
α2 + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ, β. ¬(α2 = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) ⊦
Used terms: α2, stepf, startf
| ⊦ trace(IOAut(startf, stepf))(α) ↔ (∃ σ, β. α = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) |
| α2 + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ, β. ¬(α2 = β ^ ∧ exec(IOAut(startf, stepf))(σ, β)) ⊦ |
α2 + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. α2 ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
Used simplifier rules: ⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)
| α2 + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. α2 ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
α2 + α = α0 ^, α2 = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ0, β. α2 ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
α2 + α = α0 ^, α2 = ⌜af0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ0, β. α2 ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| α2 + α = α0 ^, α2 = ⌜al0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ0, β. α2 ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⌜al0⌝ + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
| ⌜al0⌝ + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)
⌜al0⌝ + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 ^ < ⌜# al0⌝ → (∃ m. ¬ # α0 < ⌜m⌝ ∧ α0 ^ to # al0 = (α0 to m)^), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
Used terms: α0, # al0
| ⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^) |
| ⌜al0⌝ + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 ^ < ⌜# al0⌝ → (∃ m. ¬ # α0 < ⌜m⌝ ∧ α0 ^ to # al0 = (α0 to m)^), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⌜al0⌝ + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 ^ < ⌜# al0⌝ → ¬ # α0 < ⌜m⌝ ∧ α0 ^ to # al0 = (α0 to m)^, ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
| ⌜al0⌝ + α = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 ^ < ⌜# al0⌝ → ¬ # α0 < ⌜m⌝ ∧ α0 ^ to # al0 = (α0 to m)^, ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⌜al0⌝ + α = α0 ^, # α0 ^ < ⌜# al0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
| ⌜al0⌝ + α = α0 ^, # α0 ^ < ⌜# al0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⌜al0⌝ + α = α0 ^, # α0 ^ < ⌜# al0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
| ⌜al0⌝ + α = α0 ^, # α0 ^ < ⌜# al0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ¬ n∞ + n∞1 < n∞1; (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
| ⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 < ⌜m⌝ , ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
| ⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 < ⌜m⌝ , ∀ σ0, β. ⌜al0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ⌜al0⌝ ≠ (α0 to m)^ ∨ ¬ frag(IOAut(startf, stepf))(σ to m + 1, α0 to m) ∨ ¬ startf((σ to m + 1)[0]) ⊦
Used terms: σ to m + 1, α0 to m
| ⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ⌜al0⌝ ≠ (α0 to m)^ ∨ ¬ frag(IOAut(startf, stepf))(σ to m + 1, α0 to m) ∨ ¬ startf((σ to m + 1)[0]) ⊦ |
⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 < ⌜m⌝ , ⌜al0⌝ ≠ α0 ^ to # al0 ∨ ¬ startf((σ to m + 1)[0]) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ¬ # α < ⌜n⌝ → (frag(IOAut(startf, stepf))(σ to n + 1, α to n) ↔ true); (ss)
| ⌜al0⌝ + α = α0 ^, α0 ^ to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 < ⌜m⌝ , ⌜al0⌝ ≠ α0 ^ to # al0 ∨ ¬ startf((σ to m + 1)[0]) ⊦ |
⌜al0⌝ + α to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ⌜al0⌝ ≠ ⌜al0⌝ + α to # al0 ∨ ¬ startf((σ to m + 1)[0]) ⊦
| ⌜al0⌝ + α to # al0 = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ⌜al0⌝ ≠ ⌜al0⌝ + α to # al0 ∨ ¬ startf((σ to m + 1)[0]) ⊦ |
⌜al0⌝ = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 < ⌜m⌝ , ¬ startf((σ to m + 1)[0]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ to # x = ⌜x⌝ ; (s)
| ⌜al0⌝ = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ¬ # α0 < ⌜m⌝ , ¬ startf((σ to m + 1)[0]) ⊦ |
m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]
⌜al0⌝ = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ¬ startf((σ to m + 1)[0]) ⊦ 0 < m + 1 ∧ ¬ # σ < ⌜m + 1⌝
Used terms: 0, m + 1, σ
| m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m] |
| ⌜al0⌝ = (α0 to m)^, frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ¬ # α0 < ⌜m⌝ , ¬ startf((σ to m + 1)[0]) ⊦ 0 < m + 1 ∧ ¬ # σ < ⌜m + 1⌝ |
⌜al0⌝ = ⌜af to m⌝ ^, frag(IOAut(startf, stepf))(σ, ⌜af⌝ ), startf(σ[0]), startf(s), ¬ ⌜m⌝ < # σ, ¬ startf((σ to m + 1)[0]) ⊦
Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ ¬ ∞ < n∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ frag(IOAut(startf, stepf))(σ, α) → (# α < # σ ↔ finp(α)); (ss) lele-trans: ⊦ ¬ n∞1 < n∞ ∧ ¬ n∞2 < n∞1 → ¬ n∞2 < n∞; (forward) from specification nat-inf 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) ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)
| ⌜al0⌝ = ⌜af to m⌝ ^, frag(IOAut(startf, stepf))(σ, ⌜af⌝ ), startf(σ[0]), startf(s), ¬ ⌜m⌝ < # σ, ¬ startf((σ to m + 1)[0]) ⊦ |
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ + ∞ = ∞; (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 ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ m + 1 ≠ 0; (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 ⊦ ¬ ∞ < n∞; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) Used terms: ⌜af⌝ , σ, stepf, startf
| ⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| α2 + α = α0 ^, α2 = ⌜af0⌝ , frag(IOAut(startf, stepf))(σ, α0), startf(σ[0]), startf(s), ∀ σ0, β. α2 ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
⌜af0⌝ = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. ⌜af0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s)
| ⌜af0⌝ = α0 ^, frag(IOAut(startf, stepf))(σ, α0), startf(s), startf(σ[0]), ∀ σ0, β. ⌜af0⌝ ≠ β ^ ∨ ¬ frag(IOAut(startf, stepf))(σ0, β) ∨ ¬ startf(σ0[0]) ⊦ |
Used terms: σ, α0
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.