[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 move-cut (conclusion) (back to tree)

move(IOAut(startf, stepf))(s, α1 + α2, s2) ⊦ ∃ s1. move(IOAut(startf, stepf))(s, α1, s1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, 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, s2, α1 + α2, s], <all paths>

Additional information

Used terms: s2, α1 + α2, s, stepf, startf

Proof step 2 from proof move-cut (previous step) (back to tree)

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

Lemma move

Proof step 3 from proof move-cut (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 4 from proof move-cut (previous step) (back to tree)

⌜al⌝ ^ = α1 + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], α1, s1)

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: α1

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜al⌝ ^ ≠ ⌜af⌝ ; (s)

Proof step 5 from proof move-cut (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: remtau, name:remtau-split, seq: ⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α), subst:[α, al, β2] → [⌜al⌝ , al0, α2]

Additional information

Used terms: ⌜al⌝ , al0, α2

Proof step 6 from proof move-cut (previous step) (back to tree)

⊦ α ^ = ⌜al⌝ + β2 → (∃ α1, α2. α1 ^ = ⌜al⌝ ∧ α2 ^ = β2 ∧ α1 + α2 = α)

A spec-lemma

Proof step 7 from proof move-cut (previous step) (back to tree)

⌜al⌝ ^ = ⌜al0⌝ + α2, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ), ⌜al⌝ ^ = ⌜al0⌝ + α2 → (∃ α1, α0. α1 ^ = ⌜al0⌝ ∧ α0 ^ = α2 ∧ α1 + α0 = ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 8 from proof move-cut (previous step) (back to tree)

α1 + α0 = ⌜al⌝ , α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al⌝ , ⌜sl⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜al⌝ , ⌜sl⌝ , stepf, startf

Proof step 9 from proof move-cut (previous step) (back to tree)

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

Lemma frag

Proof step 10 from proof move-cut (previous step) (back to tree)

# ⌜sl⌝ = # ⌜al⌝ + ⌜1⌝ , α1 + α0 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, α1 ^ = ⌜al0⌝ , ∀ n. ⌜n⌝ < # ⌜al⌝ → stepf(⌜sl⌝ [n], ⌜al⌝ [n], ⌜sl⌝ [n +1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 11 from proof move-cut (previous step) (back to tree)

α1 + α0 = ⌜al⌝ , # al + 1 = # sl, α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α0

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ ≠ σ + ⌜nf0⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream]

Proof step 12 from proof move-cut (previous step) (back to tree)

# al + 1 = # sl, α1 + α0 = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + α0 ^, α1 ^ = ⌜al0⌝ , α0 = ⌜al1⌝ , ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 13 from proof move-cut (previous step) (back to tree)

α1 + ⌜al1⌝ = ⌜al⌝ , # al + 1 = # sl, α1 ^ = ⌜al0⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜al1⌝ ^, ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: α1

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ + σ = ⌜nf⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ ≠ ⌜nf⌝ ; (s)

Proof step 14 from proof move-cut (previous step) (back to tree)

# al + 1 = # sl, α1 + ⌜al1⌝ = ⌜al⌝ , ⌜al⌝ ^ = ⌜al0⌝ + ⌜al1⌝ ^, α1 ^ = ⌜al0⌝ , α1 = ⌜al2⌝ , ∀ n. n < # al → stepf(sl[n], al[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

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: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s)

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

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ∃ s1. move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , s1)

User applied rule exists right

And obtained the following new goals

Rule argument

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

Additional information

