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

weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), cexec(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), csl0.last = cs, cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0), aINV(as0) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as) ∧ aINV(as)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

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

csl0.last = cs, aINV(as0), cexec(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cmove(CIOAut(cstartf, cstepf))(cs, ⌜al⌝ , cs0), t(cs0, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(cs, as) ∧ aINV(as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

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

aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cmove(CIOAut(cstartf, cstepf))(csl0.last, ⌜al⌝ , cs0), cstartf(csl0[0]), t(cs0, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0.last, as) ∧ aINV(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, csl0.last, ⌜al⌝ ], <all paths>

Additional information

Used terms: cs0, ⌜al⌝ , csl0.last, cstepf, cstartf

Proof step 4 from proof weak-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 5 from proof weak-lemma_3-15 (previous step) (back to tree)

aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(cs0, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), ∃ α, sl. cfrag*(CIOAut(cstartf, cstepf))(⌜sl⌝ , α) ∧ csl0.last = sl[0] ∧ cs0 = sl.last ∧ α ^ = ⌜al⌝ ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl0.last, as) ∧ aINV(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 6 from proof weak-lemma_3-15 (previous step) (back to tree)

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

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: al1

Additional information

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

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

csl0.last = csl[0], ⌜[]⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜[]⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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 8 from proof weak-lemma_3-15 (previous step) (back to tree)

csl0.last = csl[0], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , []), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as) ∧ aINV(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 9 from proof weak-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 10 from proof weak-lemma_3-15 (previous step) (back to tree)

# ⌜csl⌝ = # [] + ⌜1⌝ , csl0.last = csl[0], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), ∀ n. ⌜n⌝ < # [] → cstepf(⌜csl⌝ [n], [][n], ⌜csl⌝ [n +1]) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as) ∧ aINV(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 11 from proof weak-lemma_3-15 (previous step) (back to tree)

# csl = 1, csl0.last = csl[0], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as) ∧ aINV(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 12 from proof weak-lemma_3-15 (previous step) (back to tree)

# csl = 1, csl0.last = csl[0], csl = cs0 + csl1, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl[0], as) ∧ aINV(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 13 from proof weak-lemma_3-15 (previous step) (back to tree)

aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl0.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, [], as0) ∧ t(csl0.last, as) ∧ aINV(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 14 from proof weak-lemma_3-15 (previous step) (back to tree)

csl0.last = csl[0], ⌜a + al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a + al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), ∀ csl0, csl, al, aINV, as0, cstartf, cstepf, al0, t, astartf, astepf. csl0.last = csl[0] ∧ ⌜al2⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ t(csl.last, as0) ∧ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(as)) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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 15 from proof weak-lemma_3-15 (previous step) (back to tree)

⌜a '⌝ ^ + ⌜al2⌝ ^ = ⌜al⌝ , csl0.last = csl[0], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), ∀ csl0, csl, al, aINV, as0, cstartf, cstepf, al0, t, astartf, astepf. csl0.last = csl[0] ∧ ⌜al2⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ t(csl.last, as0) ∧ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(as)) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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 16 from proof weak-lemma_3-15 (previous step) (back to tree)

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

A spec-lemma

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

⌜a '⌝ ^ + ⌜al2⌝ ^ = ⌜al⌝ , csl0.last = csl[0], a = τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), ∀ csl0, csl, al, aINV, as0, cstartf, cstepf, al0, t, astartf, astepf. csl0.last = csl[0] ∧ ⌜al2⌝ ^ = ⌜al⌝ ∧ aINV(as0) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al2⌝ ) ∧ cstartf(csl0[0]) ∧ t(csl.last, as0) ∧ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) → (∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(as)) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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 18 from proof weak-lemma_3-15 (previous step) (back to tree)

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: csl0 + hd(tl(csl)), tl(csl), al, aINV, as0, cstartf, cstepf, al0 + τ, t, astartf, astepf abort: F discard: T computed: F

Additional information

Used terms: csl0 + hd(tl(csl)), tl(csl), al, aINV, as0, cstartf, cstepf, al0 + τ, t, astartf, astepf

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

