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

⊦ β ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [])

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

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

β ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

β ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. β = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

User applied rule structural induction

And obtained the following new goals

Rule argument

indvar: β

Additional information

Used simplifier rules: actionstream freely generated by ⌜ ⌝, ⌜ ⌝;;

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

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = []

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:split-finite-remtau-fin, seq:⊦ ⌜al1⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. ⌜al1⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []), subst:[al1, al] → [al0, al]

Additional information

Used terms: al0, al

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

⊦ ⌜al1⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al0, α. ⌜al1⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [])

Lemma split-finite-remtau-fin

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

⌜al0⌝ ^ = ⌜al⌝ , al ≠ [], ⌜al0⌝ ^ = ⌜al⌝ ∧ al ≠ [] → (∃ al2, α. ⌜al0⌝ = ⌜al2⌝ + α ∧ al2 ≠ [] ∧ ⌜al2⌝ ^ = ⌜al⌝ ∧ al2.last = al.last ∧ α ^ = []) ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

al2.last = al.last, ⌜al0⌝ ^ = ⌜al⌝ , ⌜al2⌝ ^ = ⌜al⌝ , β ^ = [], ⌜al0⌝ = ⌜al2⌝ + β, al ≠ [], al2 ≠ [] ⊦ ∃ al1, α. ⌜al0⌝ = ⌜al1⌝ + α ∧ al1 ≠ [] ∧ ⌜al1⌝ ^ = ⌜al⌝ ∧ al1.last = al.last ∧ α ^ = []

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: al2, β

Additional information

Used terms: al2, β

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

⌜af⌝ ^ = ⌜al⌝ , al ≠ [] ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-inf, seq: ⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ), subst:[af] → [af]

Additional information

Used terms: af

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

⊦ finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ)

Lemma remtau-inf

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

⌜af⌝ ^ = ⌜al⌝ , al ≠ [], finp(⌜af⌝ ^) ↔ (∃ n. ∀ m. n ≤ m → af(m) = τ) ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Additional information

Used formulas: ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

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

⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ) ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: af to n0 + 1, ⌜af from n0 + 1⌝ abort: F discard: T computed: F

Additional information

Used terms: af to n0 + 1, ⌜af from n0 + 1⌝

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

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ ⌜af⌝ = ⌜af to n0 + 1⌝ + ⌜af from n0 + 1⌝ ∧ af to n0 + 1 ≠ [] ∧ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 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 + 1 ≠ 0; (s) ⊦ nf to n = [] ↔ n = 0; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜nf to n⌝ + ⌜nf from n⌝ = ⌜nf⌝ ↔ true; (ss)

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

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ⌜af to n0 + 1⌝ ^ = ⌜al⌝ ∧ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-tofin-strong, seq:¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^, subst:[β, n] → [⌜af⌝ , n0 + 1], <all paths>

Additional information

Used terms: ⌜af⌝ , n0 + 1

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

¬ # β < ⌜n⌝ , ∀ m. n ≤ m ∧ ⌜m⌝ < # β → β[m] = τ ⊦ β ^ = (β to n)^

Lemma remtau-tofin-strong

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

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

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

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

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

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: n1

Additional information

Used terms: n1

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

⌜af to n0 + 1⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ (af to n0 + 1).last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:to-unwind-end-inf, seq: ⊦ nf to m + 1 = (nf to m) + nf(m) ', subst:[m, nf] → [n0, af], <all paths>

Additional information

Used terms: n0, af

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

⊦ nf to m + 1 = (nf to m) + nf(m) '

A spec-lemma

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

⌜(af to n0) + af(n0) '⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ((af to n0) + af(n0) ').last = al.last ∧ ⌜af from n0 + 1⌝ ^ = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: remtau-fin-append: ⊦ (⌜al⌝ + ⌜al2⌝ )^ = ⌜al⌝ ^ + ⌜al2⌝ ^; remtau-one: ⊦ a ≠ τ → ⌜a '⌝ ^ = ⌜a '⌝ ; a: ⊦ (x + y) + z = x + y + z; from specification list[actionstream] ⊦ (x + a ').last = a; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

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

⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = al.last ∧ ⌜af from n0 + 1⌝ ^ = []

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[actionstream], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [al, a, al0]

Additional information

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

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

⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al⌝ , al = al0 + a ', af(n0) ≠ τ, al ≠ [], ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 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[actionstream] ⊦ x + a ' ≠ []; (s) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s)

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

⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = []

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-tofin, seq:∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = [], subst:[β] → [⌜af from n0 + 1⌝ ], <all paths>

Additional information

Used terms: ⌜af from n0 + 1⌝

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

∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = []

Lemma remtau-tofin

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

⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ ⊦ ∀ n. ⌜n⌝ < # ⌜af from n0 + 1⌝ → ⌜af from n0 + 1⌝ [n] = τ, af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s)

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

⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, af(n1 + n0 + 1) ≠ τ, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ ⊦ af(n0) = a ∧ ⌜af from n0 + 1⌝ ^ = []

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: n1 + n0 + 1

Additional information

Used simplifier rules: ⊦ m < n + 1 ↔ ¬ n < m; (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 Used terms: n1 + n0 + 1

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

⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n. ⌜n⌝ < # ⌜af from n0 + 1⌝ → ⌜af from n0 + 1⌝ [n] = τ ⊦ af(n0) = a ∧ [] = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s)

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

⌜af to n0⌝ ^ + ⌜af(n0) '⌝ = ⌜al0⌝ + ⌜a '⌝ , af(n0) ≠ τ, af(n0) ≠ a, ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:extensionality, seq: ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]), subst:[σ1, σ0] → [⌜al0⌝ + ⌜a '⌝ , ⌜af to n0⌝ ^ + ⌜af(n0) '⌝ ], <all paths>

Additional information

Used terms: ⌜al0⌝ + ⌜a '⌝ , ⌜af to n0⌝ ^ + ⌜af(n0) '⌝

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

⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])

A spec-lemma

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

#(⌜af to n0⌝ ^ + ⌜af(n0) '⌝ ) = #(⌜al0⌝ + ⌜a '⌝ ), af(n0) ≠ τ, af(n0) ≠ a, ∀ n1. af(n1 + n0 + 1) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n. ⌜n⌝ < #(⌜af to n0⌝ ^ + ⌜af(n0) '⌝ ) → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[n] = (⌜al0⌝ + ⌜a '⌝ )[n] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[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 ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s)

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

# ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ a, af(n0) ≠ τ, ∀ n1. af(n1 + n0 + 1) = τ, ∀ m. n0 < m → af(m) = τ, ∀ m. n ≤ m → af(m) = τ, ∀ n1. ¬ # al0 < n1 → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[n1] = (al0 + a ')[n1] ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: # al0 abort: F discard: T computed: T

Additional information

Used terms: # al0

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

# ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ a, af(n0) ≠ τ, ¬ # al0 < # al0 → (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[# al0] = (al0 + a ')[# al0], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 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[actionstream] ⊦ (x + a ')[# x] = a; (s) ⊦ ¬ n < n; (s)

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

# ⌜af to n0⌝ ^ = ⌜# al0⌝ , af(n0) ≠ τ, af(n0) ≠ (⌜af to n0⌝ ^ + ⌜af(n0) '⌝ )[# al0], ∀ m. n ≤ m → af(m) = τ, ∀ m. n0 < m → af(m) = τ, ∀ n1. af(n1 + n0 + 1) = τ ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: stream[actionstream], name:get-append-notls, seq: ⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n], subst:[m, σ1, σ] → [# al0, ⌜af(n0) '⌝ , ⌜af to n0⌝ ^], <all paths>

Additional information

Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜n⌝ .n = n; (s) ⊦ m - m = 0; (s) ⊦ a '[0] = a; (s) ⊦ ⌜m⌝ < # σ → (σ + σ1)[m] = σ[m]; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream[actionstream] ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ¬ n < n; (s) Used terms: # al0, ⌜af(n0) '⌝ , ⌜af to n0⌝ ^

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

⊦ ¬ ⌜m⌝ < # σ → (σ + σ1)[m] = σ1[m - (# σ).n]

A spec-lemma

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

⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ n. af(n) ≠ τ

Additional information

Used formulas: ∃ n. af(n) ≠ τ

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

⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∃ n. af(n) ≠ τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = []

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: right 1

