[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_3-15 (conclusion) (back to tree)

bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0), aINV(as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof lemma_3-15 (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:move, seq:⊦ cmove(CIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. cfrag*(CIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, s2, startf, s1, β] → [cstepf, cs0, cstartf, cs, ⌜al⌝ ], <all paths>

Additional information

Used terms: cs0, ⌜al⌝ , cs, cstepf, cstartf

Proof step 3 from proof lemma_3-15 (previous step) (back to tree)

⊦ cmove(CIOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. cfrag*(CIOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)

A spec-lemma

Proof step 4 from proof lemma_3-15 (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), t(cs0, as0), ∃ α, sl. cfrag*(CIOAut(cstartf, cstepf))(⌜sl⌝ , α) ∧ cs = sl[0] ∧ cs0 = sl.last ∧ α ^ = ⌜al⌝ ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ cfrag*(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 5 from proof lemma_3-15 (previous step) (back to tree)

⌜al0⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al0⌝ ), t(csl.last, as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: al0

Additional information

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

Proof step 6 from proof lemma_3-15 (previous step) (back to tree)

⌜[]⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜[]⌝ ), t(csl.last, as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ [] ^ = []; (s)

Proof step 7 from proof lemma_3-15 (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , []), t(csl.last, as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag, seq:⊦ cfrag(CIOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [[], ⌜csl⌝ , cstepf, cstartf], <all paths>

Additional information

Used terms: [], ⌜csl⌝ , cstepf, cstartf

Proof step 8 from proof lemma_3-15 (previous step) (back to tree)

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

A spec-lemma

Proof step 9 from proof lemma_3-15 (previous step) (back to tree)

# ⌜csl⌝ = # [] + ⌜1⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), t(csl.last, as0), ∀ n. ⌜n⌝ < # [] → cstepf(⌜csl⌝ [n], [][n], ⌜csl⌝ [n +1]) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n < 0; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (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 c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 10 from proof lemma_3-15 (previous step) (back to tree)

# csl = 1, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), t(csl.last, as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl

Additional information

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

Proof step 11 from proof lemma_3-15 (previous step) (back to tree)

# csl = 1, csl = cs0 + csl0, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), t(csl.last, as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ x + [] = x; (s) ⊦ (a ' + x)[0] = a; (s) ⊦ a + x = a ' + x; (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 12 from proof lemma_3-15 (previous step) (back to tree)

aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), t(cs0, as0) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(cs0, as)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: as0

Additional information

Used simplifier rules: ⊦ amove(AIOAut(startf, stepf))(s, [], s); (s) Used terms: as0

Proof step 13 from proof lemma_3-15 (previous step) (back to tree)

⌜a + al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a + al1⌝ ), t(csl.last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

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⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s)

Proof step 14 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ ^ + ⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al1⌝ ), t(csl.last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-one, seq: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ , subst:[a] → [a], <all paths>

Additional information

Used terms: a

Proof step 15 from proof lemma_3-15 (previous step) (back to tree)

⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝

A spec-lemma

Proof step 16 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ ^ + ⌜al1⌝ ^ = ⌜al⌝ , a = τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al1⌝ ), t(csl.last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

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)

Proof step 17 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜τ '⌝ + ⌜al1⌝ ), t(csl.last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, tl(csl) abort: F discard: T computed: F

Additional information

Used terms: al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, tl(csl)

Proof step 18 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜τ '⌝ + ⌜al1⌝ ), t(csl.last, as0), ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(tl(csl)[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜tl(csl)⌝ , ⌜al1⌝ ) ∧ t(tl(csl).last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(tl(csl)[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 19 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜τ '⌝ + ⌜al1⌝ ), t(csl.last, as0), cINV(tl(csl)[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜tl(csl)⌝ , ⌜al1⌝ ) ∧ t(tl(csl).last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(tl(csl)[0], as) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceC-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [csl, cs, csl0]

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: csl, cs, y

Proof step 20 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , csl = cs + csl0, csl ≠ [], aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜τ '⌝ + ⌜al1⌝ ), t(csl.last, as0), cINV(csl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

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[traceC-IOstatestream] ⊦ (a ' + x)[0] = a; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a ' + x ≠ []; (s)

Proof step 21 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl0⌝ , ⌜τ '⌝ + ⌜al1⌝ ), t((cs ' + csl0).last, as0), cINV(csl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag-rec, seq:⊦ cfrag(CIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ cfrag(CIOAut(startf, stepf))(σ, α), subst:[α, stepf, a, startf, s, σ] → [⌜al1⌝ , cstepf, τ, cstartf, cs, ⌜csl0⌝ ], <all paths>

Additional information

Used terms: ⌜al1⌝ , τ, ⌜csl0⌝ , cs, cstepf, cstartf

Proof step 22 from proof lemma_3-15 (previous step) (back to tree)

⊦ cfrag(CIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ cfrag(CIOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 23 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t((cs ' + csl0).last, as0), cINV(csl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 24 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t((cs ' + csl0).last, as0), cINV(csl0[0]) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:proofobls-backwardsiminv, seq:⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[cstartf, cstepf, astartf, aINV, t, cINV, astepf] → [cstartf, cstepf, astartf, aINV, t, cINV, astepf], <all paths>

Additional information

Used terms: aINV, cINV, t, astepf, astartf, cstepf, cstartf

Proof step 25 from proof lemma_3-15 (previous step) (back to tree)

⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)))

Lemma proofobls-backwardsiminv

Proof step 26 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t((cs ' + csl0).last, as0), cINV(csl0[0]) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t((cs ' + csl0).last, as0), cINV(csl0[0]) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: cs, τ, csl0[0], as abort: F discard: T computed: T

Additional information

Used terms: cs, τ, csl0[0], as

Proof step 28 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t((cs ' + csl0).last, as0), cINV(csl0[0]) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as), cINV(cs) ∧ cstepf(cs, τ, csl0[0]) ∧ t(csl0[0], as) ∧ aINV(as) → (∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜τ '⌝ ^, as) ∧ t(cs, as1)), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜τ '⌝ ^ = []; (s)

Proof step 29 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t((cs ' + csl0).last, as0), cINV(csl0[0]) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0[0], as), cstepf(cs, τ, csl0[0]) ∧ t(csl0[0], as) ∧ aINV(as) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, [], as) ∧ t(cs, as1), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[traceC-IOstatestream], name:get-zero, seq: ⊦ x ≠ [] → x[0] = hd(x), subst:[x] → [csl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: csl0

Proof step 30 from proof lemma_3-15 (previous step) (back to tree)

⊦ x ≠ [] → x[0] = hd(x)

A spec-lemma

Proof step 31 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , csl0 ≠ [], aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t((cs ' + csl0).last, as0), cstepf(cs, τ, hd(csl0)) ∧ t(hd(csl0), as) ∧ aINV(as) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, [], as) ∧ t(cs, as1), cINV(hd(csl0)) ∧ t(csl0.last, as0) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(hd(csl0), as), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

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[traceC-IOstatestream] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 32 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , csl0 ≠ [], aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t(csl0.last, as0), cstepf(cs, τ, hd(csl0)) ∧ t(hd(csl0), as) ∧ aINV(as) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, [], as) ∧ t(cs, as1), cINV(hd(csl0)) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(hd(csl0), as), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceC-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [csl0, cs1, csl]

Additional information

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

Proof step 33 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , csl0 = cs1 + csl, csl0 ≠ [], aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs, τ, hd(⌜csl0⌝ )), t(csl0.last, as0), cINV(cs1) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs1, as), cstepf(cs, τ, cs1) ∧ t(cs1, as) ∧ aINV(as) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, [], as) ∧ t(cs, as1), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

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[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s) ⊦ a ' + x ≠ []; (s)

Proof step 34 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs1 '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs, τ, cs1), t((cs1 ' + csl).last, as0), cINV(cs1) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs1, as), t(cs1, as) ∧ aINV(as) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, [], as) ∧ t(cs, as1), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: cs, τ, cs1 abort: F discard: T computed: T

Additional information

Used terms: cs, τ, cs1

Proof step 35 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs1 '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs, τ, cs1), t((cs1 ' + csl).last, as0), t(cs1, as) ∧ aINV(as) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, [], as) ∧ t(cs, as1), cINV(cs1) → aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs1, as), cINV(cs) ∧ cstepf(cs, τ, cs1) → cINV(cs1), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 36 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), aINV(as), aINV(as1), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), amove(AIOAut(astartf, astepf))(as1, [], as), cINV(cs), cINV(cs1), cfrag(CIOAut(cstartf, cstepf))(⌜cs1 '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs, τ, cs1), t((cs1 ' + csl).last, as0), t(cs1, as), t(cs, as1), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: as1 abort: F discard: T computed: T