csl0.last = csl[0], ⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), hd(tl(csl)) = tl(csl)[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(tl(csl)) '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜tl(csl)⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(tl(csl)) ')[0]) ∧ t(tl(csl).last, as0) → amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(tl(csl)[0], as) ∧ aINV(as) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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, csl1]

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 21 from proof weak-lemma_3-15 (previous step) (back to tree)

csl0.last = csl[0], ⌜al2⌝ ^ = ⌜al⌝ , csl = cs + csl1, csl ≠ [], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0) → amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl1[0], as) ∧ aINV(as) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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 22 from proof weak-lemma_3-15 (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(as1), hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0)

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: right 1

Additional information

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl1

Additional information

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

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

⌜al2⌝ ^ = ⌜al⌝ , csl1 = [], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t(csl0.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦

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] → [⌜τ '⌝ + ⌜al2⌝ , ⌜csl0.last '⌝ , cstepf, cstartf], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ n < m → (⌜(* n)⌝ = ⌜(* m)⌝ + n∞2 ↔ false); (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf Used terms: ⌜τ '⌝ + ⌜al2⌝ , ⌜csl0.last '⌝ , cstepf, cstartf

Proof step 27 from proof weak-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 28 from proof weak-lemma_3-15 (previous step) (back to tree)

⌜al2⌝ ^ = ⌜al⌝ , csl1 = cs0 + csl2, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0)

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

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜cs0 '⌝ + ⌜csl2⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs0 '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + cs0 ')[0])

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, σ] → [⌜al2⌝ , cstepf, τ, cstartf, csl0.last, ⌜cs0 '⌝ + ⌜csl2⌝ ], <all paths>

Additional information

Used terms: ⌜al2⌝ , τ, ⌜cs0 '⌝ + ⌜csl2⌝ , csl0.last, cstepf, cstartf

Proof step 30 from proof weak-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 31 from proof weak-lemma_3-15 (previous step) (back to tree)

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), cstepf(csl0.last, τ, hd(⌜cs0 '⌝ + ⌜csl2⌝ )), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs0 '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + cs0 ')[0])

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

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, τ, cs0), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs0 '⌝ , ⌜al0⌝ + ⌜τ '⌝ ) ∧ cstartf((csl0 + cs0 ')[0])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: τ, ⌜al0⌝ , cs0, csl0, cstepf, cstartf

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

⊦ cfrag(CIOAut(startf, stepf))(⌜sl⌝ + ⌜s '⌝ , α + ⌜a '⌝ ) ↔ stepf(sl.last, a, s) ∧ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , α)

A spec-lemma

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), cstepf(csl0.last, τ, cs0), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ (cstepf(csl0.last, τ, cs0) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ )) ∧ cstartf((csl0 + cs0 ')[0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, τ, cs0), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), ¬ cstartf((csl0 + cs0 ')[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[traceC-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [0, cs0 ', csl0], <all paths>

Additional information

Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: 0, cs0 ', csl0

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

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

A spec-lemma

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), aINV(as), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), t(csl1[0], as), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(as1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as), aINV(as0), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl1[0], as), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(as1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:proofobls-weakbackwardsim, seq:⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last)) ∧ (∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as))), subst:[cstartf, cstepf, astartf, aINV, t, astepf] → [cstartf, cstepf, astartf, aINV, t, astepf], <all paths>

Additional information

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

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

⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last)) ∧ (∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as)))

Lemma proofobls-weakbackwardsim

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as0), aINV(as), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), t(csl1[0], as), ∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last), ∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as)) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(as1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as), aINV(as0), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜τ '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl1[0], as), t((csl0.last ' + csl1).last, as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ csl, al1, a, cs0, as1. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as1) ∧ aINV(as1) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as1) ∧ t(csl.last, as)), ∀ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) → aINV(asl.last), ∀ csl, al1. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as)) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(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, σ] → [⌜al2⌝ , cstepf, τ, cstartf, csl0.last, ⌜csl1⌝ ], <all paths>

Additional information

Used terms: ⌜al2⌝ , τ, ⌜csl1⌝ , csl0.last, cstepf, cstartf

Proof step 42 from proof weak-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 43 from proof weak-lemma_3-15 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl1

Additional information

Used simplifier rules: cstatelist freely generated by [], +;; ⊦ 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)

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