Used terms: sl[# al2]

Proof step 16 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ¬ move(IOAut(startf, stepf))(sl[0], ⌜al0⌝ , sl[# al2]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, 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, sl[# al2], ⌜al0⌝ , sl[0]], <all paths>

Additional information

Used terms: sl[# al2], ⌜al0⌝ , sl[0], stepf, startf

Proof step 17 from proof move-cut (previous step) (back to tree)

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

Lemma move

Proof step 18 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ α, sl0. ¬(frag*(IOAut(startf, stepf))(⌜sl0⌝ , α) ∧ sl[0] = sl0[0] ∧ sl[# al2] = sl0.last ∧ α ^ = ⌜al0⌝ ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 19 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ α, sl0. ¬ frag(IOAut(startf, stepf))(⌜sl0⌝ , α) ∨ ¬ finp(α) ∨ sl[0] ≠ sl0[0] ∨ sl[# al2] ≠ sl0.last ∨ α ^ ≠ ⌜al0⌝ ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: ⌜al2⌝ , sl to # al2 + 1 abort: F discard: T computed: F

Additional information

Used terms: ⌜al2⌝ , sl to # al2 + 1

Proof step 20 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ) ∨ ¬ finp(⌜al2⌝ ) ∨ sl[0] ≠ (sl to # al2 + 1)[0] ∨ sl[# al2] ≠ (sl to # al2 + 1).last ∨ ⌜al2⌝ ^ ≠ ⌜al0⌝ ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 21 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ) ∨ sl[0] ≠ (sl to # al2 + 1)[0] ∨ sl[# al2] ≠ (sl to # al2 + 1).last ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 22 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ¬ frag(IOAut(startf, stepf))(⌜sl to # al2 + 1⌝ , ⌜al2⌝ ), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:frag, seq:⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1])), subst:[β, σ, stepf, startf] → [⌜al2⌝ , ⌜sl to # al2 + 1⌝ , stepf, startf], <all paths>

Additional information

Used terms: ⌜al2⌝ , ⌜sl to # al2 + 1⌝ , stepf, startf

Proof step 23 from proof move-cut (previous step) (back to tree)

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

Lemma frag

Proof step 24 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), # ⌜sl to # al2 + 1⌝ ≠ # ⌜al2⌝ + ⌜1⌝ ∨ (∃ n. ¬(⌜n⌝ < # ⌜al2⌝ → stepf(⌜sl to # al2 + 1⌝ [n], ⌜al2⌝ [n], ⌜sl to # al2 + 1⌝ [n +1]))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m +1 = m + 1; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s)

Proof step 25 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), # al2 + 1 ≠ #(sl to # al2 + 1) ∨ ¬(n < # al2 → stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1])) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 26 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:length-to, seq:¬ # x < n ⊦ #(x to n) = n, subst:[n, x] → [# al2 + 1, sl], <all paths>

Additional information

Used terms: # al2 + 1, sl

Proof step 27 from proof move-cut (previous step) (back to tree)

¬ # x < n ⊦ #(x to n) = n

A spec-lemma

Proof step 28 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), # sl < # al2 + 1, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 29 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , # al2 + 1 ≠ #(sl to # al2 + 1), # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

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

Proof step 30 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic

Proof step 31 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:get-finto, seq:¬ # x < n, m < n ⊦ (x to n)[m] = x[m], subst:[m, n, x] → [n, # al2 + 1, sl], <all paths>

Additional information

Used terms: n, # al2 + 1, sl

Proof step 32 from proof move-cut (previous step) (back to tree)

¬ # x < n, m < n ⊦ (x to n)[m] = x[m]

A spec-lemma

Proof step 33 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ¬ # sl < # al2 + 1 ∧ n < # al2 + 1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 34 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, # sl ≤ # al2, ¬ stepf((sl to # al2 + 1)[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

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

Proof step 35 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], n < # al2, n < # al2 + 1, ¬ # sl < # al2 + 1, ¬ stepf(sl[n], al2[n], (sl to # al2 + 1)[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m < n → n ≠ 0; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m +1 = m + 1; (s) ⊦ ¬ m + n < m; (s) ⊦ # x = 0 ↔ x = []; (s) trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s)

Proof step 36 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , al2 ≠ [], sl ≠ [], n < # al2 + # al1, n < # sl, # al2 < # sl, n < # al2, ¬ stepf(sl[n], al2[n], sl[n + 1]), ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: n

Additional information

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

Proof step 37 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:get-finto, seq:¬ # x < n, m < n ⊦ (x to n)[m] = x[m], subst:[m, n, x] → [0, # al2 + 1, sl], <all paths>

Additional information

Used terms: 0, # al2 + 1, sl

Proof step 38 from proof move-cut (previous step) (back to tree)

¬ # x < n, m < n ⊦ (x to n)[m] = x[m]

A spec-lemma

Proof step 39 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦ ¬ # sl < # al2 + 1 ∧ 0 < # al2 + 1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 40 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[0] ≠ (sl to # al2 + 1)[0], # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 1, flags: rotate, discard

Additional information

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

Proof step 41 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ (sl to # al2 + 1).last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[IOstatestream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [sl to # al2 + 1, a, sl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: sl to # al2 + 1, a, y

Proof step 42 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = [], sl[# al2] ≠ (sl to # al2 + 1).last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 43 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = [], sl[# al2] ≠ [].last, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule structural induction

And closed the goal!

Rule argument

indvar: sl

Additional information

Used simplifier rules: statelist freely generated by [], +;; ⊦ a ' + x to n + 1 = a + (x to n); (s) ⊦ a + x = a ' + x; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] ⊦ # [] = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) ⊦ m + 1 ≠ 0; (s)

Proof step 44 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = sl0 + a ', sl[# al2] ≠ a, sl to # al2 + 1 ≠ [], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

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 ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' ≠ []; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[IOstatestream]

Proof step 45 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl to # al2 + 1 = sl0 + a ', sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-del[IOstatestream], name:extension, seq: ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]), subst:[y, x] → [sl0 + a ', sl to # al2 + 1], <all paths>

Additional information

Used terms: sl0 + a ', sl to # al2 + 1

Proof step 46 from proof move-cut (previous step) (back to tree)

⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])

A spec-lemma

Proof step 47 from proof move-cut (previous step) (back to tree)

#(sl to # al2 + 1) = #(sl0 + a '), (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. n < #(sl to # al2 + 1) → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 48 from proof move-cut (previous step) (back to tree)

#(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[IOstatestream], name:length-to, seq:¬ # x < n ⊦ #(x to n) = n, subst:[n, x] → [# al2 + 1, sl], <all paths>

Additional information

Used terms: # al2 + 1, sl

Proof step 49 from proof move-cut (previous step) (back to tree)

¬ # x < n ⊦ #(x to n) = n

A spec-lemma

Proof step 50 from proof move-cut (previous step) (back to tree)

#(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, # sl < # al2 + 1, ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 51 from proof move-cut (previous step) (back to tree)

#(sl to # al2 + 1) = # sl0 + 1, (# al2 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, # sl ≤ # al2, ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]), ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n] ⊦

User applied rule subst equation

And closed the goal!

Rule argument

pos: left 2, flags: rotate, discard

Additional information

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

Proof step 52 from proof move-cut (previous step) (back to tree)

(# al2 + # al1) + 1 = # sl, # al2 + 1 = # sl0 + 1, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# al2] ≠ a, ¬ # sl < # al2 + 1, ∀ n. ¬ # sl0 < n → (sl to # al2 + 1)[n] = (sl0 + a ')[n], ∀ n. n < # al2 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ¬ m + n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ # x = 0 ↔ x = []; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ¬ # x < n, m < n ⊦ (x to n)[m] = x[m]; (s) ⊦ m ≤ n → (n < m ↔ false); (s) fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m + n = m + n0 ↔ n = n0; (s)

Proof step 53 from proof move-cut (previous step) (back to tree)

# al2 = # sl0, (# sl0 + # al1) + 1 = # sl, ⌜al2⌝ ^ = ⌜al0⌝ , sl[# sl0] ≠ a, sl ≠ [], # sl0 < # sl, ∀ n. ¬ # sl0 < n → sl[n] = (sl0 + a ')[n], ∀ n. n < # sl0 + # al1 → stepf(sl[n], (al2 + al1)[n], sl[n + 1]) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: # sl0

Additional information

Used simplifier rules: ⊦ ¬ n < n; (s) ⊦ (x + a ')[# x] = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[IOstatestream] Used terms: # sl0

Proof Tree for move-cut (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