[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 remtau-to-strong (conclusion) (back to tree)

⊦ ¬ # α ^ < ⌜n⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof remtau-to-strong (previous step) (back to tree)

¬ # α ^ < ⌜n⌝ ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 3 from proof remtau-to-strong (previous step) (back to tree)

¬ # α ^ < ⌜n⌝ ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n = (α to m)^

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: n

Additional information

Used simplifier rules: nat freely generated by 0, +1;;

Proof step 4 from proof remtau-to-strong (previous step) (back to tree)

¬ # α ^ < ⌜0⌝ ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to 0 = (α to m)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ σ to 0 = []; (s) ⊦ ¬ n∞ < ⌜0⌝ ; (s)

Proof step 5 from proof remtau-to-strong (previous step) (back to tree)

⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ [] = (α to m)^

User applied rule exists right

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: remtau-empty: ⊦ [] ^ = []; ⊦ ¬ n∞ < ⌜0⌝ ; (s) ⊦ σ to 0 = []; (s) Used terms: 0

Proof step 6 from proof remtau-to-strong (previous step) (back to tree)

¬ # α ^ < ⌜n0 +1⌝ , ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^) ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 +1 = (α to m)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 7 from proof remtau-to-strong (previous step) (back to tree)

⌜n0⌝ < # α ^, ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^) ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 + 1 = (α to m)^

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:ex-first-nontau, seq:α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ), subst:[α] → [α]

Additional information

Used simplifier rules: ⊦ # [] = ⌜0⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < 0; (s) Used terms: α

Proof step 8 from proof remtau-to-strong (previous step) (back to tree)

α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)

Lemma ex-first-nontau

Proof step 9 from proof remtau-to-strong (previous step) (back to tree)

⌜n0⌝ < # α ^, ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^), ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ) ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 + 1 = (α to m)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 10 from proof remtau-to-strong (previous step) (back to tree)

α[n] ≠ τ, ⌜n⌝ < # α, ⌜n0⌝ < # α ^, ∀ m. m < n → α[m] = τ, ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^) ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 + 1 = (α to m)^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-from-strong, seq:¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^, subst:[α, n] → [α, n], <all paths>

Additional information

Used simplifier rules: ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s) Used terms: α, n

Proof step 11 from proof remtau-to-strong (previous step) (back to tree)

¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^

Lemma remtau-from-strong

Proof step 12 from proof remtau-to-strong (previous step) (back to tree)

α[n] ≠ τ, ⌜n0⌝ < # (α from n)^, ⌜n⌝ < # α, ¬ # α < ⌜n⌝ , ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^), ∀ m. m < n → α[m] = τ ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ (α from n)^ to n0 + 1 = (α to m)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s)

Proof step 13 from proof remtau-to-strong (previous step) (back to tree)

α[n] ≠ τ, ⌜n⌝ < # α, ⌜n0⌝ < # (α from n)^, ∀ m. m < n → α[m] = τ, ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^) ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ (α from n)^ to n0 + 1 = (α to m)^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:from-succ, seq: ⊦ ⌜n⌝ < # σ → σ from n = σ[n] + (σ from n + 1), subst:[n, σ] → [n, α], <all paths>

Additional information

Used terms: n, α

Proof step 14 from proof remtau-to-strong (previous step) (back to tree)

⊦ ⌜n⌝ < # σ → σ from n = σ[n] + (σ from n + 1)

A spec-lemma

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

α[n] ≠ τ, ⌜n0⌝ < # (α[n] + (α from n + 1))^, ⌜n⌝ < # α, ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^), ∀ m. m < n → α[m] = τ ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ (α[n] + (α from n + 1))^ to n0 + 1 = (α to m)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-nontau-lem: ⊦ a ≠ τ → (⌜a '⌝ + β)^ = ⌜a '⌝ + β ^; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ a + σ = ⌜a '⌝ + σ; (s) ⊦ ⌜a '⌝ + σ to n + 1 = a + (σ to n); (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⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)

Proof step 16 from proof remtau-to-strong (previous step) (back to tree)

α[n] ≠ τ, ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ∀ m. m < n → α[m] = τ, ∀ α. ¬ # α ^ < ⌜n0⌝ → (∃ m. ¬ # α < ⌜m⌝ ∧ α ^ to n0 = (α to m)^) ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to m)^

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: α from n + 1 abort: F discard: T computed: F

Additional information

Used terms: α from n + 1

Proof step 17 from proof remtau-to-strong (previous step) (back to tree)

α[n] ≠ τ, ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ → (∃ m. ¬ #(α from n + 1) < ⌜m⌝ ∧ (α from n + 1)^ to n0 = ((α from n + 1) to m)^), ∀ m. m < n → α[m] = τ ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to m)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 18 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ ⊦ ∃ m. ¬ # α < ⌜m⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to m)^

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: n1 + 1 + n abort: F discard: T computed: F

Additional information

Used terms: n1 + 1 + n

Proof step 19 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ ⊦ ¬ # α < ⌜n1 + 1 + n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to n1 + 1 + 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⌝ = ⌜m⌝ + ⌜n⌝ ; (s)

Proof step 20 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to n1 + 1 + n)^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-from-strong, seq:¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^, subst:[n, α] → [n, α to n1 + 1 + n], <all paths>

