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



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

Proof step 1 from proof lemma_2-2-2-aux (conclusion) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl0 ∧ frag*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last) ↔ s ∈ sl

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 2 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl0 ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: sl0

Additional information

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

Proof step 3 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ [] ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s)

Proof step 4 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl. ∀ s. ¬ s ∈ sl

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: [] abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ ¬ a ∈ []; (s) Used terms: []

Proof step 5 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1) ⊦ ∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ state + sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1

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[IOstatestream] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s)

Proof step 6 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: state, β abort: F discard: F computed: T

Additional information

Used terms: state, β

Proof step 7 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∃ sl. ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ startf, stepf, β. (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: startf, stepf, β abort: F discard: T computed: T

Additional information

Used terms: startf, stepf, β

Proof step 9 from proof lemma_2-2-2-aux (previous step) (back to tree)

(∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl) → (∃ sl1. ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1), ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0 ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 10 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1 ⊦ ∃ sl1. ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: sl0 + sl1 abort: F discard: T computed: F

Additional information

Used terms: sl0 + sl1

Proof step 11 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0 ⊦ ∀ state0. (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl0 + sl1

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[IOstatestream] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 12 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1 ⊦ (∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl0 ∨ state0 ∈ sl1

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 13 from proof lemma_2-2-2-aux (previous step) (back to tree)

¬ state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last ⊦

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]

Proof step 14 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s. (∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ s = σ.l.last) ↔ s ∈ sl1, σ[0] = state ∨ σ[0] ∈ sl ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: σ.l.last abort: F discard: T computed: T

Additional information

Used terms: σ.l.last

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

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, (∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ σ0[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last) ↔ σ.l.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, σ[0] = state ∨ σ[0] ∈ sl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, σ[0] = state ∨ σ[0] ∈ sl ⊦ ∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ σ0[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ⌜al⌝ , σ abort: F discard: T computed: T

Additional information

Used terms: ⌜al⌝ , σ

Proof step 17 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ.l.last ∈ sl0, ¬ σ.l.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, σ[0] = state ∨ σ[0] ∈ sl ⊦ ⌜al⌝ ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, ⌜al⌝ ) ∧ finp(⌜al⌝ ) ∧ σ.l.last = σ.l.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s)

Proof step 18 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, s2) ↔ s2 ∈ sl0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: σ.l.last abort: F discard: T computed: T

Additional information

Used terms: σ.l.last

Proof step 19 from proof lemma_2-2-2-aux (previous step) (back to tree)

move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, σ.l.last) ↔ σ.l.last ∈ sl0, frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 20 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ move(IOAut(startf, stepf))(σ[0], ⌜al⌝ ^, σ.l.last), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:move, seq:⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, startf, s2, β, s1] → [stepf, startf, σ.l.last, ⌜al⌝ ^, σ[0]], <all paths>

Additional information

Used terms: σ.l.last, ⌜al⌝ ^, σ[0], stepf, startf

Proof step 21 from proof lemma_2-2-2-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 22 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ α, sl. ¬(frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ σ[0] = sl[0] ∧ σ.l.last = sl.last ∧ α ^ = ⌜al⌝ ^) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: ⌜al⌝ , σ.l abort: F discard: T computed: T

Additional information

Used terms: ⌜al⌝ , σ.l

Proof step 23 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ frag*(IOAut(startf, stepf))(⌜σ.l⌝ , ⌜al⌝ ) ∧ σ[0] = σ.l[0] ∧ σ.l.last = σ.l.last ∧ ⌜al⌝ ^ = ⌜al⌝ ^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 24 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), ¬ σ[0] ∈ sl, ¬ σ.l.last ∈ sl1, ¬ σ.l.last ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ frag(IOAut(startf, stepf))(⌜σ.l⌝ , ⌜al⌝ ) ∧ σ[0] = σ.l[0]

User applied rule constructor cut

And closed the goal!

Rule argument

var: σ

Additional information

Used simplifier rules: statestream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ¬ frag(IOAut(startf, stepf))(⌜sf⌝ , ⌜al⌝ ); (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ .l = x; (s)

Proof step 25 from proof lemma_2-2-2-aux (previous step) (back to tree)

∀ s. (∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ s = σ.l.last) ↔ s ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 1 terms: state0 abort: F discard: T computed: T

Additional information

Used terms: state0

Proof step 26 from proof lemma_2-2-2-aux (previous step) (back to tree)

(∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last) ↔ state0 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 27 from proof lemma_2-2-2-aux (previous step) (back to tree)

¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 28 from proof lemma_2-2-2-aux (previous step) (back to tree)

state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: state0 abort: F discard: T computed: T

Additional information

Used terms: state0

Proof step 29 from proof lemma_2-2-2-aux (previous step) (back to tree)

move(IOAut(startf, stepf))(state, β, state0) ↔ state0 ∈ sl0, state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof lemma_2-2-2-aux (previous step) (back to tree)

move(IOAut(startf, stepf))(state, β, state0), state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace, name:move, seq:⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β), subst:[stepf, startf, s2, β, s1] → [stepf, startf, state0, β, state], <all paths>

Additional information

Used terms: state0, β, state, stepf, startf

Proof step 31 from proof lemma_2-2-2-aux (previous step) (back to tree)

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

A spec-lemma

Proof step 32 from proof lemma_2-2-2-aux (previous step) (back to tree)

state0 ∈ sl0, ¬ state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ state = sl[0] ∧ state0 = sl.last ∧ α ^ = β ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

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] ⊦ frag*(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ finp(β); (s)

Proof step 33 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(⌜sl2⌝ , ⌜al⌝ ), sl2.last ∈ sl0, ¬ sl2.last ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ sl2.last = σ.l.last, ∃ α0, σ. α0 ^ = ⌜al⌝ ^ ∧ (σ[0] = sl2[0] ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α0) ∧ finp(α0) ∧ sl2.last = σ.l.last

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: ⌜al⌝ , ⌜sl2⌝

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜x⌝ .l = x; (s) Used terms: ⌜al⌝ , ⌜sl2⌝

Proof step 34 from proof lemma_2-2-2-aux (previous step) (back to tree)

state0 ∈ sl1, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl, ∀ s2. move(IOAut(startf, stepf))(state, β, s2) ↔ s2 ∈ sl0, ∃ α, σ. α ^ = β ∧ σ[0] ∈ sl ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last, state0 ∈ sl0 ∨ state0 ∈ sl1 ⊦ ∃ α, σ. α ^ = β ∧ (σ[0] = state ∨ σ[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ, α) ∧ finp(α) ∧ state0 = σ.l.last

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]

Proof step 35 from proof lemma_2-2-2-aux (previous step) (back to tree)

frag(IOAut(startf, stepf))(σ, ⌜al⌝ ), σ[0] ∈ sl, σ.l.last ∈ sl1, ∀ s2. move(IOAut(startf, stepf))(state, ⌜al⌝ ^, s2) ↔ s2 ∈ sl0, ∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl ⊦ ∃ α0, σ0. α0 ^ = ⌜al⌝ ^ ∧ (σ0[0] = state ∨ σ0[0] ∈ sl) ∧ frag(IOAut(startf, stepf))(σ0, α0) ∧ finp(α0) ∧ σ.l.last = σ0.l.last

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: ⌜al⌝ , σ

Additional information

Used simplifier rules: ⊦ finp(⌜x⌝ ); (s) Used terms: ⌜al⌝ , σ

Proof Tree for lemma_2-2-2-aux (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