Additional information

Used terms: as1

Proof step 37 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as1), aINV(as), aINV(as0), amove(AIOAut(astartf, astepf))(as1, [], as), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), cINV(cs1), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs1 '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs, τ, cs1), t(cs, as1), t(cs1, as), t((cs1 ' + csl).last, as0), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(cs, as1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 38 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al⌝ , aINV(as0), aINV(as), aINV(as1), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), amove(AIOAut(astartf, astepf))(as1, [], as), cINV(cs), cINV(cs1), cfrag(CIOAut(cstartf, cstepf))(⌜cs1 '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs, τ, cs1), t((cs1 ' + csl).last, as0), t(cs1, as), t(cs, as1), ¬ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move-trans, seq:⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2), subst:[s, s1, α2, stepf, s2, startf, α1] → [as1, as, ⌜al⌝ , astepf, as0, astartf, []]

Additional information

Used simplifier rules: ⊦ [] + σ = σ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] Used terms: astartf, astepf, as1, [], as, ⌜al⌝ , as0

Proof step 39 from proof lemma_3-15 (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2)

A spec-lemma

Proof step 40 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al1⌝ ^ = ⌜al⌝ , a ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al1⌝ ), t(csl.last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 41 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al1⌝ ^ = ⌜al⌝ , a ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al1⌝ ), t(csl.last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl

Additional information

Used simplifier rules: cstatelist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s)

