[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof lemma-2-8-1-b (conclusion) (back to tree)

traceprop(tP) ⊦ forest(can(tP), λ al. tP(⌜al⌝ ))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof lemma-2-8-1-b (previous step) (back to tree)

traceprop(tP), ¬ forest(can(tP), λ al. tP(⌜al⌝ )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 3 from proof lemma-2-8-1-b (previous step) (back to tree)

traceprop(tP), ¬ forest(ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )), λ al. tP(⌜al⌝ )) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: restricted[can-inst], name:forest-relative, seq:⊦ forest(ALIOAut(startf, stepf), isstate) ↔ (∀ s2. isstate(s2) → (∃ α, sl. alexec*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. alexec*(ALIOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ alexec*(ALIOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2)), subst:[isstate, stepf, startf] → [λ al. tP(⌜al⌝ ), λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []], <all paths>

Additional information

Used terms: λ al. tP(⌜al⌝ ), λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []

Proof step 4 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ forest(ALIOAut(startf, stepf), isstate) ↔ (∀ s2. isstate(s2) → (∃ α, sl. alexec*(ALIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. alexec*(ALIOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ alexec*(ALIOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2))

A spec-lemma

Proof step 5 from proof lemma-2-8-1-b (previous step) (back to tree)

traceprop(tP), ∃ s2. ¬ ( tP(⌜s2⌝ ) → (∃ α, sl. alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ s2 = sl.last) ∧ (∀ α1, sl1, α2, sl2. alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl1⌝ , α1) ∧ alexec*(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last → α1 = α2 ∧ sl1 = sl2)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ alexec(ALIOAut(startf, stepf))(σ, β) ↔ alfrag(ALIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ alexec*(ALIOAut(startf, stepf))(σ, β) ↔ alexec(ALIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 6 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜al⌝ ), traceprop(tP) ⊦ (∃ α, sl. alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ sl[0] = [] ∧ finp(α) ∧ al = sl.last) ∧ ( alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , aσ) ∧ alli[0] = [] ∧ finp(aσ) ∧ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , aσ0) ∧ alli0[0] = [] ∧ finp(aσ0) ∧ alli0.last = alli.last ∧ al = alli0.last → aσ = aσ0 ∧ alli = alli0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 7 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜al⌝ ), traceprop(tP) ⊦ ∃ α, sl. alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜sl⌝ , α) ∧ sl[0] = [] ∧ finp(α) ∧ al = sl.last

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al⌝ , (⌜λ m. al to m⌝ to # al + 1).l abort: F discard: T computed: F

Additional information

Used terms: ⌜al⌝ , (⌜λ m. al to m⌝ to # al + 1).l

Proof step 8 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ))) (⌜(⌜λ m. al to m⌝ to # al + 1).l⌝ , ⌜al⌝ ) ∧ (⌜λ m. al to m⌝ to # al + 1).l[0] = [] ∧ finp(⌜al⌝ ) ∧ al = (⌜λ m. al to m⌝ to # al + 1).l.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ .l = x; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ x to 0 = []; (s) m < n ⊦ (nf to n)[m] = nf(m); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ 0 < m ↔ m ≠ 0; (s)

Proof step 9 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜(λ m. al to m) to # al + 1⌝ , ⌜al⌝ ) ∧ al = ((λ m. al to m) to # al + 1).last

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[can-inst-IOstatestream], name:to-unwind-end-inf, seq: ⊦ nf to m + 1 = (nf to m) + nf(m) ', subst:[m, nf] → [# al, λ m. al to m], <all paths>

Additional information

Used terms: # al, λ m. al to m

Proof step 10 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ nf to m + 1 = (nf to m) + nf(m) '

A spec-lemma

Proof step 11 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜al⌝ ), traceprop(tP) ⊦ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ))) (⌜((λ m. al to m) to # al) + (al to # al)'⌝ , ⌜al⌝ ) ∧ al = (((λ m. al to m) to # al) + (al to # al)').last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ (x + a ').last = a; (s) ⊦ x to # x = x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 12 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜al⌝ ), traceprop(tP), ¬ alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ , ⌜al⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[can-inst], name:frag, seq:⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ , ⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []

Proof step 13 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 14 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜al⌝ ), traceprop(tP), #(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ ) ≠ # ⌜al⌝ + ⌜1⌝ ∨ (∃ n. ¬ ( ⌜n⌝ < # ⌜al⌝ → (⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n +1] = (⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n]⌝ ) ∧ tP(⌜(⌜(λ m. al to m) to # al⌝ + ⌜al '⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (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) ⊦ 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) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 15 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ (((λ m. al to m) to # al) + al ')[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [n + 1, al ', (λ m. al to m) to # al], <all paths>

Additional information

Used terms: n + 1, al ', (λ m. al to m) to # al

Proof step 16 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 17 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, tP(⌜al⌝ ), traceprop(tP), ¬ n + 1 < #((λ m. al to m) to # al) ⊦ (((λ m. al to m) to # al) + al ')[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m + 1 ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)

Proof step 18 from proof lemma-2-8-1-b (previous step) (back to tree)

# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ (((λ m. al to m) to n + 1) + al ')[n + 1] = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[n, y, x] → [n + 1, al ', (λ m. al to m) to n + 1], <all paths>

Additional information

Used simplifier rules: ⊦ #(nf to n) = n; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n + 1, al ', (λ m. al to m) to n + 1

Proof step 19 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 20 from proof lemma-2-8-1-b (previous step) (back to tree)

# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP), ¬ n + 1 < #((λ m. al to m) to n + 1) ⊦ al '[n + 1 - #((λ m. al to m) to n + 1)] = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a '[0] = a; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m - m = 0; (s) ⊦ m + n - n + n1 = m - n1; (s) ⊦ #(nf to n) = n; (s) ⊦ m + n < m + n0 ↔ n < n0; (s)

Proof step 21 from proof lemma-2-8-1-b (previous step) (back to tree)

# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ al = (((λ m. al to m) to n + 1) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to n + 1) + al ')[n]⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [n, al ', (λ m. al to m) to n + 1], <all paths>

Additional information

Used simplifier rules: ⊦ #(nf to n) = n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n, al ', (λ m. al to m) to n + 1

Proof step 22 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 23 from proof lemma-2-8-1-b (previous step) (back to tree)

# al = n + 1, al ≠ [], n < #((λ m. al to m) to n + 1), tP(⌜al⌝ ), traceprop(tP) ⊦ al = ((λ m. al to m) to n + 1)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜((λ m. al to m) to n + 1)[n]⌝ ) ∧ tP(⌜((λ m. al to m) to n + 1)[n]⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ #(nf to n) = n; (s)

Proof step 24 from proof lemma-2-8-1-b (previous step) (back to tree)

# al = n + 1, al ≠ [], tP(⌜al⌝ ), traceprop(tP) ⊦ al = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:elim-fromto-fin, seq: ⊦ ¬ # x < n → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n), subst:[x, n, x0, x1] → [al, n, x0, x1]

Additional information

Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ 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 ⊦ ¬ # x < n → (x0 = x to n ∧ x1 = x from n ↔ x = x0 + x1 ∧ # x0 = n); (elim) Used terms: al, n, al0, al1

Proof step 25 from proof lemma-2-8-1-b (previous step) (back to tree)

# al = n + 1, # x0 = n, al = x0 + x1, al ≠ [], tP(⌜al⌝ ), traceprop(tP), ¬ # al < n ⊦ al = x0 + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ x + y = x + z ↔ y = z; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ #(x + y) = # x + # y; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)

Proof step 26 from proof lemma-2-8-1-b (previous step) (back to tree)

# x1 = 1, x0 + x1 ≠ [], tP(⌜x0⌝ + ⌜x1⌝ ), traceprop(tP) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: traceprop, name:traceprop-def, seq: ⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP), subst:[tP] → [tP], <all paths>

Additional information

Used terms: tP

Proof step 27 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP)

A spec-lemma

Proof step 28 from proof lemma-2-8-1-b (previous step) (back to tree)

# x1 = 1, x0 + x1 ≠ [], prefix-closed(tP), tP(⌜x0⌝ + ⌜x1⌝ ), ∀ α. tP(α) → ext(α), ∃ α. tP(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 29 from proof lemma-2-8-1-b (previous step) (back to tree)

# x1 = 1, x0 + x1 ≠ [], prefix-closed(tP), tP(aσ), tP(⌜x0⌝ + ⌜x1⌝ ), ∀ α. tP(α) → ext(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: x1

Additional information

Used simplifier rules: actionlist freely generated by [], +;; ⊦ # [] = 0; (s)

Proof step 30 from proof lemma-2-8-1-b (previous step) (back to tree)

# x1 = 1, x1 = a0 + x, x0 + x1 ≠ [], prefix-closed(tP), tP(⌜x0⌝ + ⌜x1⌝ ), tP(aσ), ∀ α. tP(α) → ext(α) ⊦ x1 = (x0 + x1)[# x0] ' ∧ (x0 + x1)[# x0] ≠ τ ∧ tP(⌜x0⌝ ) ∧ tP(⌜x0⌝ + ⌜(x0 + x1)[# x0] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ + [] = σ; (s) ⊦ ⌜[]⌝ = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (x + a ' + y)[# x] = a; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ x + a ' + y ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ 1 = m + 1 ↔ m = 0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)

Proof step 31 from proof lemma-2-8-1-b (previous step) (back to tree)

prefix-closed(tP), tP(aσ), tP(⌜x0⌝ + ⌜a0 '⌝ ), ∀ α. tP(α) → ext(α) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: traceprop, name:prefix-closed-def, seq: ⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2)), subst:[tP] → [tP], <all paths>

Additional information

Used terms: tP

Proof step 32 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2))