Additional information

Proof step 40 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

User applied rule induction

And obtained the following new goals

Rule argument

indvar: n wfpred: <

Additional information

Used simplifier rules: <; (wellfounded) Used terms: n

Proof step 41 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 42 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: n = 0

Additional information

Used formulas: n = 0

Proof step 43 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , n = 0, af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 0 ≤ m; (s)

Proof step 44 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. af(m) = τ, ∀ n0, af, al, n2. n0 < 0 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: n0

Additional information

Used terms: n0

Proof step 45 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: n - 1 abort: F discard: F computed: F

Additional information

Used terms: n - 1

Proof step 46 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n - 1) ≠ τ ∧ (∀ m. n - 1 < m → af(m) = τ)

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) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m < 1 ↔ m = 0; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)

Proof step 47 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n - 1) ≠ τ ∧ (¬ n1 < n → af(n1) = τ)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: nat, name:elim-pred-c, seq:n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1, subst:[n, m] → [n, n3]

Additional information

Used simplifier rules: n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: n, m0

Proof step 48 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , n = n3 + 1, af(n0) ≠ τ, al ≠ [], n ≠ 0, ∀ m. n ≤ m → af(m) = τ, ∀ n0, af, al, n2. n0 < n → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n3) ≠ τ ∧ (¬ n1 < n → af(n1) = τ)

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) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ m + 1 ≠ 0; (s)

Proof step 49 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), af(n3) ≠ τ ∧ (n3 < n1 → af(n1) = τ)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Proof step 50 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 51 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

User applied rule apply induction

And obtained the following new goals

Rule argument

subst: [n0, af, al, n2] → [n3, af, al, n0]

Additional information

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

Proof step 52 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ⌜af⌝ ^ = ⌜al⌝ ∧ af(n0) ≠ τ ∧ al ≠ [] ∧ (∀ m. n3 ≤ m → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 53 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, af(n) ≠ τ, al ≠ [], n3 ≤ n, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: n

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ m ≤ n → (n ≤ m ↔ m = n); (s) Used terms: n

Proof step 54 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, al ≠ [], ∀ m. n3 < m → af(m) = τ, ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 55 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n3) = τ, af(n0) ≠ τ, af(n) ≠ τ, al ≠ [], ∀ m. n < m → af(m) = τ, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

User applied rule exists right

And closed the goal!

Rule argument

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

Additional information

Used terms: n

Proof step 56 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n1) ≠ τ, af(n0) ≠ τ, al ≠ [], n3 < n1, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

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

Proof step 57 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, af(n1) ≠ τ, al ≠ [], n3 < n1, ∀ m. n3 < m → af(m) = τ, ∀ n0, af, al, n2. n0 < n3 + 1 → ⌜af⌝ ^ = ⌜al⌝ ∧ af(n2) ≠ τ ∧ al ≠ [] ∧ (∀ m. n0 ≤ m → af(m) = τ) → (∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)) ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: n1

Additional information

Used terms: n1

Proof step 58 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:remtau-tofin, seq:∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = [], subst:[β] → [⌜af⌝ ], <all paths>

Additional information

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

Proof step 59 from proof split-finite-remtau (previous step) (back to tree)

∀ n. ⌜n⌝ < # β → β[n] = τ ⊦ β ^ = []

Lemma remtau-tofin

Proof step 60 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∀ n. ⌜n⌝ < # ⌜af⌝ → ⌜af⌝ [n] = τ, ∃ n. af(n) ≠ τ, ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s)

Proof step 61 from proof split-finite-remtau (previous step) (back to tree)

⌜af⌝ ^ = ⌜al⌝ , af(n0) ≠ τ, al ≠ [], ∀ m. n ≤ m → af(m) = τ ⊦ ∃ n. af(n) ≠ τ ∧ (∀ m. n < m → af(m) = τ), ∃ al0, α. ⌜af⌝ = ⌜al0⌝ + α ∧ al0 ≠ [] ∧ ⌜al0⌝ ^ = ⌜al⌝ ∧ al0.last = al.last ∧ α ^ = [], ∃ n. af(n) ≠ τ

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 3 terms: n0

Additional information

Used terms: n0

Proof Tree for split-finite-remtau (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