| ¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^ |
α ^ ≠ (α from n)^, ¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦
| α ^ ≠ (α from n)^, ¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ |
α ^ ≠ (α from n)^, ¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦
| α ^ ≠ (α from n)^, ¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ |
α ^ ≠ (α from n0 +1)^, ¬ # α < ⌜n0 +1⌝ , ∀ m. m < n0 +1 → α[m] = τ, ∀ α. ¬(α ^ ≠ (α from n0)^ ∧ ¬ # α < ⌜n0⌝ ∧ (∀ m. m < n0 → α[m] = τ)) ⊦
Used simplifier rules: nat freely generated by 0, +1;; ⊦ σ from 0 = σ; (s)
| α ^ ≠ (α from n0 +1)^, ¬ # α < ⌜n0 +1⌝ , ∀ m. m < n0 +1 → α[m] = τ, ∀ α. ¬(α ^ ≠ (α from n0)^ ∧ ¬ # α < ⌜n0⌝ ∧ (∀ m. m < n0 → α[m] = τ)) ⊦ |
α ^ ≠ (α from n0 + 1)^, ⌜n0⌝ < # α, ∀ α0. α0 ^ = (α0 from n0)^ ∨ # α0 < ⌜n0⌝ ∨ ¬(∀ m. m < n0 → α0[m] = τ), ∀ m. ¬ n0 < m → α[m] = τ ⊦
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 +1 = m + 1; (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) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| α ^ ≠ (α from n0 + 1)^, ⌜n0⌝ < # α, ∀ α0. α0 ^ = (α0 from n0)^ ∨ # α0 < ⌜n0⌝ ∨ ¬(∀ m. m < n0 → α0[m] = τ), ∀ m. ¬ n0 < m → α[m] = τ ⊦ |
α ^ ≠ (α from n0 + 1)^, ⌜n0⌝ < # α, ∀ m. ¬ n0 < m → α[m] = τ, tl(α) ^ = (tl(α) from n0)^ ∨ # tl(α) < ⌜n0⌝ ∨ ¬(∀ m. m < n0 → tl(α)[m] = τ) ⊦
Used terms: tl(α)
| α ^ ≠ (α from n0 + 1)^, ⌜n0⌝ < # α, ∀ m. ¬ n0 < m → α[m] = τ, tl(α) ^ = (tl(α) from n0)^ ∨ # tl(α) < ⌜n0⌝ ∨ ¬(∀ m. m < n0 → tl(α)[m] = τ) ⊦ |
α ^ ≠ (α from n0 + 1)^, ⌜n0⌝ < # α, ∀ m. ¬ n0 < m → α[m] = τ, tl(α) ^ = (tl(α) from n0)^ ∨ # tl(α) < ⌜n0⌝ ∨ ¬(n < n0 → tl(α)[n] = τ) ⊦
| α ^ ≠ (α from n0 + 1)^, ⌜n0⌝ < # α, ∀ m. ¬ n0 < m → α[m] = τ, tl(α) ^ = (tl(α) from n0)^ ∨ # tl(α) < ⌜n0⌝ ∨ ¬(n < n0 → tl(α)[n] = τ) ⊦ |
α = a + σ0, α ^ ≠ (α from n0 + 1)^, α ≠ [], ⌜n0⌝ < # α, ∀ m. ¬ n0 < m → α[m] = τ, σ0 ^ = (σ0 from n0)^ ∨ # σ0 < ⌜n0⌝ ∨ ¬(n < n0 → σ0[n] = τ) ⊦
Used simplifier rules: remtau-empty: ⊦ [] ^ = []; ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < 0; (s) ⊦ σ ≠ [] → (a = hd(σ) ∧ σ0 = tl(σ) ↔ σ = a + σ0); (elim) Used terms: α, a, σ0
| α = a + σ0, α ^ ≠ (α from n0 + 1)^, α ≠ [], ⌜n0⌝ < # α, ∀ m. ¬ n0 < m → α[m] = τ, σ0 ^ = (σ0 from n0)^ ∨ # σ0 < ⌜n0⌝ ∨ ¬(n < n0 → σ0[n] = τ) ⊦ |
⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ, σ0 ^ = (σ0 from n0)^ ∨ ¬(n < n0 → σ0[n] = τ) ⊦
Used simplifier rules: remtau-append: ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; ⊦ a + σ = ⌜a '⌝ + σ; (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∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ ⌜a '⌝ + σ ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜a '⌝ + σ from n + 1 = σ from n; (s)
| ⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ, σ0 ^ = (σ0 from n0)^ ∨ ¬(n < n0 → σ0[n] = τ) ⊦ |
σ0 ^ = (σ0 from n0)^, ⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦
⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, σ0[n] ≠ τ, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦
| σ0 ^ = (σ0 from n0)^, ⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦ |
σ0 ^ = (σ0 from n0)^, ⌜a '⌝ ^ + σ0 ^ ≠ σ0 ^, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦
| σ0 ^ = (σ0 from n0)^, ⌜a '⌝ ^ + σ0 ^ ≠ σ0 ^, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦ |
Used simplifier rules: remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; ⊦ ¬ n < 0; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) ⊦ [] + σ = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: 0
| ⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, σ0[n] ≠ τ, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦ |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
a = τ, ⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, σ0[n] ≠ τ, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦
⌜a '⌝ + σ0 ^ ≠ (σ0 from n0)^, σ0[n] ≠ τ, a ≠ τ, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦
Used terms: a
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| a = τ, ⌜a '⌝ ^ + σ0 ^ ≠ (σ0 from n0)^, σ0[n] ≠ τ, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦ |
σ0[n] ≠ τ, σ0 ^ ≠ (σ0 from n0)^, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜τ '⌝ + σ0)[m] = τ ⊦
Used simplifier rules: remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s)
| σ0[n] ≠ τ, σ0 ^ ≠ (σ0 from n0)^, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜τ '⌝ + σ0)[m] = τ ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: n + 1
| ⌜a '⌝ + σ0 ^ ≠ (σ0 from n0)^, σ0[n] ≠ τ, a ≠ τ, n < n0, ¬ # σ0 < ⌜n0⌝ , ∀ m. ¬ n0 < m → (⌜a '⌝ + σ0)[m] = τ ⊦ |
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ (⌜a '⌝ + σ)[0] = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] 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.