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