Additional information

Used terms: n, α to n1 + 1 + n

Proof step 21 from proof remtau-to-strong (previous step) (back to tree)

¬ # α < ⌜n⌝ , ∀ m. m < n → α[m] = τ ⊦ α ^ = (α from n)^

Lemma remtau-from-strong

Proof step 22 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to n1 + 1 + n)^, ¬ #(α to n1 + 1 + n) < ⌜n⌝ ∧ (∀ m. m < n → (α to n1 + 1 + n)[m] = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 23 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to n1 + 1 + n)^, ¬ #(α to n1 + 1 + n) < ⌜n⌝ ∧ (n2 < n → (α to n1 + 1 + n)[n2] = τ)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:size-to, seq:¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ , subst:[n, σ] → [n1 + 1 + n, α], <all paths>

Additional information

Used terms: n1 + 1 + n, α

Proof step 24 from proof remtau-to-strong (previous step) (back to tree)

¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝

A spec-lemma

Proof step 25 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, # α < ⌜n1 + 1 + n⌝ , ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ ⊦ ¬ #(α to n1 + 1 + n) < ⌜n⌝ ∧ (n2 < n → (α to n1 + 1 + n)[n2] = τ), ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to n1 + 1 + n)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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 ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)

Proof step 26 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ , ⌜n⌝ < # α, ¬ #(α from n + 1) < ⌜n1⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ∀ m. m < n → α[m] = τ ⊦ ¬ #(α to n1 + 1 + n) < ⌜n⌝ ∧ (n2 < n → (α to n1 + 1 + n)[n2] = τ)

User applied rule structural induction

And closed the goal!

Rule argument