Proof step 42 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al1⌝ ^ = ⌜al⌝ , csl = cs0 + csl0, a ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(csl[0]), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al1⌝ ), t(csl.last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)

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[traceC-IOstatestream] ⊦ (a ' + x)[0] = a; (s) ⊦ a + x = a ' + x; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

Proof step 43 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al1⌝ ^ = ⌜al⌝ , a ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl0⌝ , ⌜a '⌝ + ⌜al1⌝ ), t((cs0 ' + csl0).last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs0, as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceC], name:frag-rec, seq:⊦ cfrag(CIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ cfrag(CIOAut(startf, stepf))(σ, α), subst:[α, stepf, a, startf, s, σ] → [⌜al1⌝ , cstepf, a, cstartf, cs0, ⌜csl0⌝ ], <all paths>

Additional information

Used terms: ⌜al1⌝ , a, ⌜csl0⌝ , cs0, cstepf, cstartf

Proof step 44 from proof lemma_3-15 (previous step) (back to tree)

⊦ cfrag(CIOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ cfrag(CIOAut(startf, stepf))(σ, α)

A spec-lemma

Proof step 45 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al1⌝ ^ = ⌜al⌝ , a ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a, hd(⌜csl0⌝ )), t((cs0 ' + csl0).last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 46 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al1⌝ ^ = ⌜al⌝ , a ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a, hd(⌜csl0⌝ )), t((cs0 ' + csl0).last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs0, as)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: al

Additional information

Used simplifier rules: actionlist freely generated by [], +;; ⊦ ⌜[]⌝ = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]

Proof step 47 from proof lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al1⌝ ^ = ⌜al⌝ , al = a0 + al0, a ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a, hd(⌜csl0⌝ )), t((cs0 ' + csl0).last, as0), ∀ al, aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl. ⌜al1⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ t(csl.last, as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) 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 '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws)

Proof step 48 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a0, hd(⌜csl0⌝ )), t((cs0 ' + csl0).last, as0), ∀ aINV0, as, cstartf0, cstepf0, astartf0, astepf0, t0, cINV0, csl. aINV0(as) ∧ bwsim(CIOAut(cstartf0, cstepf0), AIOAut(astartf0, astepf0), t0, cINV0, aINV0) ∧ cINV0(csl[0]) ∧ cfrag(CIOAut(cstartf0, cstepf0))(⌜csl⌝ , ⌜al1⌝ ) ∧ t0(csl.last, as) → (∃ as1. aINV0(as1) ∧ amove(AIOAut(astartf0, astepf0))(as1, ⌜al0⌝ , as) ∧ t0(csl[0], as1)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl0 abort: F discard: T computed: T

Additional information

Used terms: aINV, as0, cstartf, cstepf, astartf, astepf, t, cINV, csl0

Proof step 49 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a0, hd(⌜csl0⌝ )), t((cs0 ' + csl0).last, as0), aINV(as0) ∧ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ cINV(csl0[0]) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ) ∧ t(csl0.last, as0) → (∃ as1. aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(csl0[0], as1)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 50 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a0, hd(⌜csl0⌝ )), t((cs0 ' + csl0).last, as0), cINV(csl0[0]) ∧ t(csl0.last, as0) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(csl0[0], as1) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[traceC-IOstatestream], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[y, x] → [csl0, cs0 '], <all paths>

Additional information

Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ a '.last = a; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: csl0, cs0 '

Proof step 51 from proof lemma_3-15 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 52 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, csl0 ≠ [], aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a0, hd(⌜csl0⌝ )), t(csl0.last, as0), cINV(csl0[0]) ∧ t(csl0.last, as0) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(csl0[0], as1) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 53 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, csl0 ≠ [], aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a0, hd(⌜csl0⌝ )), t(csl0.last, as0), cINV(hd(csl0)) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(hd(csl0), as1) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[traceC-IOstatestream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [csl0, cs, csl]

Additional information

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

Proof step 54 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , csl0 = cs + csl, a0 ≠ τ, csl0 ≠ [], aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al1⌝ ), cstepf(cs0, a0, hd(⌜csl0⌝ )), t(csl0.last, as0), cINV(cs) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(cs, as1) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

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[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[traceC-IOstatestream] ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s) ⊦ a ' + x ≠ []; (s)

