| ∀ m. ⌜m⌝ < # α → α[m] ≠ τ ⊦ α ^ = α |
α ^ ≠ α, ∀ m. ⌜m⌝ < # α → α[m] ≠ τ ⊦
| α ^ ≠ α, ∀ m. ⌜m⌝ < # α → α[m] ≠ τ ⊦ |
⌜al⌝ ^ ≠ ⌜al⌝ , ∀ m. ⌜m⌝ < # ⌜al⌝ → ⌜al⌝ [m] ≠ τ ⊦
⌜af⌝ ^ ≠ ⌜af⌝ , ∀ m. ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] ≠ τ ⊦
Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;
| ⌜al⌝ ^ ≠ ⌜al⌝ , ∀ m. ⌜m⌝ < # ⌜al⌝ → ⌜al⌝ [m] ≠ τ ⊦ |
⌜al⌝ ^ ≠ ⌜al⌝ , ∀ m. m < # al → al[m] ≠ τ ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| ⌜al⌝ ^ ≠ ⌜al⌝ , ∀ m. m < # al → al[m] ≠ τ ⊦ |
⌜a + al0⌝ ^ ≠ ⌜a + al0⌝ , ∀ m. m < #(a + al0) → (a + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (∀ m. m < # al0 → al0[m] ≠ τ)
Used simplifier rules: remtau-empty: ⊦ [] ^ = []; actionlist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s)
| ⌜a + al0⌝ ^ ≠ ⌜a + al0⌝ , ∀ m. m < #(a + al0) → (a + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (∀ m. m < # al0 → al0[m] ≠ τ) |
⌜a '⌝ ^ + ⌜al0⌝ ^ ≠ ⌜a '⌝ + ⌜al0⌝ , ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ)
Used simplifier rules: remtau-fin-append: ⊦ (⌜al⌝ + ⌜al2⌝ )^ = ⌜al⌝ ^ + ⌜al2⌝ ^; ⊦ a + x = a ' + x; (s) 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) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| ⌜a '⌝ ^ + ⌜al0⌝ ^ ≠ ⌜a '⌝ + ⌜al0⌝ , ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ) |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
a = τ, ⌜a '⌝ ^ + ⌜al0⌝ ^ ≠ ⌜a '⌝ + ⌜al0⌝ , ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ)
⌜a '⌝ + ⌜al0⌝ ^ ≠ ⌜a '⌝ + ⌜al0⌝ , a ≠ τ, ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ)
Used terms: a
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| a = τ, ⌜a '⌝ ^ + ⌜al0⌝ ^ ≠ ⌜a '⌝ + ⌜al0⌝ , ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ) |
∀ m. ¬ # al0 < m → (τ ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ)
Used simplifier rules: remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; remtau-notcontainstau-03: ⊦ α0 ^ ≠ ⌜τ '⌝ + α; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s)
| ∀ m. ¬ # al0 < m → (τ ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ) |
Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: 0
| ⌜a '⌝ + ⌜al0⌝ ^ ≠ ⌜a '⌝ + ⌜al0⌝ , a ≠ τ, ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦ ⌜al0⌝ ^ ≠ ⌜al0⌝ ∧ (m < # al0 → al0[m] ≠ τ) |
al0[m] = τ, ⌜al0⌝ ^ ≠ ⌜al0⌝ , a ≠ τ, al0 ≠ [], m < # al0, ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ0 = ⌜x⌝ + σ1 ↔ σ0 = σ1; (s)
| al0[m] = τ, ⌜al0⌝ ^ ≠ ⌜al0⌝ , a ≠ τ, al0 ≠ [], m < # al0, ∀ m. ¬ # al0 < m → (a ' + al0)[m] ≠ τ ⊦ |
Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ (a ' + x)[n + 1] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: m + 1
| ⌜af⌝ ^ ≠ ⌜af⌝ , ∀ m. ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] ≠ τ ⊦ |
⌜af⌝ ^ ≠ ⌜af⌝ , ∀ m. af(m) ≠ τ ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ⌜af⌝ ^ ≠ ⌜af⌝ , ∀ m. af(m) ≠ τ ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n)
∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ # ⌜af⌝ ∨ (∃ n. ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af⌝ to n)) ⊦
Used terms: ⌜af⌝ , ⌜af⌝ ^
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ¬ # σ0 < ⌜n⌝ → σ0 to n = σ1 to n) |
| ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ # ⌜af⌝ ∨ (∃ n. ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af⌝ to n)) ⊦ |
∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ ∞ ∨ ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af to n⌝ ) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf⌝ = ∞; (s)
| ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ ∞ ∨ ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af to n⌝ ) ⊦ |
# ⌜af⌝ ^ = ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ ∞ ∨ ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af to n⌝ ) ⊦
# ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ ∞ ∨ ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af to n⌝ ) ⊦
Used formulas: # ⌜af⌝ ^ = ∞
| # ⌜af⌝ ^ = ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ ∞ ∨ ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af to n⌝ ) ⊦ |
# ⌜af⌝ ^ = ∞, ⌜af⌝ ^ to n ≠ ⌜af to n⌝ , ∀ m. af(m) ≠ τ ⊦
Used simplifier rules: ⊦ ¬ ∞ < n∞; (s)
| # ⌜af⌝ ^ = ∞, ⌜af⌝ ^ to n ≠ ⌜af to n⌝ , ∀ m. af(m) ≠ τ ⊦ |
# ⌜af⌝ ^ = ∞, ⌜af⌝ ^ to n0 +1 ≠ ⌜af to n0 +1⌝ , ∀ m. af(m) ≠ τ, ∀ af. ¬(# ⌜af⌝ ^ = ∞ ∧ ⌜af⌝ ^ to n0 ≠ ⌜af to n0⌝ ∧ (∀ m. af(m) ≠ τ)) ⊦
Used simplifier rules: nat freely generated by 0, +1;; ⊦ σ to 0 = []; (s) ⊦ nf to 0 = []; (s) ⊦ ⌜[]⌝ = []; (s)
| # ⌜af⌝ ^ = ∞, ⌜af⌝ ^ to n0 +1 ≠ ⌜af to n0 +1⌝ , ∀ m. af(m) ≠ τ, ∀ af. ¬(# ⌜af⌝ ^ = ∞ ∧ ⌜af⌝ ^ to n0 ≠ ⌜af to n0⌝ ∧ (∀ m. af(m) ≠ τ)) ⊦ |
# ⌜af⌝ ^ = ∞, ⌜af⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| # ⌜af⌝ ^ = ∞, ⌜af⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝
# (af(0) + ⌜λ n. af(n + 1)⌝ )^ = ∞, (af(0) + ⌜λ n. af(n + 1)⌝ )^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦
Used terms: af
| ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ |
| # (af(0) + ⌜λ n. af(n + 1)⌝ )^ = ∞, (af(0) + ⌜λ n. af(n + 1)⌝ )^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦ |
# ⌜af(0) '⌝ ^ + # ⌜λ n. af(n + 1)⌝ ^ = ∞, ⌜af(0) '⌝ ^ + ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦
Used simplifier rules: remtau-append: ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # ⌜af(0) '⌝ ^ + # ⌜λ n. af(n + 1)⌝ ^ = ∞, ⌜af(0) '⌝ ^ + ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝
# ⌜af(0) '⌝ ^ + # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) = τ, ⌜af(0) '⌝ ^ + ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦
# ⌜af(0) '⌝ + # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) ≠ τ, ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦
Used terms: af(0)
| ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ |
| # ⌜af(0) '⌝ ^ + # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) = τ, ⌜af(0) '⌝ ^ + ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) = τ, ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦
Used simplifier rules: remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (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∞ + ⌜0⌝ = n∞; (s) ⊦ # [] = ⌜0⌝ ; (s)
| # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) = τ, ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦ |
Used terms: 0
| # ⌜af(0) '⌝ + # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) ≠ τ, ⌜af(0) '⌝ + ⌜λ n. af(n + 1)⌝ ^ to n0 + 1 ≠ ⌜af to n0 + 1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ∞, ⌜af(0) '⌝ + (⌜λ n. af(n + 1)⌝ ^ to n0) ≠ ⌜af to n0 + 1⌝ , af(0) ≠ τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ ⌜a '⌝ + σ to n + 1 = a + (σ to n); (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 ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)
| # ⌜λ n. af(n + 1)⌝ ^ = ∞, ⌜af(0) '⌝ + (⌜λ n. af(n + 1)⌝ ^ to n0) ≠ ⌜af to n0 + 1⌝ , af(0) ≠ τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
⊦ nf to n + 1 = nf(0) + ((λ n. nf(n + 1)) to n)
# ⌜λ n. af(n + 1)⌝ ^ = ∞, ⌜af(0) '⌝ + (⌜λ n. af(n + 1)⌝ ^ to n0) ≠ ⌜af(0) + ((λ n. af(n + 1)) to n0)⌝ , af(0) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦
Used terms: n0, af
| ⊦ nf to n + 1 = nf(0) + ((λ n. nf(n + 1)) to n) |
| # ⌜λ n. af(n + 1)⌝ ^ = ∞, ⌜af(0) '⌝ + (⌜λ n. af(n + 1)⌝ ^ to n0) ≠ ⌜af(0) + ((λ n. af(n + 1)) to n0)⌝ , af(0) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) ≠ τ, ⌜λ n. af(n + 1)⌝ ^ to n0 ≠ ⌜(λ n. af(n + 1)) to n0⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ0 = ⌜x⌝ + σ1 ↔ σ0 = σ1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s)
| # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) ≠ τ, ⌜λ n. af(n + 1)⌝ ^ to n0 ≠ ⌜(λ n. af(n + 1)) to n0⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ∞ ∨ ⌜af0⌝ ^ to n0 = ⌜af0 to n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) ≠ τ, ⌜λ n. af(n + 1)⌝ ^ to n0 ≠ ⌜(λ n. af(n + 1)) to n0⌝ , ∀ m. af(m) ≠ τ, # ⌜λ n. af(n + 1)⌝ ^ ≠ ∞ ∨ ⌜λ n. af(n + 1)⌝ ^ to n0 = ⌜(λ n. af(n + 1)) to n0⌝ ∨ ¬(∀ m. af(m + 1) ≠ τ) ⊦
Used terms: λ n. af(n + 1)
| # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(0) ≠ τ, ⌜λ n. af(n + 1)⌝ ^ to n0 ≠ ⌜(λ n. af(n + 1)) to n0⌝ , ∀ m. af(m) ≠ τ, # ⌜λ n. af(n + 1)⌝ ^ ≠ ∞ ∨ ⌜λ n. af(n + 1)⌝ ^ to n0 = ⌜(λ n. af(n + 1)) to n0⌝ ∨ ¬(∀ m. af(m + 1) ≠ τ) ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ∞, af(n + 1) = τ, af(0) ≠ τ, ⌜λ n. af(n + 1)⌝ ^ to n0 ≠ ⌜(λ n. af(n + 1)) to n0⌝ , ∀ m. af(m) ≠ τ ⊦
| # ⌜λ n. af(n + 1)⌝ ^ = ∞, af(n + 1) = τ, af(0) ≠ τ, ⌜λ n. af(n + 1)⌝ ^ to n0 ≠ ⌜(λ n. af(n + 1)) to n0⌝ , ∀ m. af(m) ≠ τ ⊦ |
Used terms: n + 1
| # ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ ≠ ∞ ∨ ¬(¬ # ⌜af⌝ ^ < ⌜n⌝ → ⌜af⌝ ^ to n = ⌜af to n⌝ ) ⊦ |
# ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ ⊦
| # ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ ⊦ |
⊦ n∞ = ⌜n∞.n⌝ ∨ n∞ = ∞
# ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ = ⌜(# ⌜af⌝ ^).n⌝ ∨ # ⌜af⌝ ^ = ∞ ⊦
Used terms: # ⌜af⌝ ^
| ⊦ n∞ = ⌜n∞.n⌝ ∨ n∞ = ∞ |
| # ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ = ⌜(# ⌜af⌝ ^).n⌝ ∨ # ⌜af⌝ ^ = ∞ ⊦ |
# ⌜af⌝ ^ = ⌜n⌝ , # ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ = ⌜n⌝ ∨ # ⌜af⌝ ^ = ∞ ⊦
Used simplifier rules: ⊦ n∞ ≠ ∞ → (n = n∞.n ↔ n∞ = ⌜n⌝ ); (elim) Used terms: # ⌜af⌝ ^, n
| # ⌜af⌝ ^ = ⌜n⌝ , # ⌜af⌝ ^ ≠ ∞, ∀ m. af(m) ≠ τ, # ⌜af⌝ ^ = ⌜n⌝ ∨ # ⌜af⌝ ^ = ∞ ⊦ |
# ⌜af⌝ ^ = ⌜n⌝ , ∀ m. af(m) ≠ τ ⊦
| # ⌜af⌝ ^ = ⌜n⌝ , ∀ m. af(m) ≠ τ ⊦ |
# ⌜af⌝ ^ = ⌜n⌝ , ∀ m. af(m) ≠ τ ⊦
| # ⌜af⌝ ^ = ⌜n⌝ , ∀ m. af(m) ≠ τ ⊦ |
# ⌜af⌝ ^ = ⌜0⌝ , ∀ m. af(m) ≠ τ ⊦
# ⌜af⌝ ^ = ⌜n0 +1⌝ , ∀ m. af(m) ≠ τ, ∀ af. ¬(# ⌜af⌝ ^ = ⌜n0⌝ ∧ (∀ m. af(m) ≠ τ)) ⊦
Used simplifier rules: nat freely generated by 0, +1;;
| # ⌜af⌝ ^ = ⌜0⌝ , ∀ m. af(m) ≠ τ ⊦ |
⌜af⌝ ^ = [], ∀ m. af(m) ≠ τ ⊦
Used simplifier rules: ⊦ # σ = ⌜0⌝ ↔ σ = []; (s)
| ⌜af⌝ ^ = [], ∀ m. af(m) ≠ τ ⊦ |
⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝
(af(0) + ⌜λ n. af(n + 1)⌝ )^ = [], ∀ m. af(m) ≠ τ ⊦
Used terms: af
| ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ |
| (af(0) + ⌜λ n. af(n + 1)⌝ )^ = [], ∀ m. af(m) ≠ τ ⊦ |
⊦ a ≠ τ → (a + β)^ = a + β ^
(af(0) + ⌜λ n. af(n + 1)⌝ )^ = [], af(0) = τ, ∀ m. af(m) ≠ τ ⊦
Used simplifier rules: ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: ⌜λ n. af(n + 1)⌝ , af(0)
| ⊦ a ≠ τ → (a + β)^ = a + β ^ |
| (af(0) + ⌜λ n. af(n + 1)⌝ )^ = [], af(0) = τ, ∀ m. af(m) ≠ τ ⊦ |
⌜λ n. af(n + 1)⌝ ^ = [], af(0) = τ, ∀ m. af(m) ≠ τ ⊦
Used simplifier rules: remtau-append: ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; one-eq-empty: ⊦ ⌜a '⌝ ^ = [] ↔ a = τ; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| ⌜λ n. af(n + 1)⌝ ^ = [], af(0) = τ, ∀ m. af(m) ≠ τ ⊦ |
Used terms: 0
| # ⌜af⌝ ^ = ⌜n0 +1⌝ , ∀ m. af(m) ≠ τ, ∀ af. ¬(# ⌜af⌝ ^ = ⌜n0⌝ ∧ (∀ m. af(m) ≠ τ)) ⊦ |
# ⌜af⌝ ^ = ⌜n0⌝ + ⌜1⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(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⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m +1 = m + 1; (s)
| # ⌜af⌝ ^ = ⌜n0⌝ + ⌜1⌝ , ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝
# (af(0) + ⌜λ n. af(n + 1)⌝ )^ = ⌜n0⌝ + ⌜1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦
Used terms: af
| ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ |
| # (af(0) + ⌜λ n. af(n + 1)⌝ )^ = ⌜n0⌝ + ⌜1⌝ , ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦ |
⊦ a ≠ τ → (a + β)^ = a + β ^
# (af(0) + ⌜λ n. af(n + 1)⌝ )^ = ⌜n0⌝ + ⌜1⌝ , af(0) = τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦
#(af(0) + ⌜λ n. af(n + 1)⌝ ^) = ⌜n0⌝ + ⌜1⌝ , af(0) ≠ τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦
Used terms: ⌜λ n. af(n + 1)⌝ , af(0)
| ⊦ a ≠ τ → (a + β)^ = a + β ^ |
| # (af(0) + ⌜λ n. af(n + 1)⌝ )^ = ⌜n0⌝ + ⌜1⌝ , af(0) = τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ + ⌜1⌝ , af(0) = τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦
Used simplifier rules: remtau-append: ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; remtau-onetau: ⊦ ⌜τ '⌝ ^ = []; 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∞ + ⌜0⌝ = n∞; (s) ⊦ # [] = ⌜0⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| # ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ + ⌜1⌝ , af(0) = τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
Used terms: 0
| #(af(0) + ⌜λ n. af(n + 1)⌝ ^) = ⌜n0⌝ + ⌜1⌝ , af(0) ≠ τ, ∀ m. af(m) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ) ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ , af(0) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦
Used simplifier rules: 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∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| # ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ , af(0) ≠ τ, ∀ af0. # ⌜af0⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af0(m) ≠ τ), ∀ m. af(m) ≠ τ ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ , af(0) ≠ τ, ∀ m. af(m) ≠ τ, # ⌜λ n. af(n + 1)⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af(m + 1) ≠ τ) ⊦
Used terms: λ n. af(n + 1)
| # ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ , af(0) ≠ τ, ∀ m. af(m) ≠ τ, # ⌜λ n. af(n + 1)⌝ ^ ≠ ⌜n0⌝ ∨ ¬(∀ m. af(m + 1) ≠ τ) ⊦ |
# ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ , af(n + 1) = τ, af(0) ≠ τ, ∀ m. af(m) ≠ τ ⊦
| # ⌜λ n. af(n + 1)⌝ ^ = ⌜n0⌝ , af(n + 1) = τ, af(0) ≠ τ, ∀ m. af(m) ≠ τ ⊦ |
Used terms: 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.