A spec-lemma

Proof step 33 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜x0⌝ + ⌜a0 '⌝ ), tP(aσ), ∀ α. tP(α) → ext(α), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ )

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: ⌜x0⌝ + ⌜a0 '⌝ , ⌜x0⌝ abort: F discard: F computed: T

Additional information

Used terms: ⌜x0⌝ + ⌜a0 '⌝ , ⌜x0⌝

Proof step 34 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(aσ), tP(⌜x0⌝ + ⌜a0 '⌝ ), tP(⌜x0⌝ + ⌜a0 '⌝ ) ∧ ⌜x0⌝ ≤ ⌜x0⌝ + ⌜a0 '⌝ → tP(⌜x0⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ α. tP(α) → ext(α) ⊦ a0 ≠ τ ∧ tP(⌜x0⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ σ1 ≤ σ1 + σ2; (s)

Proof step 35 from proof lemma-2-8-1-b (previous step) (back to tree)

tP(⌜x0⌝ ), tP(aσ), tP(⌜x0⌝ + ⌜τ '⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ α. tP(α) → ext(α) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: ⌜x0⌝ + ⌜τ '⌝

Additional information

Used simplifier rules: ⊦ ext(⌜al⌝ + α) ↔ ext(al) ∧ ext(α); (ws) ⊦ ext(⌜al⌝ ) ↔ ext(al); (s) ⊦ ext(a ') ↔ ext(a); (s) ⊦ ext(a) ↔ a ≠ τ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: ⌜x0⌝ + ⌜τ '⌝

Proof step 36 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, n + 1 < #((λ m. al to m) to # al), tP(⌜al⌝ ), traceprop(tP) ⊦ ((λ m. al to m) to # al)[n + 1] = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (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 eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)

Proof step 37 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, n + 1 < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = (((λ m. al to m) to # al) + al ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ ) ∧ tP(⌜(((λ m. al to m) to # al) + al ')[n]⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [n, al ', (λ m. al to m) to # al], <all paths>

Additional information

Used simplifier rules: ⊦ #(nf to n) = n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) Used terms: n, al ', (λ m. al to m) to # al

Proof step 38 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ n < # x → (x + y)[n] = x[n]

A spec-lemma

Proof step 39 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n + 1 < # al, n < # al, n < #((λ m. al to m) to # al), tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = ((λ m. al to m) to # al)[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜((λ m. al to m) to # al)[n]⌝ ) ∧ tP(⌜((λ m. al to m) to # al)[n]⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)

Proof step 40 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al to n + 1 = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-unwind-end-fin, seq:m < # x ⊦ x to m + 1 = (x to m) + x[m] ', subst:[m, x] → [n, al], <all paths>

Additional information

Used terms: n, al

Proof step 41 from proof lemma-2-8-1-b (previous step) (back to tree)

m < # x ⊦ x to m + 1 = (x to m) + x[m] '

A spec-lemma

Proof step 42 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ (al to n) + al[n] ' = (al to n) + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 43 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, n + 1 < # al, tP(⌜al⌝ ), traceprop(tP) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: traceprop, name:traceprop-def, seq: ⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP), subst:[tP] → [tP], <all paths>

Additional information

Used terms: tP

Proof step 44 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ traceprop(tP) ↔ (∀ α. tP(α) → ext(α)) ∧ (∃ α. tP(α)) ∧ prefix-closed(tP)

A spec-lemma

Proof step 45 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n + 1 < # al, n < # al, prefix-closed(tP), tP(⌜al⌝ ), ∀ α. tP(α) → ext(α), ∃ α. tP(α) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 46 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, n + 1 < # al, prefix-closed(tP), tP(aσ), tP(⌜al⌝ ), ∀ α. tP(α) → ext(α) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: traceprop, name:prefix-closed-def, seq: ⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2)), subst:[tP] → [tP], <all paths>

Additional information

Used terms: tP

Proof step 47 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ prefix-closed(tP) ↔ (∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2))

A spec-lemma

Proof step 48 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α. tP(α) → ext(α), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: ⌜al⌝ abort: F discard: T computed: T

Additional information

Used terms: ⌜al⌝

Proof step 49 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), tP(⌜al⌝ ) → ext(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ext(⌜al⌝ ) ↔ ext(al); (s)

Proof step 50 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n + 1 < # al, n < # al, ext(al), tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: ext, name:ext-list-def, seq: ⊦ ext(al) ↔ (∀ n. n < # al → ext(al[n])), subst:[al] → [al], <all paths>

Additional information

Used terms: al

Proof step 51 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ ext(al) ↔ (∀ n. n < # al → ext(al[n]))

A spec-lemma

Proof step 52 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ n. n < # al → ext(al[n]) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ext(a) ↔ a ≠ τ; (s)

Proof step 53 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2), ∀ n0. n0 < # al → al[n0] ≠ τ ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: n abort: F discard: T computed: T

Additional information

Used terms: n

Proof step 54 from proof lemma-2-8-1-b (previous step) (back to tree)

al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), n < # al → al[n] ≠ τ, ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ al[n] ≠ τ ∧ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 55 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: ⌜al⌝ , ⌜al to n⌝ abort: F discard: F computed: T

Additional information

Used terms: ⌜al⌝ , ⌜al to n⌝

Proof step 56 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), tP(⌜al⌝ ) ∧ ⌜al to n⌝ ≤ ⌜al⌝ → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 57 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ⌜al to n⌝ ≤ ⌜al⌝ → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:prefix-def, seq: ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2), subst:[σ2, σ1] → [⌜al⌝ , ⌜al to n⌝ ], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜al to n⌝