Proof step 55 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t((cs ' + csl).last, as0), cINV(cs) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(cs, as1) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:proofobls-backwardsiminv, seq:⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[cstartf, cstepf, astartf, aINV, t, cINV, astepf] → [cstartf, cstepf, astartf, aINV, t, cINV, astepf], <all paths>

Additional information

Used terms: aINV, cINV, t, astepf, astartf, cstepf, cstartf

Proof step 56 from proof lemma_3-15 (previous step) (back to tree)

⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)))

Lemma proofobls-backwardsiminv

Proof step 57 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t((cs ' + csl).last, as0), cINV(cs) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(cs, as1), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 58 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t((cs ' + csl).last, as0), cINV(cs) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(cs, as1), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: cs0, a0, cs abort: F discard: T computed: T

Additional information

Used terms: cs0, a0, cs

Proof step 59 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t((cs ' + csl).last, as0), cINV(cs) → aINV(as1) ∧ amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0) ∧ t(cs, as1), cINV(cs0) ∧ cstepf(cs0, a0, cs) → cINV(cs), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 60 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), aINV(as1), amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0), cINV(cs0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t((cs ' + csl).last, as0), t(cs, as1), ∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: cs0, a0, cs, as1 abort: F discard: T computed: T

Additional information

Used terms: cs0, a0, cs, as1

Proof step 61 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as1), aINV(as0), amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0), cINV(cs), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t(cs, as1), t((cs ' + csl).last, as0), cINV(cs0) ∧ cstepf(cs0, a0, cs) ∧ t(cs, as1) ∧ aINV(as1) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ ^, as1) ∧ t(cs0, as)), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; (s)

Proof step 62 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), aINV(as1), aINV(as), amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0), amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ , as1), cINV(cs0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t((cs ' + csl).last, as0), t(cs, as1), t(cs0, as), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦ ∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: as abort: F discard: T computed: T

Additional information

Used terms: as

Proof step 63 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as), aINV(as1), aINV(as0), amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ , as1), amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0), cINV(cs), cINV(cs0), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t(cs0, as), t(cs, as1), t((cs ' + csl).last, as0), ∀ cs. cstartf(cs) → cINV(cs), ∀ as. astartf(as) → aINV(as), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0) ∧ t(cs0, as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 64 from proof lemma_3-15 (previous step) (back to tree)

⌜al1⌝ ^ = ⌜al0⌝ , a0 ≠ τ, aINV(as0), aINV(as1), aINV(as), amove(AIOAut(astartf, astepf))(as1, ⌜al0⌝ , as0), amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ , as1), cINV(cs0), cINV(cs), cfrag(CIOAut(cstartf, cstepf))(⌜cs '⌝ + ⌜csl⌝ , ⌜al1⌝ ), cstepf(cs0, a0, cs), t((cs ' + csl).last, as0), t(cs, as1), t(cs0, as), ¬ amove(AIOAut(astartf, astepf))(as, ⌜a0 '⌝ + ⌜al0⌝ , as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as)), ∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0), ∀ as. astartf(as) → aINV(as), ∀ cs. cstartf(cs) → cINV(cs) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: IOtrace[traceA], name:move-trans, seq:⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2), subst:[s, s1, α2, stepf, s2, startf, α1] → [as, as1, ⌜al0⌝ , astepf, as0, astartf, ⌜a0 '⌝ ]

Additional information

Used terms: astartf, astepf, as, ⌜a0 '⌝ , as1, ⌜al0⌝ , as0

Proof step 65 from proof lemma_3-15 (previous step) (back to tree)

⊦ amove(AIOAut(startf, stepf))(s, α1, s1) ∧ amove(AIOAut(startf, stepf))(s1, α2, s2) → amove(AIOAut(startf, stepf))(s, α1 + α2, s2)

A spec-lemma

Proof Tree for lemma_3-15 (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