| alexec(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = al to n |
alli[n] ≠ al to n, n < # alli, alexec(can(tP))(⌜alli⌝ , ⌜al⌝ ) ⊦
| alli[n] ≠ al to n, n < # alli, alexec(can(tP))(⌜alli⌝ , ⌜al⌝ ) ⊦ |
hd(alli) = [], alli[n] ≠ al to n, alli ≠ [], n < # alli, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ) ⊦
Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ alexec(ALIOAut(startf, stepf))(σ, β) ↔ alfrag(ALIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)
| hd(alli) = [], alli[n] ≠ al to n, alli ≠ [], n < # alli, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ) ⊦ |
al2 = [], alli = al2 + alli0, alli[n] ≠ al to n, alli ≠ [], n < # alli, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ) ⊦
Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: alli, al2, alli0
| al2 = [], alli = al2 + alli0, alli[n] ≠ al to n, alli ≠ [], n < # alli, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ) ⊦ |
([] ' + alli0)[n] ≠ al to n, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), n ≤ # alli0 ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) 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[can-inst-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s)
| ([] ' + alli0)[n] ≠ al to n, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), n ≤ # alli0 ⊦ |
([] ' + alli0)[n0 +1] ≠ al to n0 +1, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), n0 +1 ≤ # alli0, ∀ alli0, al, tP. ¬ ( ([] ' + alli0)[n0] ≠ al to n0 ∧ alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ∧ n0 ≤ # alli0) ⊦
Used simplifier rules: nat freely generated by 0, +1;; ⊦ (a ' + x)[0] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ x to 0 = []; (s)
| ([] ' + alli0)[n0 +1] ≠ al to n0 +1, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), n0 +1 ≤ # alli0, ∀ alli0, al, tP. ¬ ( ([] ' + alli0)[n0] ≠ al to n0 ∧ alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ∧ n0 ≤ # alli0) ⊦ |
alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), ∀ alli, al0, tP0. ([] ' + alli)[n0] = al0 to n0 ∨ ¬ alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP0(⌜al0⌝ ) ∧ tP0(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ) ∨ ¬ n0 ≤ # alli ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (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) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ (a ' + x)[n + 1] = x[n]; (s)
| alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), ∀ alli, al0, tP0. ([] ' + alli)[n0] = al0 to n0 ∨ ¬ alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP0(⌜al0⌝ ) ∧ tP0(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ) ∨ ¬ n0 ≤ # alli ⊦ |
alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), ([] ' + alli0)[n0] = al to n0 ∨ ¬ alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ∨ ¬ n0 ≤ # alli0 ⊦
Used terms: alli0, al, tP
| alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), ([] ' + alli0)[n0] = al to n0 ∨ ¬ alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ∨ ¬ n0 ≤ # alli0 ⊦ |
([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ⊦
Used simplifier rules: ⊦ m < n → m ≤ n; (s)
| ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ⊦ |
m < # x ⊦ x to m + 1 = (x to m) + x[m] '
([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), ¬ n0 < # al ⊦
([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', alli0 ≠ [], n0 < # alli0, n0 < # al, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ⊦
Used terms: n0, al
| m < # x ⊦ x to m + 1 = (x to m) + x[m] ' |
| ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), ¬ n0 < # al ⊦ |
([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, # al < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), # al ≤ n0 ⊦
Used simplifier rules: fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss)
| ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ al to n0 + 1, alli0 ≠ [], n0 < # alli0, # al < # alli0, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ), # al ≤ n0 ⊦ |
⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Used simplifier rules: ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m +1 = m + 1; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[can-inst-IOstatestream] ⊦ ⌜x⌝ [n] = x[n]; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat ⊦ # x = 0 ↔ x = []; (s) ⊦ m < n → ¬ n < m; (s) Used terms: ⌜al⌝ , ⌜[] '⌝ + ⌜alli0⌝ , λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ ), λ al. al = []
| ⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', alli0 ≠ [], n0 < # alli0, n0 < # al, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ⊦ |
([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', al ≠ [], alli0 ≠ [], n0 < # alli0, n0 < # al, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', al ≠ [], alli0 ≠ [], n0 < # alli0, n0 < # al, alfrag(ALIOAut(λ al. al = [], λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli0⌝ , ⌜al⌝ ) ⊦ |
⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
#(⌜[] '⌝ + ⌜alli0⌝ ) = # ⌜al⌝ + ⌜1⌝ , ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', al ≠ [], alli0 ≠ [], n0 < # al, n0 < # alli0, ∀ n. ⌜n⌝ < # ⌜al⌝ → (⌜[] '⌝ + ⌜alli0⌝ )[n +1] = (⌜[] '⌝ + ⌜alli0⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli0⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli0⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ) ⊦
Used terms: ⌜al⌝ , ⌜[] '⌝ + ⌜alli0⌝ , λ al0, a, al1. al1 = al0 + a ' ∧ a ≠ τ ∧ tP(⌜al0⌝ ) ∧ tP(⌜al0⌝ + ⌜a '⌝ ), λ al. al = []
| ⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])) |
| #(⌜[] '⌝ + ⌜alli0⌝ ) = # ⌜al⌝ + ⌜1⌝ , ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', al ≠ [], alli0 ≠ [], n0 < # al, n0 < # alli0, ∀ n. ⌜n⌝ < # ⌜al⌝ → (⌜[] '⌝ + ⌜alli0⌝ )[n +1] = (⌜[] '⌝ + ⌜alli0⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli0⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli0⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ) ⊦ |
# alli0 = # al, ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', al ≠ [], alli0 ≠ [], n0 < # al, ∀ n. n < # al → alli0[n] = ([] ' + alli0)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜([] ' + alli0)[n]⌝ ) ∧ tP(⌜([] ' + alli0)[n]⌝ + ⌜al[n] '⌝ ) ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[can-inst-IOstatestream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (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⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| # alli0 = # al, ([] ' + alli0)[n0] = al to n0, alli0[n0] ≠ (al to n0) + al[n0] ', al ≠ [], alli0 ≠ [], n0 < # al, ∀ n. n < # al → alli0[n] = ([] ' + alli0)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜([] ' + alli0)[n]⌝ ) ∧ tP(⌜([] ' + alli0)[n]⌝ + ⌜al[n] '⌝ ) ⊦ |
Used simplifier rules: in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[actionstream] a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] 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.