Proof step 58 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)

A spec-lemma

Proof step 59 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), (∃ σ. ⌜al to n⌝ + σ = ⌜al⌝ ) → tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 60 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ ∃ σ. ⌜al to n⌝ + σ = ⌜al⌝ , tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al from n⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜al from n⌝

Proof step 61 from proof lemma-2-8-1-b (previous step) (back to tree)

⌜al to n⌝ + ⌜al from n⌝ ≠ ⌜al⌝ , al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(aσ), tP(⌜al⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)

Proof step 62 from proof lemma-2-8-1-b (previous step) (back to tree)

(al to n) + (al from n) ≠ al, al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-plus-from-fin, seq: ⊦ n ≤ # x → (x to n) + (x from n) = x, subst:[n, x] → [n, al], <all paths>

Additional information

Used simplifier rules: ⊦ m < n → m ≤ n; (s) Used terms: n, al

Proof step 63 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ n ≤ # x → (x to n) + (x from n) = x

A spec-lemma

Proof step 64 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦ tP(⌜al to n⌝ ) ∧ tP(⌜al to n⌝ + ⌜al[n] '⌝ )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 65 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ∀ α1, α2. tP(α1) ∧ α2 ≤ α1 → tP(α2) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: ⌜al⌝ , ⌜al to n + 1⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜al⌝ , ⌜al to n + 1⌝

Proof step 66 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), tP(⌜al⌝ ) ∧ ⌜al to n + 1⌝ ≤ ⌜al⌝ → tP(⌜al to n + 1⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 67 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ⌜al to n + 1⌝ ≤ ⌜al⌝ → tP(⌜al to n + 1⌝ ) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 68 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ¬ ⌜al to n + 1⌝ ≤ ⌜al⌝ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:prefix-def, seq: ⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2), subst:[σ2, σ1] → [⌜al⌝ , ⌜al to n + 1⌝ ], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜al to n + 1⌝

