| ⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) |
finp(⌜af⌝ ^) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
¬ finp(⌜af⌝ ^), ∃ n. ∀ m. n ≤ m → af(m) = τ ⊦
| finp(⌜af⌝ ^) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⊦ finp(σ) ↔ (∃ x. σ = ⌜x⌝ )
∃ x. ⌜af⌝ ^ = ⌜x⌝ ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used terms: ⌜af⌝ ^
| ⊦ finp(σ) ↔ (∃ x. σ = ⌜x⌝ ) |
| ∃ x. ⌜af⌝ ^ = ⌜x⌝ ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af⌝ ^ = ⌜al⌝ ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
| ⌜af⌝ ^ = ⌜al⌝ ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af⌝ ^ = ⌜al⌝ , ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: <; (wellfounded) Used terms: # al
| ⌜af⌝ ^ = ⌜al⌝ , ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af⌝ ^ = ⌜al⌝ , ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∀ m. 0 ≤ m → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ
Used terms: 0
| ⌜af⌝ ^ = ⌜al⌝ , ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∀ m. 0 ≤ m → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: ⊦ 0 ≤ m; (s)
| ⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
Used formulas: ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
| ⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
| ⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
∀ m. m < n → af(m) = τ ⊦ ⌜af⌝ ^ = (⌜af⌝ from n)^
⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∀ m. m < m0 → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ
(⌜af⌝ from m0)^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used terms: m0, af
| ∀ m. m < n → af(m) = τ ⊦ ⌜af⌝ ^ = (⌜af⌝ from n)^ |
| ⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∀ m. m < m0 → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af⌝ ^ = ⌜al⌝ , af(m0) ≠ τ, af(m) ≠ τ, af(m1) ≠ τ, m1 < m0, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ⌜af⌝ ^ = ⌜al⌝ , af(m0) ≠ τ, af(m) ≠ τ, af(m1) ≠ τ, m1 < m0, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
Used terms: m1
| (⌜af⌝ from m0)^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af from m0⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s)
| ⌜af from m0⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝
(((af from m0))(0) + ⌜λ n. ((af from m0))(n + 1)⌝ )^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used terms: af from m0
| ⊦ ⌜nf⌝ = nf(0) + ⌜λ n. nf(n + 1)⌝ |
| (((af from m0))(0) + ⌜λ n. ((af from m0))(n + 1)⌝ )^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: remtau-nontau-lem: ⊦ a ≠ τ → (⌜a '⌝ + β)^ = ⌜a '⌝ + β ^; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ((nf from n))(0) = nf(n); (s)
| ⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = hd(al), af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) ≠ hd(al), af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used formulas: af(m0) = hd(al)
| ⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = hd(al), af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜hd(al) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = hd(al), af(m) ≠ τ, hd(al) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
| ⌜hd(al) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = hd(al), af(m) ≠ τ, hd(al) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜a '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = a, al = a + al1, a ≠ τ, af(m) ≠ τ, al ≠ [], ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: al, a, y
| ⌜a '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) = a, al = a + al1, a ≠ τ, af(m) ≠ τ, al ≠ [], ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ a + x = a ' + x; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) Used terms: al1, λ n0. af(m0 + n0 + 1)
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∀ m. m1 + 1 + m0 ≤ m → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ
Used terms: m1 + 1 + m0
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m0) ≠ τ, af(m) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∀ m. m1 + 1 + m0 ≤ m → af(m) = τ, ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, ∀ m. m < m0 → af(m) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≤ n ↔ m < n; (s)
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, ∀ m. m < m0 → af(m) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, m2 - 1 - m0 < m0 → af(m2 - 1 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used terms: m2 - 1 - m0
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, m2 - 1 - m0 < m0 → af(m2 - 1 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, ¬ m0 + m0 < m2 → af(m2 - 1 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(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) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n → n ≠ 0; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ ¬ m + n < m; (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + 1 ≤ n ↔ m < n; (s) n0 ≤ n ⊦ m ≤ n - n0 ↔ m + n0 ≤ n; (s)
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m1 + m0 < m2, ¬ m0 + m0 < m2 → af(m2 - 1 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , m2 = m3 + 1, af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m2 ≠ 0, m1 + m0 < m2, ¬ m0 + m0 < m2 → af(m3 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: ⊦ ¬ n < 0; (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: m2, m3
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , m2 = m3 + 1, af(m) ≠ τ, af(m0) ≠ τ, af(m2) ≠ τ, m2 ≠ 0, m1 + m0 < m2, ¬ m0 + m0 < m2 → af(m3 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m3 + 1) ≠ τ, m1 + m0 ≤ m3, m3 < m0 + m0 → af(m3 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(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 < n ↔ ¬ n ≤ m; (ss) ⊦ m + 1 ≠ 0; (s)
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af(m3 + 1) ≠ τ, m1 + m0 ≤ m3, m3 < m0 + m0 → af(m3 - m0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , m3 = n0 + m0, af(m) ≠ τ, af(m0) ≠ τ, af(m3 + 1) ≠ τ, m1 + m0 ≤ m3, m0 ≤ m3, m3 < m0 + m0 → af(n0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ
Used simplifier rules: ⊦ m ≤ n ↔ ¬ n < m; (ss) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n → n ≠ 0; (s) ⊦ ¬ m + n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: m3, m0, n0
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , m3 = n0 + m0, af(m) ≠ τ, af(m0) ≠ τ, af(m3 + 1) ≠ τ, m1 + m0 ≤ m3, m0 ≤ m3, m3 < m0 + m0 → af(n0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af((n0 + m0) + 1) ≠ τ, m1 ≤ n0, n0 < m0 → af(n0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(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 + n0 ↔ n < n0; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m ≤ m + n; (s)
| ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al1⌝ , af(m) ≠ τ, af(m0) ≠ τ, af((n0 + m0) + 1) ≠ τ, m1 ≤ n0, n0 < m0 → af(n0) = τ, ∀ m. m1 ≤ m → af(m0 + m + 1) = τ, ∀ al0, af0. # al0 < #(af(m0) + al1) → ⌜af0⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af0(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n0
| ⌜af(m0) '⌝ + ⌜λ n. af((n + 1) + m0)⌝ ^ = ⌜al⌝ , af(m0) ≠ hd(al), af(m) ≠ τ, af(m0) ≠ τ, ∀ m. m < m0 → af(m) = τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ |
Used simplifier rules: ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜[]⌝ = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: al, a, y
| ⌜af⌝ ^ = ⌜al⌝ , af(m) ≠ τ, ∀ al0, af. # al0 < # al → ⌜af⌝ ^ = ⌜al0⌝ → (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ n. ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ) |
af(m) ≠ τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
| af(m) ≠ τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ) |
af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
Used simplifier rules: <; (wellfounded) Used terms: m
| af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ) |
af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
| af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ) |
af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), af(m) ≠ τ ∧ (∀ m0. m0 < m → af(m0) = τ)
Used terms: m
| af(m) ≠ τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), af(m) ≠ τ ∧ (∀ m0. m0 < m → af(m0) = τ) |
af(m0) ≠ τ, af(m) ≠ τ, m0 < m, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| af(m0) ≠ τ, af(m) ≠ τ, m0 < m, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ) |
af(m0) ≠ τ, af(m) ≠ τ, m0 < m, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
Used terms: m0, af
| af(m0) ≠ τ, af(m) ≠ τ, m0 < m, ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ), ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ) |
af(m0) ≠ τ, af(m) ≠ τ, af(m1) ≠ τ, m0 < m, ∀ m. m < m1 → af(m) = τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)
| af(m0) ≠ τ, af(m) ≠ τ, af(m1) ≠ τ, m0 < m, ∀ m. m < m1 → af(m) = τ, ∀ m0, af. m0 < m → af(m0) ≠ τ → (∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. m < n → af(m) = τ) |
Used terms: m1
| ¬ finp(⌜af⌝ ^), ∃ n. ∀ m. n ≤ m → af(m) = τ ⊦ |
⌜af0⌝ = ⌜af⌝ ^, ∀ m. ¬ n ≤ m ⊦
Used simplifier rules: remtau-fin: ⊦ ¬ finp(α ^) → ¬ finp(α); remtau-nottau-2: ⊦ α ^ = ⌜af⌝ → (af(n) = τ ↔ false); ⊦ ⌜nf⌝ = ⌜nf0⌝ ↔ nf = nf0; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic[actionstream]
| ⌜af0⌝ = ⌜af⌝ ^, ∀ m. ¬ n ≤ m ⊦ |
¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^
⌜af0⌝ = ⌜af⌝ ^, ∀ m. ¬ n ≤ m ⊦ ¬ # ⌜af⌝ < ⌜n⌝ ∧ (∀ m. n ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ)
Used simplifier rules: trace-fin: ⊦ ⌜al⌝ ^ ≠ ⌜af⌝ ; ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) Used terms: ⌜af⌝ , n
| ¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^ |
| ⌜af0⌝ = ⌜af⌝ ^, ∀ m. ¬ n ≤ m ⊦ ¬ # ⌜af⌝ < ⌜n⌝ ∧ (∀ m. n ≤ m ∧ ⌜m⌝ < # ⌜af⌝ → ⌜af⌝ [m] = τ) |
⌜af0⌝ = ⌜af⌝ ^, n ≤ n0, ∀ m. ¬ n ≤ m ⊦
Used simplifier rules: remtau-nottau-2: ⊦ α ^ = ⌜af⌝ → (af(n) = τ ↔ false); ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s)
| ⌜af0⌝ = ⌜af⌝ ^, n ≤ n0, ∀ m. ¬ n ≤ m ⊦ |
Used terms: n0
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.