⌜al2⌝ ^ = ⌜al⌝ , csl1 = cs0 + csl2, aINV(as0), aINV(as), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, τ, hd(⌜csl1⌝ )), t((csl0.last ' + csl1).last, as0), t(csl1[0], as), ∀ csl, al1. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as)), ∀ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) → aINV(asl.last), ∀ csl, al1, a, cs0, as1. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as1) ∧ aINV(as1) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as1) ∧ t(csl.last, as)), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(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) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + x)[0] = a; (s)

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

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: csl0, al0, τ, cs0, as abort: F discard: T computed: T

Additional information

Used terms: csl0, al0, τ, cs0, as

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as), aINV(as0), aINV(as1), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), amove(AIOAut(astartf, astepf))(as1, [], as), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, τ, cs0), t(cs0, as), t((cs0 ' + csl2).last, as0), t(csl0.last, as1), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) → aINV(asl.last), ∀ csl, al1. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as)) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(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 49 from proof weak-lemma_3-15 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜al2⌝ ^ = ⌜al⌝ , aINV(as), aINV(as0), aINV(as1), amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0), amove(AIOAut(astartf, astepf))(as1, [], as), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, τ, cs0), t(cs0, as), t((cs0 ' + csl2).last, as0), t(csl0.last, as1), ¬ amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ asl, al1. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al1⌝ ) ∧ astartf(asl[0]) → aINV(asl.last), ∀ csl, al1. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al1⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as)) ⊦

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 51 from proof weak-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 52 from proof weak-lemma_3-15 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: csl0 + hd(tl(csl)), tl(csl), tl(al), aINV, as0, cstartf, cstepf, al0 + a, t, astartf, astepf abort: F discard: T computed: F

Additional information

Used terms: csl0 + hd(tl(csl)), tl(csl), tl(al), aINV, as0, cstartf, cstepf, al0 + a, t, astartf, astepf

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜a '⌝ + ⌜al2⌝ ^ = ⌜al⌝ , csl0.last = csl[0], a ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), hd(tl(csl)) = tl(csl)[0] ∧ ⌜al2⌝ ^ = ⌜tl(al)⌝ ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(tl(csl)) '⌝ , ⌜al0⌝ + ⌜a '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜tl(csl)⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(tl(csl)) ')[0]) ∧ t(tl(csl).last, as0) → amove(AIOAut(astartf, astepf))(as, ⌜tl(al)⌝ , as0) ∧ t(tl(csl)[0], as) ∧ aINV(as) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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, csl1]

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 56 from proof weak-lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al2⌝ ^ = ⌜al⌝ , csl0.last = csl[0], csl = cs + csl1, a ≠ τ, csl ≠ [], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜a '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t(csl.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), hd(csl1) = csl1[0] ∧ ⌜al2⌝ ^ = ⌜tl(al)⌝ ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜a '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0) → amove(AIOAut(astartf, astepf))(as, ⌜tl(al)⌝ , as0) ∧ t(csl1[0], as) ∧ aINV(as) ⊦ ∃ as. amove(AIOAut(astartf, astepf))(as, ⌜al⌝ , as0) ∧ t(csl[0], as) ∧ aINV(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 57 from proof weak-lemma_3-15 (previous step) (back to tree)

⌜a '⌝ + ⌜al2⌝ ^ = ⌜al⌝ , a ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜a '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), hd(csl1) = csl1[0] ∧ ⌜al2⌝ ^ = ⌜tl(al)⌝ ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜a '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0) → amove(AIOAut(astartf, astepf))(as, ⌜tl(al)⌝ , as0) ∧ t(csl1[0], as) ∧ aINV(as) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(as1)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[actionstream], name:elim-list-c, seq:x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y, subst:[x, a, y] → [al, a0, al1]

Additional information

Used simplifier rules: ⊦ ⌜[]⌝ = []; (s) ⊦ σ0 + σ1 = [] ↔ σ0 = [] ∧ σ1 = []; (ws) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ a ' ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] x ≠ [] ⊦ a = hd(x) ∧ y = tl(x) ↔ x = a + y; (elim) Used terms: al, a0, y

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