Proof step 69 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ σ1 ≤ σ2 ↔ (∃ σ. σ1 + σ = σ2)

A spec-lemma

Proof step 70 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ), ∀ σ. ⌜al to n + 1⌝ + σ ≠ ⌜al⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: ⌜al from n + 1⌝ abort: F discard: T computed: F

Additional information

Used terms: ⌜al from n + 1⌝

Proof step 71 from proof lemma-2-8-1-b (previous step) (back to tree)

⌜al to n + 1⌝ + ⌜al from n + 1⌝ ≠ ⌜al⌝ , al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)

Proof step 72 from proof lemma-2-8-1-b (previous step) (back to tree)

(al to n + 1) + (al from n + 1) ≠ al, al[n] ≠ τ, al ≠ [], n < # al, n + 1 < # al, tP(⌜al to n⌝ ), tP(aσ), tP(⌜al⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-plus-from-fin, seq: ⊦ n ≤ # x → (x to n) + (x from n) = x, subst:[n, x] → [n + 1, al], <all paths>

Additional information

Used simplifier rules: ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n + 1, al

Proof step 73 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ n ≤ # x → (x to n) + (x from n) = x

A spec-lemma

Proof step 74 from proof lemma-2-8-1-b (previous step) (back to tree)

al[n] ≠ τ, al ≠ [], n + 1 < # al, n < # al, tP(⌜al⌝ ), tP(aσ), tP(⌜al to n⌝ ), tP(⌜al to n + 1⌝ ), ¬ tP(⌜al to n⌝ + ⌜al[n] '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-unwind-end-fin, seq:m < # x ⊦ x to m + 1 = (x to m) + x[m] ', subst:[m, x] → [n, al], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] Used terms: n, al

