| ⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) |
α ^ = ⌜al⌝ + β2 ⊦ ∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
| α ^ = ⌜al⌝ + β2 ⊦ ∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
α ^ = ⌜[]⌝ + β2 ⊦ ∃ α1, α2. α1 ^ = ⌜[]⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
α ^ = ⌜a + al0⌝ + β2, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a + al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used simplifier rules: actionlist freely generated by [], +;;
| α ^ = ⌜[]⌝ + β2 ⊦ ∃ α1, α2. α1 ^ = ⌜[]⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
⊦ ∃ α1, α2. α1 ^ = [] ∧ α2 ^ = (α1 + α2)^ ∧ α1 + α2 = α
Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ [] + σ = σ; (s)
| ⊦ ∃ α1, α2. α1 ^ = [] ∧ α2 ^ = (α1 + α2)^ ∧ α1 + α2 = α |
Used simplifier rules: remtau-empty: ⊦ [] ^ = []; ⊦ [] + σ = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: [], α
| α ^ = ⌜a + al0⌝ + β2, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a + al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
α ^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| α ^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
α ^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used simplifier rules: ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: α
| α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) |
| α ^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
α ^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
| α ^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^
(α from n)^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # α < ⌜n⌝ , ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used simplifier rules: ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) Used terms: α, n
| ¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^ |
| (α from n)^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # α < ⌜n⌝ , ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
(α from n)^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used simplifier rules: ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s)
| (α from n)^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α) ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
⊦ ⌜n⌝ < # σ → σ from n = σ[n] + (σ from n + 1)
(α[n] + (α from n + 1))^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used terms: n, α
| ⊦ ⌜n⌝ < # σ → σ from n = σ[n] + (σ from n + 1) |
| (α[n] + (α from n + 1))^ = (⌜a '⌝ + ⌜al0⌝ ) + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜a '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
(α from n + 1)^ = ⌜al0⌝ + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜(α1 + α2)[n] '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used simplifier rules: remtau-nontau-lem: ⊦ a ≠ τ → (⌜a '⌝ + β)^ = ⌜a '⌝ + β ^; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws) ⊦ a + σ = ⌜a '⌝ + σ; (s)
| (α from n + 1)^ = ⌜al0⌝ + β2, α[n] ≠ τ, ⌜n⌝ < # α, ∀ α, β2. α ^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜(α1 + α2)[n] '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
(α from n + 1)^ = ⌜al0⌝ + β2, α[n] ≠ τ, ⌜n⌝ < # α, (α from n + 1)^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α from n + 1), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜(α1 + α2)[n] '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α
Used terms: α from n + 1, β2
| (α from n + 1)^ = ⌜al0⌝ + β2, α[n] ≠ τ, ⌜n⌝ < # α, (α from n + 1)^ = ⌜al0⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α from n + 1), ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α2. α1 ^ = ⌜(α1 + α2)[n] '⌝ + ⌜al0⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α |
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α0. α1 ^ = ⌜(α1 + α0)[n] '⌝ + ⌜al0⌝ ∧ α0 ^ = α2 ^ ∧ α1 + α0 = α
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ∃ α1, α0. α1 ^ = ⌜(α1 + α0)[n] '⌝ + ⌜al0⌝ ∧ α0 ^ = α2 ^ ∧ α1 + α0 = α |
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ((α to n + 1) + α1)^ = ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ ∧ α2 ^ = α2 ^ ∧ ((α to n + 1) + α1) + α2 = α
Used terms: (α to n + 1) + α1, α2
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ((α to n + 1) + α1)^ = ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ ∧ α2 ^ = α2 ^ ∧ ((α to n + 1) + α1) + α2 = α |
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ((α to n + 1) + α1)^ = ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ ∧ ((α to n + 1) + α1) + α2 = α
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ((α to n + 1) + α1)^ = ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ ∧ ((α to n + 1) + α1) + α2 = α |
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, ((α to n + 1) + α1)^ ≠ ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ , ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , ((α to n + 1) + α1) + α2 ≠ α, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, ((α to n + 1) + α1)^ ≠ ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ , ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ |
⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, (α to n + 1)^ + α1 ^ ≠ ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, finp(α to n + 1), ∀ m. m < n → α[m] = τ ⊦
Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: α1, α to n + 1
| ⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^ |
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, (α to n + 1)^ + α1 ^ ≠ ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, finp(α to n + 1), ∀ m. m < n → α[m] = τ ⊦ |
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , (α to n + 1)^ + ⌜al0⌝ ≠ ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦
Used simplifier rules: ⊦ finp(σ to m); (s)
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , (α to n + 1)^ + ⌜al0⌝ ≠ ⌜(((α to n + 1) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ |
⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, ((α to n) + ⌜α[n] '⌝ )^ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦
Used terms: n, α
| ⌜n⌝ < # σ ⊦ σ to n + 1 = (σ to n) + ⌜σ[n] '⌝ |
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, ((α to n) + ⌜α[n] '⌝ )^ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ |
⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , ((α to n)^ + ⌜α[n] '⌝ ^) + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, finp(α to n), ∀ m. m < n → α[m] = τ ⊦
Used simplifier rules: ⊦ finp(σ to m); (s) Used terms: ⌜α[n] '⌝ , α to n
| ⊦ finp(α1) → (α1 + α2)^ = α1 ^ + α2 ^ |
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , ((α to n)^ + ⌜α[n] '⌝ ^) + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, finp(α to n), ∀ m. m < n → α[m] = τ ⊦ |
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, (α to n)^ + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦
Used simplifier rules: remtau-one: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; ⊦ finp(σ to m); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, (α to n)^ + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ |
∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = []
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , (α to n)^ + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ∀ n0. ⌜n0⌝ < #(α to n) → (α to n)[n0] = τ
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , [] + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. ⌜n0⌝ < #(α to n) → (α to n)[n0] = τ ⊦
Used terms: α to n
| ∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = [] |
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , (α to n)^ + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ ∀ n0. ⌜n0⌝ < #(α to n) → (α to n)[n0] = τ |
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , (α to n)^ + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n0] ≠ τ, α[n] ≠ τ, n0 < n, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s)
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , (α to n)^ + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n0] ≠ τ, α[n] ≠ τ, n0 < n, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ |
Used terms: n0
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , [] + ⌜α[n] '⌝ + ⌜al0⌝ ≠ ⌜((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n] '⌝ + ⌜al0⌝ , α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. ⌜n0⌝ < #(α to n) → (α to n)[n0] = τ ⊦ |
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, α[n] ≠ ((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n], ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. n0 < n → α[n0] = τ ⊦
Used simplifier rules: m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ a ' + x = b ' + x ↔ a = b; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜x0⌝ + ⌜z⌝ ↔ x + y = x0 + z; (s) ⊦ [] + σ = σ; (s)
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, α[n] ≠ ((((α to n) + ⌜α[n] '⌝ ) + α1) + α2)[n], ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. n0 < n → α[n0] = τ ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, α[n] ≠ (((α to n) + ⌜α[n] '⌝ ) + α1)[n], ⌜n⌝ < # α, ⌜n⌝ < #(((α to n) + ⌜α[n] '⌝ ) + α1), ∀ n0. n0 < n → α[n0] = τ, ∀ m. m < n → α[m] = τ ⊦
Used simplifier rules: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ¬ 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 Used terms: n, α2, ((α to n) + ⌜α[n] '⌝ ) + α1
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, α[n] ≠ (((α to n) + ⌜α[n] '⌝ ) + α1)[n], ⌜n⌝ < # α, ⌜n⌝ < #(((α to n) + ⌜α[n] '⌝ ) + α1), ∀ n0. n0 < n → α[n0] = τ, ∀ m. m < n → α[m] = τ ⊦ |
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, α[n] ≠ (((α to n) + ⌜α[n] '⌝ ) + α1)[n], ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. n0 < n → α[n0] = τ ⊦
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∞ + n∞1 < n∞1; (s) ⊦ ⌜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) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s)
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, α[n] ≠ (((α to n) + ⌜α[n] '⌝ ) + α1)[n], ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. n0 < n → α[n0] = τ ⊦ |
⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]
α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, α[n] ≠ ((α to n) + ⌜α[n] '⌝ )[n], ⌜n⌝ < # α, ⌜n⌝ < #((α to n) + ⌜α[n] '⌝ ), ∀ n0. n0 < n → α[n0] = τ, ∀ m. m < n → α[m] = τ ⊦
Used simplifier rules: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]; (s) ⊦ ⌜n⌝ ≠ ∞; (s) n∞ ≠ ∞ ⊦ (⌜m⌝ + n∞).n = m + n∞.n; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (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, α1, (α to n) + ⌜α[n] '⌝
| ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m] |
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , α[n] ≠ τ, α[n] ≠ ((α to n) + ⌜α[n] '⌝ )[n], ⌜n⌝ < # α, ⌜n⌝ < #((α to n) + ⌜α[n] '⌝ ), ∀ n0. n0 < n → α[n0] = τ, ∀ m. m < n → α[m] = τ ⊦ |
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, α[n] ≠ ((α to n) + ⌜α[n] '⌝ )[n], ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. n0 < n → α[n0] = τ ⊦
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 < n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, α[n] ≠ τ, α[n] ≠ ((α to n) + ⌜α[n] '⌝ )[n], ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ, ∀ n0. n0 < n → α[n0] = τ ⊦ |
⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]
Used simplifier rules: ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ m - m = 0; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ a '[0] = a; (s) ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (s) Used terms: n, ⌜α[n] '⌝ , α to n
| ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n] |
| α1 + α2 = α from n + 1, (α1 + α2)^ = ⌜al0⌝ + α2 ^, α1 ^ = ⌜al0⌝ , ((α to n + 1) + α1) + α2 ≠ α, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ |
⊦ (σ + σ1) + σ2 = σ + σ1 + σ2
α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, (α to n + 1) + α1 + α2 ≠ α, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦
Used terms: α2, α1, α to n + 1
| ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2 |
| α1 + α2 = α from n + 1, α1 ^ = ⌜al0⌝ , (α1 + α2)^ = ⌜al0⌝ + α2 ^, (α to n + 1) + α1 + α2 ≠ α, α[n] ≠ τ, ⌜n⌝ < # α, ∀ m. m < n → α[m] = τ ⊦ |
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 ⊦ # σ < ⌜n⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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 ¬ # σ < ⌜n⌝ ⊦ (σ to n) + (σ from n) = σ ↔ true; (ss) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]
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.