⌜a '⌝ + ⌜al2⌝ ^ = ⌜al⌝ , al = a0 + al1, a ≠ τ, al ≠ [], aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜a '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), hd(csl1) = csl1[0] ∧ ⌜al2⌝ ^ = ⌜al1⌝ ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜a '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0) → amove(AIOAut(astartf, astepf))(as, ⌜al1⌝ , as0) ∧ t(csl1[0], as) ∧ aINV(as) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜al⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(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[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜a '⌝ + σ = ⌜a0 '⌝ + σ0 ↔ a = a0 ∧ σ = σ0; (ws)

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

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

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

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

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: right 1

Additional information

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜a0 '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜a0 '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl1

Additional information

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

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

⌜al2⌝ ^ = ⌜al1⌝ , csl1 = [], a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜a0 '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜a0 '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ , ⌜a0 '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t(csl0.last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦

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] → [⌜a0 '⌝ + ⌜al2⌝ , ⌜csl0.last '⌝ , cstepf, cstartf], <all paths>

Additional information

Used simplifier rules: ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜(* n)⌝ + ⌜(* m)⌝ = ⌜n + m⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ n < m → (⌜(* n)⌝ = ⌜(* m)⌝ + n∞2 ↔ false); (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf Used terms: ⌜a0 '⌝ + ⌜al2⌝ , ⌜csl0.last '⌝ , cstepf, cstartf

Proof step 64 from proof weak-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 65 from proof weak-lemma_3-15 (previous step) (back to tree)

⌜al2⌝ ^ = ⌜al1⌝ , csl1 = cs0 + csl2, a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜a0 '⌝ + ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), t((csl0.last ' + csl1).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ hd(csl1) = csl1[0] ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜hd(csl1) '⌝ , ⌜al0⌝ + ⌜a0 '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl1⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + hd(csl1) ')[0]) ∧ t(csl1.last, as0)

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

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜cs0 '⌝ + ⌜csl2⌝ , ⌜a0 '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs0 '⌝ , ⌜al0⌝ + ⌜a0 '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + cs0 ')[0])

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, σ] → [⌜al2⌝ , cstepf, a0, cstartf, csl0.last, ⌜cs0 '⌝ + ⌜csl2⌝ ], <all paths>

Additional information

Used terms: ⌜al2⌝ , a0, ⌜cs0 '⌝ + ⌜csl2⌝ , csl0.last, cstepf, cstartf

Proof step 67 from proof weak-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 68 from proof weak-lemma_3-15 (previous step) (back to tree)

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a0, hd(⌜cs0 '⌝ + ⌜csl2⌝ )), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs0 '⌝ , ⌜al0⌝ + ⌜a0 '⌝ ) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ) ∧ cstartf((csl0 + cs0 ')[0])

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

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a0, cs0), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ + ⌜cs0 '⌝ , ⌜al0⌝ + ⌜a0 '⌝ ) ∧ cstartf((csl0 + cs0 ')[0])

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: a0, ⌜al0⌝ , cs0, csl0, cstepf, cstartf

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

⊦ cfrag(CIOAut(startf, stepf))(⌜sl⌝ + ⌜s '⌝ , α + ⌜a '⌝ ) ↔ stepf(sl.last, a, s) ∧ cfrag(CIOAut(startf, stepf))(⌜sl⌝ , α)

A spec-lemma

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a0, cs0), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ⊦ (cstepf(csl0.last, a0, cs0) ∧ cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ )) ∧ cstartf((csl0 + cs0 ')[0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a0, cs0), t((cs0 ' + csl2).last, as0), weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV), ¬ cstartf((csl0 + cs0 ')[0]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[traceC-IOstatestream], name:get-append-less, seq: ⊦ n < # x → (x + y)[n] = x[n], subst:[n, y, x] → [0, cs0 ', csl0], <all paths>

Additional information

Used simplifier rules: ⊦ 0 < m ↔ m ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ ⌜[]⌝ = []; (s) ⊦ ¬ cfrag(CIOAut(startf, stepf))([], α); (s) Used terms: 0, cs0 ', csl0

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

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

A spec-lemma

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:proofobls-weakbackwardsim, seq:⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last)) ∧ (∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as))), subst:[cstartf, cstepf, astartf, aINV, t, astepf] → [cstartf, cstepf, astartf, aINV, t, astepf], <all paths>