Proof step 75 from proof lemma-2-8-1-b (previous step) (back to tree)

m < # x ⊦ x to m + 1 = (x to m) + x[m] '

A spec-lemma

Proof step 76 from proof lemma-2-8-1-b (previous step) (back to tree)

alli0.last = alli.last, alli[0] = [], alli0[0] = [], al = alli0.last, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , aσ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , aσ0), finp(aσ), finp(aσ0), tP(⌜al⌝ ), traceprop(tP) ⊦ aσ = aσ0 ∧ alli = alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream]

Proof step 77 from proof lemma-2-8-1-b (previous step) (back to tree)

alli0.last = alli.last, alli0[0] = [], alli[0] = [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag-lem, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n), subst:[tP, alli, al, n] → [tP, alli, al, # alli - 1]

Additional information

Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ m < 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: tP, alli, al, # alli - 1

Proof step 78 from proof lemma-2-8-1-b (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n)

Lemma frag-lem

Proof step 79 from proof lemma-2-8-1-b (previous step) (back to tree)

alli0.last = alli.last, alli[0] = [], alli0[0] = [], alli[# alli - 1] = alli[0] + (al to (# alli - 1)), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ [] + x = x; (s)

Proof step 80 from proof lemma-2-8-1-b (previous step) (back to tree)

alli0.last = alli.last, alli[0] = [], alli0[0] = [], alli[# alli - 1] = al to (# alli - 1), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [# alli, n0]

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # alli, m

Proof step 81 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = n0 + 1, alli0.last = alli.last, alli[n0] = al to n0, alli0[0] = [], alli[0] = [], # alli ≠ 0, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s)

Proof step 82 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = n0 + 1, alli0.last = alli.last, alli0[0] = [], alli[n0] = al to n0, hd(alli) = [], alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[can-inst-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [alli, al1, alli1]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: alli, al1, alli1

Proof step 83 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = n0 + 1, alli0.last = alli.last, alli[n0] = al to n0, alli0[0] = [], al1 = [], alli = al1 + alli1, alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli⌝ , ⌜al⌝ ), tP(⌜alli.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli = alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ 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 = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)

Proof step 84 from proof lemma-2-8-1-b (previous step) (back to tree)

alli0.last = ([] ' + alli1).last, ([] ' + alli1)[# alli1] = al to # alli1, alli0[0] = [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag-lem, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n), subst:[tP, alli, al, n] → [tP, alli0, al0, # alli0 - 1]

Additional information

Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ m < 1 ↔ m = 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: tP, alli0, al0, # alli0 - 1

Proof step 85 from proof lemma-2-8-1-b (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), n < # alli ⊦ alli[n] = alli[0] + (al to n)

Lemma frag-lem

Proof step 86 from proof lemma-2-8-1-b (previous step) (back to tree)

alli0.last = ([] ' + alli1).last, alli0[0] = [], ([] ' + alli1)[# alli1] = al to # alli1, alli0[# alli0 - 1] = alli0[0] + (al0 to (# alli0 - 1)), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ [] + x = x; (s)

Proof step 87 from proof lemma-2-8-1-b (previous step) (back to tree)

alli0.last = ([] ' + alli1).last, alli0[0] = [], ([] ' + alli1)[# alli1] = al to # alli1, alli0[# alli0 - 1] = al0 to (# alli0 - 1), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [# alli0, n0]

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ alfrag(ALIOAut(startf, stepf))([], α); (s) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: # alli0, m

Proof step 88 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, alli0[n0] = al0 to n0, ([] ' + alli1)[# alli1] = al to # alli1, alli0[0] = [], # alli0 ≠ 0, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → x[0] = hd(x); (s) ⊦ # x = 0 ↔ x = []; (s)

Proof step 89 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, ([] ' + alli1)[# alli1] = al to # alli1, alli0[n0] = al0 to n0, hd(alli0) = [], alli0 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[can-inst-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [alli0, al1, alli]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: alli0, al1, alli

Proof step 90 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli0 = n0 + 1, alli0.last = ([] ' + alli1).last, alli0[n0] = al0 to n0, ([] ' + alli1)[# alli1] = al to # alli1, al1 = [], alli0 = al1 + alli, alli0 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜alli0⌝ , ⌜al0⌝ ), tP(⌜alli0.last⌝ ), traceprop(tP) ⊦ al = al0 ∧ [] ' + alli1 = alli0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ' + x = a ' + y ↔ x = y; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ 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 = m + n0 ↔ n = n0; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)

Proof step 91 from proof lemma-2-8-1-b (previous step) (back to tree)

([] ' + alli).last = ([] ' + alli1).last, ([] ' + alli)[# alli] = al0 to # alli, ([] ' + alli1)[# alli1] = al to # alli1, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜([] ' + alli1).last⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli1 = alli

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[can-inst-IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [[] ' + alli1, al1, alli0]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: [] ' + alli1, al1, alli0

Proof step 92 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli1 = alli0 + al1 ', ([] ' + alli).last = al1, ([] ' + alli1)[# alli1] = al to # alli1, ([] ' + alli)[# alli] = al0 to # alli, [] ' + alli1 ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP) ⊦ al = al0 ∧ alli1 = alli

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a ' + x ≠ []; (s)

Proof step 93 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli1 = alli0 + ([] ' + alli).last ', ([] ' + alli1)[# alli1] = al to # alli1, ([] ' + alli)[# alli] = al0 to # alli, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜([] ' + alli).last⌝ ), traceprop(tP), [] ∈ alli0 ∨ [] = ([] ' + alli).last, ([] ' + alli).last = [] ∨ ([] ' + alli).last ∈ alli1 ⊦ al = al0 ∧ alli1 = alli

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[can-inst-IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [[] ' + alli, al1, alli2]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: [] ' + alli, al1, alli2

Proof step 94 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', ([] ' + alli)[# alli] = al0 to # alli, ([] ' + alli1)[# alli1] = al to # alli1, [] ' + alli ≠ [], alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1 ⊦ al = al0 ∧ alli1 = alli

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a ' + x ≠ []; (s)

Proof step 95 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al0 to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦ al = al0 ∧ alli1 = alli

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: al0 = al

Additional information

Used formulas: al0 = al

Proof step 96 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 = al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ al = al0 ∧ alli1 = alli

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 97 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, alli1 ≠ alli, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag-det, seq:alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), alfrag(can(tP))(⌜alli0⌝ , ⌜al⌝ ), alli[0] = alli0[0] ⊦ alli = alli0, subst:[tP, alli, al, alli0] → [tP, [] ' + alli1, al, [] ' + alli]

Additional information

Used simplifier rules: canonical-def: ⊦ can(tP) = ALIOAut(λ al. al = [], λ al, a, al1. al1 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al1⌝ )); ⊦ a ' + x = a ' + y ↔ x = y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (a ' + x)[0] = a; (s) Used terms: tP, [] ' + alli1, al, [] ' + alli

Proof step 98 from proof lemma-2-8-1-b (previous step) (back to tree)

alfrag(can(tP))(⌜alli⌝ , ⌜al⌝ ), alfrag(can(tP))(⌜alli0⌝ , ⌜al⌝ ), alli[0] = alli0[0] ⊦ alli = alli0

Lemma frag-det

Proof step 99 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦ al = al0 ∧ alli1 = alli

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 100 from proof lemma-2-8-1-b (previous step) (back to tree)

[] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# alli] = al0 to # alli, (alli0 + al1 ')[# alli1] = al to # alli1, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli⌝ , ⌜al0⌝ ), alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[can-inst], name:frag, seq:⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al0⌝ , ⌜[] '⌝ + ⌜alli⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []], <all paths>

Additional information

Used terms: ⌜al0⌝ , ⌜[] '⌝ + ⌜alli⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []

Proof step 101 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 102 from proof lemma-2-8-1-b (previous step) (back to tree)

#(⌜[] '⌝ + ⌜alli⌝ ) = # ⌜al0⌝ + ⌜1⌝ , [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# alli] = al0 to # alli, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), ∀ n. ⌜n⌝ < # ⌜al0⌝ → (⌜[] '⌝ + ⌜alli⌝ )[n +1] = (⌜[] '⌝ + ⌜alli⌝ )[n] + ⌜al0⌝ [n] ' ∧ ⌜al0⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli⌝ )[n]⌝ + ⌜⌜al0⌝ [n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜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) ⊦ # x = n → x to n = 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)

Proof step 103 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = # al0, [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli0 + al1 ')[# alli1] = al to # alli1, (alli2 + al1 ')[# al0] = al0, al0 ≠ al, alfrag(ALIOAut(λ al. al = [], λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ )))(⌜[] '⌝ + ⌜alli1⌝ , ⌜al⌝ ), tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[can-inst], name:frag, seq:⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ , ⌜[] '⌝ + ⌜alli1⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜[] '⌝ + ⌜alli1⌝ , λ al, a, al0. al0 = al + a ' ∧ a ≠ τ ∧ tP(⌜al⌝ ) ∧ tP(⌜al⌝ + ⌜a '⌝ ), λ al. al = []

Proof step 104 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ alfrag(ALIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))

A spec-lemma

Proof step 105 from proof lemma-2-8-1-b (previous step) (back to tree)

#(⌜[] '⌝ + ⌜alli1⌝ ) = # ⌜al⌝ + ⌜1⌝ , # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli2 + al1 ')[# al0] = al0, (alli0 + al1 ')[# alli1] = al to # alli1, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. ⌜n⌝ < # ⌜al⌝ → (⌜[] '⌝ + ⌜alli1⌝ )[n +1] = (⌜[] '⌝ + ⌜alli1⌝ )[n] + ⌜al⌝ [n] ' ∧ ⌜al⌝ [n] ≠ τ ∧ tP(⌜(⌜[] '⌝ + ⌜alli1⌝ )[n]⌝ ) ∧ tP(⌜(⌜[] '⌝ + ⌜alli1⌝ )[n]⌝ + ⌜⌜al⌝ [n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜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) ⊦ # x = n → x to n = 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)

Proof step 106 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = # al0, # alli1 = # al, [] ' + alli1 = alli0 + al1 ', [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (alli0 + al1 ')[# al] = al, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), al1 = [] ∨ al1 ∈ alli1, [] ∈ alli0 ∨ [] = al1, [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: alli0

Additional information

Used simplifier rules: actionlistlist freely generated by [], +;;

Proof step 107 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli1 = # al, # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, alli0 = [], al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a '[0] = a; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ ⌜[]⌝ = []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)

Proof step 108 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = # al0, [] ' + alli = alli2 + [] ', (alli2 + [] ')[# al0] = al0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + [] ')[n]⌝ ) ∧ tP(⌜(alli2 + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: alli2

Additional information

Used simplifier rules: actionlistlist freely generated by [], +;; ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ # [] = 0; (s) ⊦ # x = 0 ↔ x = []; (s)

Proof step 109 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = # al0, [] ' + alli = alli2 + [] ', (alli2 + [] ')[# al0] = al0, alli2 = al1 + alli0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + [] ')[n]⌝ ) ∧ tP(⌜(alli2 + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 110 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli0 + 1 = # al0, (([] ' + alli0) + [] ')[# al0] = al0, al0 ≠ [], tP([]), traceprop(tP), ∀ n. n < # al0 → (alli0 + [] ')[n] = (([] ' + alli0) + [] ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + [] ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + [] ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[n, y, x] → [# al0, [] ', [] ' + alli0], <all paths>

Additional information

Used simplifier rules: ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al0, [] ', [] ' + alli0

Proof step 111 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 112 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli1 = # al, # alli = # al0, [] ' + alli = alli2 + al1 ', [] ' + alli1 = alli0 + al1 ', (alli0 + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, alli0 = al2 + alli3, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → alli1[n] = (alli0 + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(alli0 + al1 ')[n]⌝ ) ∧ tP(⌜(alli0 + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1, [] ∈ alli0 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 113 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = # al0, [] ' + alli = alli2 + al1 ', # alli3 + 1 = # al, (([] ' + alli3) + al1 ')[# al] = al, (alli2 + al1 ')[# al0] = al0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), al1 = [] ∨ al1 ∈ alli, [] ∈ alli2 ∨ [] = al1 ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: alli2

Additional information

Used simplifier rules: actionlistlist freely generated by [], +;;

Proof step 114 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = # al0, # alli3 + 1 = # al, [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, alli2 = [], al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ # [] = 0; (s) ⊦ a '[0] = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ # [] = 0; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)

Proof step 115 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli3 + 1 = # al, (([] ' + alli3) + [] ')[# al] = al, [] ≠ al, tP([]), traceprop(tP), ∀ n. n < # al → (alli3 + [] ')[n] = (([] ' + alli3) + [] ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + [] ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + [] ')[n]⌝ + ⌜al[n] '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[n, y, x] → [# al, [] ', [] ' + alli3], <all paths>

Additional information

Used simplifier rules: ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al, [] ', [] ' + alli3

Proof step 116 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 117 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli = # al0, # alli3 + 1 = # al, [] ' + alli = alli2 + al1 ', (alli2 + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, alli2 = al2 + alli0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → alli[n] = (alli2 + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(alli2 + al1 ')[n]⌝ ) ∧ tP(⌜(alli2 + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), [] ∈ alli2 ∨ [] = al1, al1 = [] ∨ al1 ∈ alli ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(x + y) = # x + # y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[can-inst-IOstatestream] ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x = b ' + y ↔ a = b ∧ x = y; (ws)

Proof step 118 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli3 + 1 = # al, # alli0 + 1 = # al0, (([] ' + alli0) + al1 ')[# al0] = al0, (([] ' + alli3) + al1 ')[# al] = al, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ∀ n. n < # al0 → (alli0 + al1 ')[n] = (([] ' + alli0) + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[n, y, x] → [# al0, al1 ', [] ' + alli0], <all paths>

Additional information

Used simplifier rules: ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al0, al1 ', [] ' + alli0

Proof step 119 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof step 120 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli0 + 1 = # al0, # alli3 + 1 = # al, (([] ' + alli3) + al1 ')[# al] = al, al1 '[# al0 - #([] ' + alli0)] = al0, al0 ≠ al, tP(⌜al1⌝ ), traceprop(tP), ¬ # al0 < #([] ' + alli0), ∀ n. n < # al → (alli3 + al1 ')[n] = (([] ' + alli3) + al1 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al1 ')[n]⌝ + ⌜al[n] '⌝ ), ∀ n. n < # al0 → (alli0 + al1 ')[n] = (([] ' + alli0) + al1 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al1 ')[n]⌝ + ⌜al0[n] '⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m ≤ m; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ a '[0] = a; (s) ⊦ m - m = 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s)

Proof step 121 from proof lemma-2-8-1-b (previous step) (back to tree)

# alli3 + 1 = # al, # alli0 + 1 = # al0, (([] ' + alli3) + al0 ')[# al] = al, al0 ≠ [], al0 ≠ al, # alli0 < # al0, tP(⌜al0⌝ ), traceprop(tP), ∀ n. n < # al0 → (alli0 + al0 ')[n] = (([] ' + alli0) + al0 ')[n] + al0[n] ' ∧ al0[n] ≠ τ ∧ tP(⌜(([] ' + alli0) + al0 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli0) + al0 ')[n]⌝ + ⌜al0[n] '⌝ ), ∀ n. n < # al → (alli3 + al0 ')[n] = (([] ' + alli3) + al0 ')[n] + al[n] ' ∧ al[n] ≠ τ ∧ tP(⌜(([] ' + alli3) + al0 ')[n]⌝ ) ∧ tP(⌜(([] ' + alli3) + al0 ')[n]⌝ + ⌜al[n] '⌝ ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[can-inst-IOstatestream], name:get-append-grt, seq: ⊦ ¬ n < # x → (x + y)[n] = y[n - # x], subst:[n, y, x] → [# al, al0 ', [] ' + alli3], <all paths>

Additional information

Used simplifier rules: ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[can-inst-IOstatestream] ⊦ m < n + 1 ↔ ¬ n < m; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ n < # x → (x + a ')[n] = x[n]; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m = n + 1 → ¬ m ≤ n; (s) Used terms: # al, al0 ', [] ' + alli3

Proof step 122 from proof lemma-2-8-1-b (previous step) (back to tree)

⊦ ¬ n < # x → (x + y)[n] = y[n - # x]

A spec-lemma

Proof Tree for lemma-2-8-1-b (View conclusion)

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.

the proof tree