indvar: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (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 ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic

Proof step 27 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ # α < ⌜n1 + 1 + n⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ ⊦ ¬ ⌜n1 + 1 + n⌝ < ⌜n⌝ ∧ (n2 < n → (α to n1 + 1 + n)[n2] = τ), ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = (α to n1 + 1 + n)^

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 m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + m0 < n → ¬ n + n0 < m; (s) ⊦ m +1 = m + 1; (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 ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m < n + 1 ↔ ¬ n < m; (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 ⊦ ¬ m + n < m; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n1 + n + m < n0; (s)

Proof step 28 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, ⌜α[n] '⌝ + ((α from n + 1)^ to n0) ≠ (α to n1 + 1 + n)^, α[n2] ≠ τ, α[n] ≠ τ, n2 < n, ⌜n⌝ < # α, ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ∀ m. m < n → α[m] = τ ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: n2

Additional information

Used terms: n2

Proof step 29 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ #(α to n1 + 1 + n) < ⌜n⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ, ∀ m. m < n → (α to n1 + 1 + n)[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = ((α to n1 + 1 + n) from n)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ #(α to n1 + 1 + n) < ⌜n⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → (α to n1 + 1 + n)[m] = τ, ∀ m. m < n → α[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = ((α to n1 + 1 + n) from n)^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:from-succ, seq: ⊦ ⌜n⌝ < # σ → σ from n = σ[n] + (σ from n + 1), subst:[n, σ] → [n, α to n1 + 1 + n], <all paths>

Additional information

Used terms: n, α to n1 + 1 + n

Proof step 31 from proof remtau-to-strong (previous step) (back to tree)

⊦ ⌜n⌝ < # σ → σ from n = σ[n] + (σ from n + 1)

A spec-lemma

Proof step 32 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ¬ ⌜n⌝ < #(α to n1 + 1 + n), ¬ #(α to n1 + 1 + n) < ⌜n⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ, ∀ m. m < n → (α to n1 + 1 + n)[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = ((α to n1 + 1 + n) from n)^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ m; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ¬ n∞1 < n∞ → (n∞ < n∞1 ↔ n∞ ≠ n∞1); (ss) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic

Proof step 33 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, ⌜n⌝ = #(α to n1 + 1 + n), α[n] ≠ τ, ⌜n⌝ < # α, ¬ #(α from n + 1) < ⌜n1⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ∀ m. m < n → α[m] = τ, ∀ m. m < n → (α to n1 + 1 + n)[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = ((α to n1 + 1 + n) from n)^

User applied rule structural induction

And closed the goal!

Rule argument

indvar: α

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ⌜n1⌝ + ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n1 + n + m = n0; (s) ⊦ m = m + n ↔ n = 0; (s) ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic 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 ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ¬ # x < n ⊦ #(x to n) = n; (s)

Proof step 34 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ⌜n⌝ < #(α to n1 + 1 + n), ¬ #(α to n1 + 1 + n) < ⌜n⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ, ∀ m. m < n → (α to n1 + 1 + n)[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ ⌜α[n] '⌝ + ((α from n + 1)^ to n0) = ((α to n1 + 1 + n)[n] + ((α to n1 + 1 + n) from n + 1))^

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-nontau-lem: ⊦ a ≠ τ → (⌜a '⌝ + β)^ = ⌜a '⌝ + β ^; append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x⌝ + σ0 = ⌜x⌝ + σ1 ↔ σ0 = σ1; (s) ⊦ a + σ = ⌜a '⌝ + σ; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (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 ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ¬ m + n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ n∞ < n∞0 → ¬ n∞0 < n∞; (s)

Proof step 35 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < #(α to n1 + 1 + n), ⌜n⌝ < # α, ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → (α to n1 + 1 + n)[m] = τ, ∀ m. m < n → α[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ (α from n + 1)^ to n0 = ((α to n1 + 1 + n) from n + 1)^

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:swap-to-from, seq: ⊦ m ≤ n ∧ ¬ # σ < ⌜n⌝ → (σ to n) from m = (σ from m) to (n - m), subst:[m, n, σ] → [n + 1, n1 + 1 + n, α], <all paths>

Additional information

Used simplifier rules: ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m ≤ m + n; (s) ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf lels-trans: ⊦ ¬ n∞1 < n∞ ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ¬ n∞ < n∞; (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ¬ m + n < m; (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 ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ m +1 = m + 1; (s) ⊦ m + m0 < n → ¬ n + n0 < m; (s) m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]; (s) ⊦ m + n - n + n1 = m - n1; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s) ⊦ n + 0 = n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n + 1, n1 + 1 + n, α

Proof step 36 from proof remtau-to-strong (previous step) (back to tree)

⊦ m ≤ n ∧ ¬ # σ < ⌜n⌝ → (σ to n) from m = (σ from m) to (n - m)

A spec-lemma

Proof step 37 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, ⌜n⌝ < # α, ⌜n⌝ < #(α to n1 + 1 + n), ¬ # (α from n + 1)^ < ⌜n0⌝ , ¬ #(α from n + 1) < ⌜n1⌝ , ∀ m. m < n → α[m] = τ, ∀ m. m < n → (α to n1 + 1 + n)[m] = τ ⊦ ¬ # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ ∧ (α from n + 1)^ to n0 = ((α to n1 + 1 + n) from n + 1)^, n + 1 ≤ n1 + 1 + n ∧ ¬ # α < ⌜n1 + 1 + n⌝

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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 ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ m ≤ m + n; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)

Proof step 38 from proof remtau-to-strong (previous step) (back to tree)

(α from n + 1)^ to n0 = ((α from n + 1) to n1)^, α[n] ≠ τ, # α < ⌜n1⌝ + ⌜1⌝ + ⌜n⌝ , ⌜n⌝ < # α, ⌜n⌝ < #(α to n1 + 1 + n), ¬ #(α from n + 1) < ⌜n1⌝ , ¬ # (α from n + 1)^ < ⌜n0⌝ , ∀ m. m < n → α[m] = τ, ∀ m. m < n → (α to n1 + 1 + n)[m] = τ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:fin-size-from, seq: ⊦ ⌜n⌝ < # σ ∧ finp(σ) → #(σ from n) = ⌜(# σ).n - n⌝ , subst:[n, σ] → [n + 1, α], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ls-trans: ⊦ n∞ < n∞1 ∧ n∞1 < n∞2 → n∞ < n∞2; (forward) from specification nat-inf stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic[actionstream] ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ finp(⌜x⌝ ); (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m < n → (n ≤ m ↔ false); (s) n0 ≤ n ⊦ m ≤ n - n0 ↔ m + n0 ≤ n; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ¬ finp(σ) → # σ = ∞; (s) ⊦ ¬ ∞ < n∞; (s) ⊦ ⌜m⌝ < n∞ → (⌜m⌝ + ⌜1⌝ < n∞ ↔ ⌜m⌝ + ⌜1⌝ ≠ n∞); (ss) ⊦ n∞ = ⌜m⌝ + ⌜n0⌝ → (⌜n⌝ < n∞ ↔ n < m + n0); (s) ⊦ ¬ n < n; (s) ⊦ n∞1 < n∞ + n∞1 ↔ n∞ ≠ ⌜0⌝ ∧ n∞1 ≠ ∞; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ = ⌜m⌝ + ⌜n⌝ → (n∞ = ∞ ↔ false); (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ m + 1 ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < 1 ↔ m = 0; (s) Used terms: n + 1, α

Proof step 39 from proof remtau-to-strong (previous step) (back to tree)

⊦ ⌜n⌝ < # σ ∧ finp(σ) → #(σ from n) = ⌜(# σ).n - n⌝

A spec-lemma

Proof Tree for remtau-to-strong (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