Additional information

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

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

⊦ weakbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, aINV) ↔ (∀ csl, al. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) → (∃ as. t(csl.last, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ asl, al. aexec(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) → aINV(asl.last)) ∧ (∀ csl, al, a, cs0, as0. cexec(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(csl.last, as)))

Lemma proofobls-weakbackwardsim

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ aexec(AIOAut(startf, stepf))(σ, β) ↔ afrag(AIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as), aINV(as0), amove(AIOAut(astartf, astepf))(as, ⌜al1⌝ , as0), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜csl0.last '⌝ + ⌜csl1⌝ , ⌜a0 '⌝ + ⌜al2⌝ ), cstartf(csl0[0]), t(csl1[0], as), t((csl0.last ' + csl1).last, as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ csl, al, a, cs0, as1. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) ∧ cstepf(csl.last, a, cs0) ∧ t(cs0, as1) ∧ aINV(as1) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as1) ∧ t(csl.last, as)), ∀ asl, al. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) → aINV(asl.last), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as)) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜a0 '⌝ + ⌜al1⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(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, σ] → [⌜al2⌝ , cstepf, a0, cstartf, csl0.last, ⌜csl1⌝ ], <all paths>

Additional information

Used terms: ⌜al2⌝ , a0, ⌜csl1⌝ , csl0.last, cstepf, cstartf

Proof step 79 from proof weak-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 80 from proof weak-lemma_3-15 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: csl0, al0, a0, hd(⌜csl1⌝ ), as abort: F discard: T computed: T

Additional information

Used terms: csl0, al0, a0, hd(⌜csl1⌝ ), as

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: csl1

Additional information

Used simplifier rules: cstatelist freely generated by [], +;; ⊦ 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)

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

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

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[traceC-IOstatestream] ⊦ hd(⌜a '⌝ + ⌜x⌝ ) = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[traceC-IOstatestream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + x)[0] = a; (s)

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as), aINV(as0), aINV(as1), amove(AIOAut(astartf, astepf))(as, ⌜al1⌝ , as0), amove(AIOAut(astartf, astepf))(as1, ⌜a0 '⌝ , as), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a0, cs0), t(cs0, as), t((cs0 ' + csl2).last, as0), t(csl0.last, as1), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ asl, al. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) → aINV(asl.last), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as)) ⊦ ∃ as1. amove(AIOAut(astartf, astepf))(as1, ⌜a0 '⌝ + ⌜al1⌝ , as0) ∧ t(csl0.last, as1) ∧ aINV(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 86 from proof weak-lemma_3-15 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜al2⌝ ^ = ⌜al1⌝ , a0 ≠ τ, aINV(as), aINV(as0), aINV(as1), amove(AIOAut(astartf, astepf))(as, ⌜al1⌝ , as0), amove(AIOAut(astartf, astepf))(as1, ⌜a0 '⌝ , as), cfrag(CIOAut(cstartf, cstepf))(⌜csl0⌝ , ⌜al0⌝ ), cfrag(CIOAut(cstartf, cstepf))(⌜cs0 '⌝ + ⌜csl2⌝ , ⌜al2⌝ ), cstartf(csl0[0]), cstepf(csl0.last, a0, cs0), t(cs0, as), t((cs0 ' + csl2).last, as0), t(csl0.last, as1), ¬ amove(AIOAut(astartf, astepf))(as1, ⌜a0 '⌝ + ⌜al1⌝ , as0), ∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as), ∀ asl, al. afrag(AIOAut(astartf, astepf))(⌜asl⌝ , ⌜al⌝ ) ∧ astartf(asl[0]) → aINV(asl.last), ∀ csl, al. cfrag(CIOAut(cstartf, cstepf))(⌜csl⌝ , ⌜al⌝ ) ∧ cstartf(csl[0]) → (∃ as. t(csl.last, as) ∧ aINV(as)) ⊦

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, ⌜al1⌝ , astepf, as0, astartf, ⌜a0 '⌝ ]

Additional information

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

Proof step 88 from proof weak-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 weak-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